Enumeration of double cosets

DOI10.1016/0022-4049(82)90023-8zbMath0507.20003OpenAlexW2039856678MaRDI QIDQ1837275

Robert H. Gilman

Publication date: 1982

Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-4049(82)90023-8

zbMATH Keywords

algorithmdouble cosetsfinitely presented groupsKnuth-Bendix completionfiniteness test

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Generators, relations, and presentations of groups (20F05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Software, source code, etc. for problems pertaining to group theory (20-04)

Related Items (1)

Computing double cosets in soluble groups

Cites Work

• The diamond lemma for ring theory
• Presentations of groups and monoids
• On theories with a combinatorial definition of 'equivalence'
• Unnamed Item
• Unnamed Item

This page was built for publication: Enumeration of double cosets