Regular normal form for braids derived from relaxation algorithm.
problem Representing and normalizing braid complexity.
method Relaxation algorithm on tight laminations of punctured disks.
result Normal form is regular and prefix-closed.
On-device research index
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
169,341 papers · 148 categories
Trend · papers per month
4 results for “prefix-closed”
The following discourse is inspired by the works on hyperbolic groups of Epstein, and Neumann/Reeves. Epstein showed that geometrically finite hyperbolic groups are biautomatic. Neumann/Reeves showed that virtually central extensions of word hyperbolic groups are biautomatic. We prove the following generalisation: Theo…
Autostackability for finitely generated groups is defined via a topological property of the associated Cayley graph which can be encoded in a finite state automaton. Autostackable groups have solvable word problem and an effective inductive procedure for constructing van Kampen diagrams with respect to a canonical fini…
Algorithm solves word problem for 3-manifold groups.
problem Word problem in 3-manifold groups.
method Algorithmic approach using finite state automata and group properties.
result Fundamental groups of 3-manifolds are autostackable.