Some algorithms for nilpotent permutation groups

DOI10.1006/JSCO.1996.0092MaRDI QIDQ1355778zbMATH OpenOpenAlexFDO

Authors Eugene M. Luks, Ferenc Rákóczi, Charles R. B. Wright

Publication date 28 May 1997

Published in Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/1948bb938cff0cd04a669f307c8e6ed25a518836

zbMATH Keywords

finite nilpotent permutation group

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Recommendations

• scientific article; zbMATH DE number 1254260
• scientific article; zbMATH DE number 1263405
• Nearly linear time algorithms for permutation groups: An interplay between theory and practice
• Finding intersections and normalizers in finitely generated nilpotent groups
• scientific article; zbMATH DE number 3989617

Cited in

(8)

• The computation of normalizers in permutation groups
• Nearly linear time algorithms for permutation groups: An interplay between theory and practice
• Algorithms for permutability in finite groups.
• scientific article; zbMATH DE number 1254260 (Why is no real title available?)
• scientific article; zbMATH DE number 1263405 (Why is no real title available?)
• scientific article; zbMATH DE number 4116805 (Why is no real title available?)
• \textsf{MagneticKP}: a package for quickly constructing \(\boldsymbol{k}\cdot\boldsymbol{p}\) models of magnetic and non-magnetic crystals
• The injectivity of affine mappings restricted to convex sets

This page was built for publication: Some algorithms for nilpotent permutation groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1355778)