SearcharxivSearch

arXiv · 2505.04296

$n$-Valued Groups, Kronecker Sums, and Wendt's Matrices

Abstract

The article presents results on the well-known problem concerning the structure of integer polynomials $p_n(z; x, y)$, which define multiplication laws in $n$-valued groups $\mathbb{G}_n$ over the field of complex numbers $\mathbb{C}$. We show that the $n$-valued multiplication in the group $\mathbb{G}_n$ is realized in terms of the eigenvalues of the Kronecker sum of companion Frobenius matrices for polynomials of the form $t^n - x$ in the variable $t$. The notion of a Wendt $(x, y, z)$-matrix is introduced. When $x = (-1)^n$, $y = z = 1$, one recovers the classical Wendt matrix, whose determinant is used in number theory in connection with Fermat's Last Theorem. It is shown that for each positive integer $n$, the polynomial $p_n$ is given by the determinant of a Wendt $(x, y, z)$-matrix. Iterations of the $n$-valued multiplication in the group $\mathbb{G}_n$ lead to polynomials $p_n(z; x_1, \dots, x_m)$. We prove the irreducibility of the polynomial $p_n(z; x_1, \dots, x_m)$ over various fields. For each $n$, we introduce the notion of classes of symmetric $n$-algebraic $n$-valued groups. The group $\mathbb{G}_n$ belongs to one of these classes. For $n = 2, 3$, a description of the universal objects of these classes is obtained.

Explore related subjects

Keep this discovery

BibTeXRIS

Victor Buchstaber, Mikhail Kornev. 2025-05-07. $n$-Valued Groups, Kronecker Sums, and Wendt's Matrices. https://arxiv.org/abs/2505.04296

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

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR