Search arXivSearch

arXiv · 1704.04183

Formal duality in finite cyclic groups

Abstract

The notion of formal duality in finite Abelian groups appeared recently in relation to spherical designs, tight sphere packings, and energy minimizing configurations in Euclidean spaces. For finite cyclic groups it is conjectured that there are no primitive formally dual pairs besides the trivial one and the TITO configuration. This conjecture has been verified for cyclic groups of prime power order, as well as of square-free order. In this paper, we will confirm the conjecture for other classes of cyclic groups, namely almost all cyclic groups of order a product of two prime powers, with finitely many exceptions for each pair of primes, or whose order $N$ satisfies $p\mid\!\mid N$, where $p$ a prime satisfying the so-called self-conjugacy property with respect to $N$. For the above proofs, various tools were needed: the field descent method, used chiefly for the circulant Hadamard conjecture, the techniques of Coven & Meyerowitz for sets that tile $\mathbb{Z}$ or $\mathbb{Z}_N$ by translations, dubbed herein as the polynomial method, as well as basic number theory of cyclotomic fields, especially the splitting of primes in a given cyclotomic extension.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Romanos Diogenes Malikiosis. 2018-01-30. Formal duality in finite cyclic groups. https://doi.org/10.1007/s00365-018-9421-y

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Asymptotic density of k-almost primes

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : Ω(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$π_k(x):=\ \mid\{n\leq x : ω(n)=k\}\mid,$$ is known to be fairly poor for $k > 1$, and when $k$ is allowed to tend to infinity with $x$, the study of $N_k(x)$ and $π_k(x)$ becomes very technical [1, Chapter II.6, $§$ 6.1, p.200]. I hope to show that the method described below provides not only a more accurate approach, but rather increases in its asymptotic accuracy as $k$ tends to infinity.

math.NT

Transcendence Meets Normality: Construction of Transcendentally Normal Numbers

In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally normal and provide an explicit construction of such a number, based on Sierpinski's covering method and novel ideas involving the so-called stretch function. In the next step, we transform this construction into an algorithm that computes the digits of a t-normal number recursively in all integer bases. Moreover, we extend our covering approach to construct and compute LIL-normal numbers whose discrepancies are of the order predicted by the law of the iterated logarithm. We also take the opportunity to discuss several interesting open problems.

math.NT