SearcharxivSearch

arXiv · 2605.16974

n-ary elliptic groups, rings, and primes in arithmetic progressions

Abstract

I introduced the notion of an elliptic group in [Elliptic groups and rings. Beitr\"age zur Algebra und Geometrie 66(2), 497-529]. It is a quasi-group based on the tangent-chord law of elliptic curves and thus, becomes an abelian group upon singling out an element. This close proximity to abelian groups is reflected in the theory, and among other things, we can define elliptic rings, which are monoidal objects in elliptic groups. An other way of expressing this is to say that they are commutative monoids with an elliptic group structure that distributes over them. In this paper, we generalise this theory from the binary elliptic group structure to the $n$-ary structure, which we call $n$-ary elliptic groups and $n$-ary elliptic rings. The latter are once again (binary) commutative monoids with an $n$-ary operation that distributes over the monoidal structure in an $n$-ary sense. The key interest of these objects for us is their arithmetic properties, which are surprisingly pleasant. The key result is that Dirichlet's famous theorem on arithmetic progressions becomes simply Euclid's theorem in these $n$-ary rings, at least for progressions of the form $an + 1$. Motivated by the hope to eventually prove this $n$-ary Euclidean theorem purely algebraically using the theory of $n$-ary rings (and thus give an alternative and purely algebraic proof of Dirichlet's theorem), we start by exploring the first arithmetic facts of these objects, including introducing the $n$-ary class group and showing that it indeed captures the unique $n$-ary factorisation. We also obtain a type of Dedekinds theorem for our main $n$-ary ring of interest: $\mathsf{nEl}(\mathbb{Z})$.

Explore related subjects

Keep this discovery

BibTeXRIS

Ilia Pirashvili. 2026-05-16. n-ary elliptic groups, rings, and primes in arithmetic progressions. https://arxiv.org/abs/2605.16974

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

KEEP EXPLORING

Related papers

Invariants of Nilpotent Lie Algebras via Geometry and Algebra with a Focus on Computation

We consider the problem of computing rational invariants of nilpotent Lie algebras. We compare two methods that are commonly used for this task: the method of integral curves and the Dixmier map. Given a derivation of a rational function field with polynomial coefficients, we formulate a condition under which the kernel can be recovered from a family of rational integral curves, and we show that triangular derivations satisfy this hypothesis. This yields an explicit description of the kernel as a purely transcendental extension and produces algebraically independent generators. We also show that, in the triangular case, the resulting generators agree with those obtained from the Dixmier map via a local slice. A careful analysis of the generating set obtained from this method leads to an algorithm for computing generators of the rational invariant field of a nilpotent Lie algebra. An implementation of the methods is available in the SageMath system.

math.RA

Quasilinear multiplication in the real Cayley--Dickson tower

Direct evaluation of the defining product in the real Cayley--Dickson algebra $A_n$, of dimension $N=2^n$, has quadratic arithmetic complexity. This paper gives a uniform algorithm for multiplication using $O(N\log N)$ real arithmetic operations and $O(N)$ auxiliary storage. The algorithm reduces multiplication to the alternating product on the imaginary subspace, then evaluates that product by a two-call recursion over one fixed quadratic coefficient extension. For $n\ge1$, the resulting bilinear algorithm uses at most $(9n-15)2^{n-1}+10$ input-dependent real multiplications, and for $n\ge3$, the specified arithmetic schedule uses $(34n-83)2^{n-1}+50$ real operations in total. Under this counting convention, the quasilinear schedule uses fewer operations than direct multiplication for $N\ge16$ and than the uniform Cariow--Cariowa method for $N\ge32$. The algorithm is implemented in the MIT-licensed C11 library fastCD, with a NumPy-backed Python interface, and its results are checked against an independent implementation of the defining recursion. In single-core benchmarks against direct multiplication and the uniform Cariow--Cariowa method, the quasilinear implementation had the lowest mean time of the three at every tested dimension $N\ge32$, for both single and batched products, and was roughly $16$ times faster than direct multiplication at $N=1024$.

math.RA

Graded classification of Leavitt path algebras in terms of strong shift equivalence

Given two finite essential adjacency matrices $A$ and $B$, Hazrat's graded classification conjectures posit that an order preserving $\mathbb{Z}[x,x^{-1}]$-module isomorphism of $K_0$ groups implies graded Morita equivalence of the Leavitt path algebras of $A$ and $B$, while the pointed version predicts a graded isomorphism of the Leavitt path algebras when the $K_0$ group isomorphism additionally preserves the class of the regular module. For any field $k$, we show that the Leavitt path algebras over $k$ of $A$ and $B$ are graded Morita equivalent if and only if $A$ and $B$ are strong shift equivalent. By appealing to counterexamples of Kim and Roush from symbolic dynamics, this shows that Hazrat's graded classification conjectures are false.

math.RA