اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدNonsingular splittings over finite fields
82
0
0.0
(
0
)
تأليف
Pingzhi Yuan
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We say that $M$ and $S$ form a textsl{splitting} of $G$ if every nonzero element $g$ of $G$ has a unique representation of the form $g=ms$ with $min M$ and $sin S$, while $0$ has no such representation. The splitting is called {it nonsingular} if $gcd(|G|, a) = 1$ for any $ain M$. In this paper, we focus our study on nonsingular splittings of cyclic groups. We introduce a new notation --direct KM logarithm and we prove that if there is a prime $q$ such that $M$ splits $mathbb{Z}_q$, then there are infinitely many primes $p$ such that $M$ splits $mathbb{Z}_p$.
قيم البحث
اقرأ أيضاً
An orthomorphism over a finite field $mathbb{F}_q$ is a permutation $theta:mathbb{F}_qmapstomathbb{F}_q$ such that the map $xmapstotheta(x)-x$ is also a permutation of $mathbb{F}_q$. The degree of an orthomorphism of $mathbb{F}_q$, that is, the degre
e of the associated reduced permutation polynomial, is known to be at most $q-3$. We show that this upper bound is achieved for all prime powers $q otin{2, 3, 5, 8}$. We do this by finding two orthomorphisms in each field that differ on only three elements of their domain. Such orthomorphisms can be used to construct $3$-homogeneous Latin bitrades.
A $(k,m)$-Furstenberg set $S subset mathbb{F}_q^n$ over a finite field is a set that has at least $m$ points in common with a $k$-flat in every direction. The question of determining the smallest size of such sets is a natural generalization of the f
inite field Kakeya problem. The only previously known bound for these sets is due to Ellenberg-Erman and requires sophisticated machinery from algebraic geometry. In this work we give new, completely elementary and simple, proofs which significantly improve the known bounds. Our main result relies on an equivalent formulation of the problem using the notion of min-entropy, which could be of independent interest.
In this short note, we study the distribution of spreads in a point set $mathcal{P} subseteq mathbb{F}_q^d$, which are analogous to angles in Euclidean space. More precisely, we prove that, for any $varepsilon > 0$, if $|mathcal{P}| geq (1+varepsilon
) q^{lceil d/2 rceil}$, then $mathcal{P}$ generates a positive proportion of all spreads. We show that these results are tight, in the sense that there exist sets $mathcal{P} subset mathbb{F}_q^d$ of size $|mathcal{P}| = q^{lceil d/2 rceil}$ that determine at most one spread.
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.
Given three nonnegative integers $p,q,r$ and a finite field $F$, how many Hankel matrices $left( x_{i+j}right) _{0leq ileq p, 0leq jleq q}$ over $F$ have rank $leq r$ ? This question is classical, and the answer ($q^{2r}$ when $rleqminleft{ p,qright}
$) has been obtained independently by various authors using different tools (Daykin, Elkies, Garcia Armas, Ghorpade and Ram). In this note, we study a refinement of this result: We show that if we fix the first $k$ of the entries $x_{0},x_{1},ldots,x_{k-1}$ for some $kleq rleqminleft{ p,qright} $, then the number of ways to choose the remaining $p+q-k+1$ entries $x_{k},x_{k+1},ldots,x_{p+q}$ such that the resulting Hankel matrix $left( x_{i+j}right) _{0leq ileq p, 0leq jleq q}$ has rank $leq r$ is $q^{2r-k}$. This is exactly the answer that one would expect if the first $k$ entries had no effect on the rank, but of course the situation is not this simple. The refined result generalizes (and provides an alternative proof of) a result by Anzis, Chen, Gao, Kim, Li and Patrias on evaluations of Jacobi-Trudi determinants over finite fields.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
