期刊文献+
共找到3篇文章
< 1 >
每页显示 20 50 100
LOCAL INEQUALITIES FOR SIDON SUMS AND THEIR APPLICATIONS 被引量:1
1
作者 范爱华 章逸平 《Acta Mathematica Scientia》 SCIE CSCD 2005年第2期305-316,共12页
The authors consider Sidon sets of first kind. By comparing them with the Steinhaus sequence, they prove a local Khintchine-Kahane inequality on compact sets. As consequences, they prove the following results for Sido... The authors consider Sidon sets of first kind. By comparing them with the Steinhaus sequence, they prove a local Khintchine-Kahane inequality on compact sets. As consequences, they prove the following results for Sidon series taking values in a Banach space: the summability on a set of positive measure implies the almost everywhere convergence; the contraction principle of Billard-Kahane remains true for Sidon series. As applications, they extend a uniqueness theorem of Zygmund concerning lacunary Fourier series and an analytic continuation theorem of Hadamard concerning lacunary Taylor series. Some of their results still hold for Sidon sets of second kind. 展开更多
关键词 sidon set. Khintchine-Kahanc inequality maximal inequality comparison principle contraction principle
下载PDF
Constructions of Sidon spaces and cyclic subspace codes
2
作者 He ZHANG Xiwang CAO 《Frontiers of Mathematics in China》 SCIE CSCD 2022年第2期275-288,共14页
In this paper,we firstly construct several new kinds of Sidon spaces and Sidon sets by investigating some known results.Secondly,using these Sidon spaces,we will present a construction of cyclic subspace codes with ca... In this paper,we firstly construct several new kinds of Sidon spaces and Sidon sets by investigating some known results.Secondly,using these Sidon spaces,we will present a construction of cyclic subspace codes with cardinality τ,q^(n)-1/q-1 and minimum distance 2k-2,whereτis a positive integer.We further-more give some cyclic subspace codes with size 2τ·q^(n)-1/q-1 and without changing the minimum distance 2k-2. 展开更多
关键词 sidon spaces sidon sets cyclic subspace codes minimum distance
原文传递
Probabilistic Constructions of B_2[g] Sequences
3
作者 Javier CILLERUELO 《Acta Mathematica Sinica,English Series》 SCIE CSCD 2010年第7期1309-1314,共6页
We use the probabilistic method to prove that for any positive integer g there exists an infinite B2[g] sequence A = {ak} such that ak ≤ k^2+1/g(log k)^1/g+0(1) as k→∞. The exponent 2+1/g improves the previo... We use the probabilistic method to prove that for any positive integer g there exists an infinite B2[g] sequence A = {ak} such that ak ≤ k^2+1/g(log k)^1/g+0(1) as k→∞. The exponent 2+1/g improves the previous one, 2 + 2/g, obtained by Erdos and Renyi in 1960. We obtain a similar result for B2 [g] sequences of squares. 展开更多
关键词 sidon sets B2 [g] sequences probabilistic method
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部