Closure properties of knapsack semilinear groups

DOI10.1016/j.jalgebra.2021.08.016OpenAlexW3198323100MaRDI QIDQ2236107

Georg Zetzsche, Michael Figelius, Markus Lohrey

Publication date: 22 October 2021

Published in: Journal of Algebra (Search for Journal in Brave)

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

zbMATH Keywords

graph productsHNN-extensionsamalgamated productssemilinear setsknapsack problems in non-commutative groups

Mathematics Subject Classification ID

Group theory and generalizations (20-XX) Associative rings and algebras (16-XX)

Related Items

Knapsack and the power word problem in solvable Baumslag–Solitar groups

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Knapsack problem for nilpotent groups
• Compressed word problems in HNN-extensions and amalgamated products
• On the rational subset problem for groups.
• Knapsack problems in products of groups
• Unary finite automata vs. arithmetic progressions
• Combinatorics on traces
• Knapsack in graph groups
• Membership problems for regular and context-free trace languages
• Carathéodory bounds for integer cones
• Semigroups, Presburger formulas, and languages
• Algorithmic Meta Theorems for Circuit Classes of Constant and Logarithmic Depth
• Knapsack and subset sum problems in nilpotent, polycyclic, and co-context-free groups
• The Burnside problem and related topics
• Knapsack Problems for Wreath Products
• RATIONAL SUBSETS IN HNN-EXTENSIONS AND AMALGAMATED PRODUCTS
• WORD EQUATIONS OVER GRAPH PRODUCTS
• Theories of HNN-Extensions and Amalgamated Products
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• Subgroup separability of graphs of abelian groups
• The taming of the semi-linear set
• Knapsack in graph groups, HNN-extensions and amalgamated products
• The Complexity of Knapsack in Graph Groups
• FOLDINGS, GRAPHS OF GROUPS AND THE MEMBERSHIP PROBLEM
• A complex for right-angled Coxeter groups
• COMPRESSED DECISION PROBLEMS FOR GRAPH PRODUCTS AND APPLICATIONS TO (OUTER) AUTOMORPHISM GROUPS
• Reducibility among Combinatorial Problems
• The co-word problem for the Higman-Thompson group is context-free
• LOGICAL ASPECTS OF CAYLEY-GRAPHS: THE MONOID CASE
• Knapsack problems in groups
• The Subgroups of a Free Product of Two Groups with an Amalgamated Subgroup
• Subgroups of HNN Groups and Groups with one Defining Relation
• Embedding Theorems for Groups
• Knapsack in hyperbolic groups