ترغب بنشر مسار تعليمي؟ اضغط هنا

Frames over finite fields: Basic theory and equiangular lines in unitary geometry

70   0   0.0 ( 0 )
 نشر من قبل Joseph Iverson
 تاريخ النشر 2020
  مجال البحث
والبحث باللغة English




اسأل ChatGPT حول البحث

We introduce the study of frames and equiangular lines in classical geometries over finite fields. After developing the basic theory, we give several examples and demonstrate finite field analogs of equiangular tight frames (ETFs) produced by modular difference sets, and by translation and modulation operators. Using the latter, we prove that Gerzons bound is attained in each unitary geometry of dimension $d = 2^{2l+1}$ over the field $mathbb{F}_{3^2}$. We also investigate interactions between complex ETFs and those in finite unitary geometries, and we show that every complex ETF implies the existence of ETFs with the same size over infinitely many finite fields.



قيم البحث

اقرأ أيضاً

We investigate equiangular lines in finite orthogonal geometries, focusing specifically on equiangular tight frames (ETFs). In parallel with the known correspondence between real ETFs and strongly regular graphs (SRGs) that satisfy certain parameter constraints, we prove that ETFs in finite orthogonal geometries are closely aligned with a modular generalization of SRGs. The constraints in our finite field setting are weaker, and all but~18 known SRG parameters on $v leq 1300$ vertices satisfy at least one of them. Applying our results to triangular graphs, we deduce that Gerzons bound is attained in finite orthogonal geometries of infinitely many dimensions. We also demonstrate connections with real ETFs, and derive necessary conditions for ETFs in finite orthogonal geometries. As an application, we show that Gerzons bound cannot be attained in a finite orthogonal geometry of dimension~5.
The set of points in a metric space is called an $s$-distance set if pairwise distances between these points admit only $s$ distinct values. Two-distance spherical sets with the set of scalar products ${alpha, -alpha}$, $alphain[0,1)$, are called equ iangular. The problem of determining the maximum size of $s$-distance sets in various spaces has a long history in mathematics. We suggest a new method of bounding the size of an $s$-distance set in compact two-point homogeneous spaces via zonal spherical functions. This method allows us to prove that the maximum size of a spherical two-distance set in $mathbb{R}^n$, $ngeq 7$, is $frac{n(n+1)}2$ with possible exceptions for some $n=(2k+1)^2-3$, $k in mathbb{N}$. We also prove the universal upper bound $sim frac 2 3 n a^2$ for equiangular sets with $alpha=frac 1 a$ and, employing this bound, prove a new upper bound on the size of equiangular sets in all dimensions. Finally, we classify all equiangular sets reaching this new bound.
294 - Marina Haikin , Ram Zamir 2021
This note outlines the steps for proving that the moments of a randomly-selected subset of a general ETF (complex, with aspect ratio $0<gamma<1$) converge to the corresponding MANOVA moments. We bring here an extension for the proof of the Kesten-Mck ay moments (real ETF, $gamma=1/2$) cite{magsino2020kesten}. In particular, we establish a recursive computation of the $r$th moment, for $r = 1,2,ldots$, and verify, using a symbolic program, that the recursion output coincides with the MANOVA moments.
In this article we start a systematic study of the bi-Lipschitz geometry of lamplighter graphs. We prove that lamplighter graphs over trees bi-Lipschitzly embed into Hamming cubes with distortion at most~$6$. It follows that lamplighter graphs over c ountable trees bi-Lipschitzly embed into $ell_1$. We study the metric behaviour of the operation of taking the lamplighter graph over the vertex-coalescence of two graphs. Based on this analysis, we provide metric characterizations of superreflexivity in terms of lamplighter graphs over star graphs or rose graphs. Finally, we show that the presence of a clique in a graph implies the presence of a Hamming cube in the lamplighter graph over it. An application is a characterization in terms of a sequence of graphs with uniformly bounded degree of the notion of trivial Bourgain-Milman-Wolfson type for arbitrary metric spaces, similar to Ostrovskiis characterization previously obtained in cite{ostrovskii:11}.
Negative type inequalities arise in the study of embedding properties of metric spaces, but they often reduce to intractable combinatorial problems. In this paper we study more quantitati
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا