Math 2.0

Resources / preprint

Boundary Algorithms for Thompson Groups V1GVYM0WQG

URIm2://res/V1GVYM0WQG
Kindpreprint
CreatorsAyberk Zeytin
Date2026-10-05
MSC20-XX, 37-XX
Subjectsarxiv math.GR, arxiv math.DS
Scopein

Expressions

e1: version, preprint

Languageen
Date2026-10-05
IdsarXiv 2610.07293, zbl_id 903199810

Items in this resource

The mentions of the inventory that name this resource. Each name links to the card of its inventory row.

ItemKindWhereSource
Flip--shuffle realizationstatementcorollary 4.7arxiv
Address growthstatementlemma 5.7arxiv
Deterministic Farey-boundary reduction and complexitystatementtheorem 5.5arxiv
9ETKMER0RZdefinitiondefinition 3.1arxiv
9GD054212Ddefinitiondefinition 4.1arxiv
C3ZK14PSG6definitiondefinition 4.3arxiv
A presentation of $\mathsf T$ by boundary flipsstatementtheorem 6.2arxiv
Residual modular lengthstatementlemma 5.8arxiv
FH8S7QHJDMstatementlemma 5.1arxiv
Flip--shuffle reductionstatementtheorem 5.11arxiv
Block fan reductionstatementlemma 5.4arxiv
K3V7P6V054statementlemma 5.3arxiv
KAZHAB63GGstatementproposition 4.2arxiv
Complete output and running time for $\mathsf V$statementproposition 5.12arxiv
Q45XG7P1FJstatementlemma 5.2arxiv
Input-size complexitystatementcorollary 5.9arxiv
A finite presentation of $\mathsf V$ by boundary flips and shufflesstatementtheorem 6.3arxiv
Local relation familiesstatementproposition 4.8arxiv
SN272N4B1Zstatementtheorem 4.5arxiv
SXEXY6FM9Gexampleexample 4.6arxiv
SZ1GB9J13Hexampleexample 5.10arxiv

Catalogue records