2000 character limit reached
Nonsingular splittings over finite fields
Published 18 Jan 2021 in math.CO | (2101.06899v1)
Abstract: 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 $m\in M$ and $s\in S$, while $0$ has no such representation. The splitting is called {\it nonsingular} if $\gcd(|G|, a) = 1$ for any $a\in 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$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.