اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدA Fourier-analytic Approach to Counting Partial Hadamard Matrices
120
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In this paper, we study a family of lattice walks which are related to the Hadamard conjecture. There is a bijection between paths of these walks which originate and terminate at the origin and equivalence classes of partial Hadamard matrices. Therefore, the existence of partial Hadamard matrices can be proved by showing that there is positive probability of a random walk returning to the origin after a specified number of steps. Moreover, the number of these designs can be approximated by estimating the return probabilities. We use the inversion formula for the Fourier transform of the random walk to provide such estimates. We also include here an upper bound, derived by elementary methods, on the number of partial Hadamard.
قيم البحث
اقرأ أيضاً
Let $d$ be a positive integer and $U subset mathbb{Z}^d$ finite. We study $$beta(U) : = inf_{substack{A , B eq emptyset text{finite}}} frac{|A+B+U|}{|A|^{1/2}{|B|^{1/2}}},$$ and other related quantities. We employ tensorization, which is not availa
ble for the doubling constant, $|U+U|/|U|$. For instance, we show $$beta(U) = |U|,$$ whenever $U$ is a subset of ${0,1}^d$. Our methods parallel those used for the Prekopa-Leindler inequality, an integral variant of the Brunn-Minkowski inequality.
Let $M_n$ be a random $ntimes n$ matrix with i.i.d. $text{Bernoulli}(1/2)$ entries. We show that for fixed $kge 1$, [lim_{nto infty}frac{1}{n}log_2mathbb{P}[text{corank }M_nge k] = -k.]
Let $xi$ be a non-constant real-valued random variable with finite support, and let $M_{n}(xi)$ denote an $ntimes n$ random matrix with entries that are independent copies of $xi$. For $xi$ which is not uniform on its support, we show that begin{alig
n*} mathbb{P}[M_{n}(xi)text{ is singular}] &= mathbb{P}[text{zero row or column}] + (1+o_n(1))mathbb{P}[text{two equal (up to sign) rows or columns}], end{align*} thereby confirming a folklore conjecture. As special cases, we obtain: (1) For $xi = text{Bernoulli}(p)$ with fixed $p in (0,1/2)$, [mathbb{P}[M_{n}(xi)text{ is singular}] = 2n(1-p)^{n} + (1+o_n(1))n(n-1)(p^2 + (1-p)^2)^{n},] which determines the singularity probability to two asymptotic terms. Previously, no result of such precision was available in the study of the singularity of random matrices. (2) For $xi = text{Bernoulli}(p)$ with fixed $p in (1/2,1)$, [mathbb{P}[M_{n}(xi)text{ is singular}] = (1+o_n(1))n(n-1)(p^2 + (1-p)^2)^{n}.] Previously, only the much weaker upper bound of $(sqrt{p} + o_n(1))^{n}$ was known due to the work of Bourgain-Vu-Wood. For $xi$ which is uniform on its support: (1) We show that begin{align*} mathbb{P}[M_{n}(xi)text{ is singular}] &= (1+o_n(1))^{n}mathbb{P}[text{two rows or columns are equal}]. end{align*} (2) Perhaps more importantly, we provide a sharp analysis of the contribution of the `compressible part of the unit sphere to the lower tail of the smallest singular value of $M_{n}(xi)$.
In this paper, we generalize classical constructions of skew Hadamard difference families with two or four blocks in the additive groups of finite fields given by Szekeres (1969, 1971), Whiteman (1971) and Wallis-Whiteman (1972). In particular, we sh
ow that there exists a skew Hadamard difference family with $2^{u-1}$ blocks in the additive group of the finite field of order $q^e$ for any prime power $qequiv 2^u+1,({mathrm{mod, , }2^{u+1}})$ with $uge 2$ and any positive integer $e$. In the aforementioned work of Szekeres, Whiteman, and Wallis-Whiteman, the constructions of skew Hadamard difference families with $2^{u-1}$ ($u=2$ or $3$) blocks in $({mathbb F}_{q^e},+)$ depend on the exponent $e$, with $eequiv 1,2,$ or $3,({mathrm{mod, , }4})$ when $u=2$, and $eequiv 1,({mathrm{mod, , }2})$ when $u=3$, respectively. Our more general construction, in particular, removes the dependence on $e$. As a consequence, we obtain new infinite families of skew Hadamard matrices.
Golay complementary sequences have been put a high value on the applications in orthogonal frequency-division multiplexing (OFDM) systems since its good peak-to-mean envelope power ratio(PMEPR) properties. However, with the increase of the code lengt
h, the code rate of the standard Golay sequences suffer a dramatic decline. Even though a lot of efforts have been paid to solve the code rate problem for OFDM application, how to construct large classes of sequences with low PMEPR is still difficult and open now. In this paper, we propose a new method to construct $q$-ary Golay complementary set of size $N$ and length $N^n$ by $Ntimes N$ Hadamard Matrices where $n$ is arbitrary and $N$ is a power of 2. Every item of the constructed sequences can be presented as the product of the specific entries of the Hadamard Matrices. The previous works in cite{BudIT} can be regarded as a special case of the constructions in this paper and we also obtained new quaternary Golay sets never reported in the literature.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
