SearcharxivSearch

arXiv · 2510.17061

Bounded weight functions on regular languages and groups

Abstract

We introduce the notion of a bounded weight function on a language, and show that the set of bounded weight functions on a regular language is a rational polyhedral cone. We study the cell recognised by a bounded weight function (that is, the set of elements of the language where the bound is attained), and show that if the language is regular then this cell is regular. The related notion of a weight function on a finitely generated group is introduced, and the case of Coxeter groups is studied in detail. Applications to the representation theory of weighted Hecke algebras are given.

Explore related subjects

Keep this discovery

BibTeXRIS

J. Guilhot, E. Little, J. Parkinson. 2025-10-20. Bounded weight functions on regular languages and groups. https://arxiv.org/abs/2510.17061

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