SearcharxivSearch

arXiv · 2510.14010

Algebraic $n$-Valued Monoids on $\mathbb{C}P^1$, Discriminants and Projective Duality

Abstract

In this work, we establish connections between the theory of algebraic $n$-valued monoids and groups and the theories of discriminants and projective duality. We show that the composition of projective duality followed by the M\"obius transformation $z\mapsto 1/z$ defines a shift operation $\mathbb{M}_n(\mathbb{C}P^1)\mapsto \mathbb{M}_{n-1}(\mathbb{C}P^1)$ in the family of algebraic $n$-valued coset monoids $\{\mathbb{M}_{n}(\mathbb{C}P^1)\}_{n\in\mathbb{N}}$. We also show that projective duality sends each Fermat curve $x^n+y^n=z^n$ $(n\ge 2)$ to the curve $p_{n-1}(z^n; x^n, y^n)=0$, where the polynomial $p_n(z;x,y)$ defines the addition law in the monoid $\mathbb{M}_n(\mathbb{C}P^1)$. We solve the problem of describing coset $n$-valued addition laws constructed from cubic curves. As a corollary, we obtain that all such addition laws are given by polynomials, whereas the addition laws of formal groups on general cubic curves are given by series.

Explore related subjects

Keep this discovery

BibTeXRIS

Victor Buchstaber, Mikhail Kornev. 2025-10-15. Algebraic $n$-Valued Monoids on $\mathbb{C}P^1$, Discriminants and Projective Duality. https://arxiv.org/abs/2510.14010

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