REVIEW
Discrete and free groups acting on locally finite trees
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
Discrete and free groups acting on locally finite trees
read the original abstract
We present an algorithm to decide whether or not a finitely generated subgroup of the isometry group of a locally finite simplicial tree is both discrete and free. The correctness of this algorithm relies on the following conjecture: every `minimal' $n$-tuple of isometries of a simplicial tree either contains an elliptic element or satisfies the hypotheses of the Ping Pong Lemma. We prove this conjecture for $n=2,3$, and show that it implies a generalisation of Ihara's Theorem.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.