Pith. sign in

Connectivity for square percolation and coarse cubical rigidity in random right-angled Coxeter groups

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
abstract

We consider random right-angled Coxeter groups, $W_{\Gamma}$, whose presentation graph $\Gamma$ is taken to be an Erd\H{o}s--R\'enyi random graph, i.e., $\Gamma\sim \mathcal{G}_{n,p}$. We use techniques from probabilistic combinatorics to establish several new results about the geometry of these random groups. We resolve a conjecture of Susse and determine the connectivity threshold for square percolation on the random graph $\Gamma \sim \mathcal{G}_{n,p}$. We use this result to determine a large range of $p$ for which the random right-angled Coxeter group $W_{\Gamma}$ has a unique cubical coarse median structure. Until recent work of Fioravanti, Levcovitz and Sageev, there were no non-hyperbolic examples of groups with cubical coarse rigidity; our present results show the property is in fact typically satisfied by a random RACG for a wide range of the parameter $p$, including $p=1/2$.

fields

math.GR 1

years

2025 1

verdicts

CONDITIONAL 1

representative citing papers

RAAGedy right-angled Coxeter groups

math.GR · 2025-06-20 · conditional · novelty 7.0

Cloning and unfolding, two new graph operations that preserve quasi-isometry type, plus new geometric obstructions, give a complete decision procedure for RAAGediness of triangle-free CFS graphs with at most 10 vertices.

citing papers explorer

Showing 1 of 1 citing paper.

  • RAAGedy right-angled Coxeter groups math.GR · 2025-06-20 · conditional · none · ref 4 · internal anchor

    Cloning and unfolding, two new graph operations that preserve quasi-isometry type, plus new geometric obstructions, give a complete decision procedure for RAAGediness of triangle-free CFS graphs with at most 10 vertices.