Computing area in presentations of the trivial group

DOI10.1090/proc/13625zbMath1439.20031arXiv1606.08833OpenAlexW2556427477MaRDI QIDQ4592733

Timothy R. Riley

Publication date: 8 November 2017

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1606.08833

zbMATH Keywords

widthgroup presentationexact areaRNA-folding

Mathematics Subject Classification ID

Generators, relations, and presentations of groups (20F05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Algorithms on strings (68W32)

Related Items (1)

The Bounded and Precise Word Problems for Presentations of Groups

Cites Work

• Unnamed Item
• Unnamed Item
• Tangent unit-vector fields: nonabelian homotopy invariants and the Dirichlet energy
• The geometry of the word problem for finitely generated groups.
• Tangent unit-vector fields: non-abelian homotopy invariants and the Dirichlet energy
• A Faster Pseudopolynomial Time Algorithm for Subset Sum
• Reducibility among Combinatorial Problems
• Encyclopedia of Algorithms

This page was built for publication: Computing area in presentations of the trivial group