Search arXiv⌕ Search

arXiv · 2610.27716

Maximal ranks of free abelian subgroups of generalized cactus groups associated with finite Coxeter systems

Abstract

We determine the maximum ranks of free abelian subgroups of generalized cactus groups associated with finite Coxeter systems. To obtain the upper bounds, we use the cubical flat torus theorem of Wise and Woodhouse. We then verify the sharpness of these upper bounds by constructing free abelian subgroups of the corresponding ranks. Our result shows that the maximal ranks of free abelian subgroups of ordinary cactus groups can be larger than conjectured by Genevois. As an application, we show that these groups are not quasi-isometric to any right-angled Artin group unless they are virtually free abelian.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jan Kim, Junseok Kim. 2026-10-20. Maximal ranks of free abelian subgroups of generalized cactus groups associated with finite Coxeter systems. https://arxiv.org/abs/2610.27716

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

KEEP EXPLORING

Related papers

On Finite Groups with Element Order Set of Width 3

We study finite groups in which every element order is divisible by at most three distinct primes. We determine the possible nonabelian composition factors, prove that a nonabelian simple group with this property has at most $15$ prime divisors in its order, and deduce that $ρ(G)\leq192$ for every finite group $G$ with $α(G)\leq3$.

math.GR↗

Unsolved Problems in Group Theory. The Kourovka Notebook

This is a collection of open problems in group theory proposed by hundreds of mathematicians from all over the world. It has been published every 2--4 years since 1965. This is the 21st edition, which contains 150 new problems and a number of comments on problems from the previous editions. Problems with $\boldsymbol{\displaystyle{\sharp }}$ have AI-proposed solutions that are not yet confirmed by mathematicians and should be regarded as unsolved. Anyone interested is invited to look into such an AI solution and either confirm it or refute. Comments can be sent to the editors Evgeny Khukhro khukhro@yahoo.co.uk and Victor Mazurov mazurov@math.nsc.ru

math.GR↗

On algebraic and arithmetic properties of monoids of product-$K$ sequences

Let $G$ be a group and $K$ be a normal subgroup of $G$. A sequence over $G$ is a finite collection of terms from $G$, where repetition is allowed, and the order is disregarded. A product-$K$ sequence is a sequence whose terms can be ordered such that their product in $G$ belongs to $K$. The set $\mathcal B_K (G)$ of all product-$K$ sequences over $G$ forms a monoid, called the monoid of product-$K$ sequences, under the operation of sequence concatenation. In this paper, we investigate the algebraic and arithmetic properties of the monoid $\mathcal B_K (G)$. Among our main results, we provide precise characterizations of when $\mathcal B_K (G)$ satisfies key properties, namely being (transfer) Krull, a (seminormal) C-monoid, or (half-)factorial. After that, we study the Isomorphism Problem for monoids of product-$K$ sequences. Our results generalize existing frameworks, making them applicable to both the classical abelian and the more recently developed non-abelian settings.

math.GR↗