SearcharxivSearch

arXiv · 2606.29397

Strongly Primitive Salem Growth Polynomials for Right-Angled Coxeter Groups

Abstract

We study standard spherical growth rates of right-angled Coxeter groups through the clique polynomial of the defining graph. We prove that every even degree at least four occurs as the degree of a strongly primitive Salem growth rate: for each $d \geq 2$, there are infinitely many connected $K_{2d+1}$-free defining graphs whose full reciprocal-radius polynomial is an irreducible Salem polynomial of degree $2d$. We also prove independence-polynomial obstructions for prescribed Salem polynomials, including a sharp first-coefficient bound $a_1 \leq -5$, and apply them to Lehmer's polynomial and its suspension multiples.

Explore related subjects

Keep this discovery

BibTeXRIS

Mingyu Oh. 2026-06-28. Strongly Primitive Salem Growth Polynomials for Right-Angled Coxeter Groups. https://arxiv.org/abs/2606.29397

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