Pith. sign in

REVIEW 1 cited by

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

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2502.18165 v1 pith:O2R3OPEZ submitted 2025-02-25 math.PR math.COmath.GRmath.GT

classification math.PRmath.COmath.GRmath.GT
keywords randomgammagroupscoarsecoxetercubicalgraphright-angled
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
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$.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. RAAGedy right-angled Coxeter groups

    math.GR 2025-06 conditional novelty 7.0 of 10

    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.

Pith tools