Non-commutative lattice problems

DOI10.1515/jgth-2016-0506zbMath1392.20028arXiv1508.02388OpenAlexW2963673714MaRDI QIDQ285583

F. Blanchet-Sadri, M. Dambrine

Publication date: 19 May 2016

Published in: Journal of Group Theory (Search for Journal in Brave)

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

zbMATH Keywords

Coxeter groupsgeodesicsnilpotent groupscomputational lattice problemssurface groups

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Geometric group theory (20F65) Reflection and Coxeter groups (group-theoretic aspects) (20F55) Nilpotent groups (20F18) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Related Items (5)

Subset sum problem in polycyclic groups ⋮ Parallel complexity for nilpotent groups ⋮ Cryptanalysis of a combinatorial public key cryptosystem ⋮ Logspace and compressed-word computations in nilpotent groups ⋮ TC^0 circuits for algorithmic problems in nilpotent groups

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Post correspondence problem in groups.
• Knapsack problems in products of groups
• Polynomial-time word problems.
• Groups of polynomial growth and expanding maps. Appendix by Jacques Tits
• A finiteness property and an automatic structure for Coxeter groups
• Coxeter groups, 2-completion, perimeter reduction and subgroup separability.
• Growth of finitely generated solvable groups and curvature of Riemannian manifolds
• Artin groups of large type are shortlex automatic with regular geodesics
• Logspace Computations in Graph Groups and Coxeter Groups
• Combinatorics of Coxeter Groups
• A FAST ALGORITHM FOR STALLINGS' FOLDING PROCESS
• The word and geodesic problems in free solvable groups
• Logspace and compressed-word computations in nilpotent groups
• Knapsack problems in groups

This page was built for publication: Non-commutative lattice problems