scientific article; zbMATH DE number 1849958

zbMath1028.20002MaRDI QIDQ4787523

Publication date: 7 January 2003

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

algorithms presentations permutation groups computer algebra systems chief series composition series black-box groups Schreier-Sims algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Symbolic computation and algebraic computation (68W30) Generators, relations, and presentations of groups (20F05) Software, source code, etc. for problems pertaining to group theory (20-04) Research exposition (monographs, survey articles) pertaining to group theory (20-02)

Related Items

Base sizes of imprimitive linear groups and orbits of general linear groups on spanning tuples, Regular orbits of symmetric and alternating groups, Conjugacy classes and centralisers in wreath products, Symmetry in Mathematical Programming, On valency problems of Saxl graphs, Optimal Shuffle Code with Permutation Instructions, Identifying long cycles in finite alternating and symmetric groups acting on subsets, Minimum Circuit Size, Graph Isomorphism, and Related Problems, Expanding Generating Sets for Solvable Permutation Groups, Computing normalisers of intransitive groups, Computing automorphisms of semigroups., On isomorphism testing of groups with normal Hall subgroups, A proof of Pyber's base size conjecture, Asymmetric coloring of locally finite graphs and profinite permutation groups: Tucker's conjecture confirmed, Bases of twisted wreath products, Classifying semisimple orbits of $\theta $-groups, Symmetrical path-cycle covers of a graph and polygonal graphs, Efficient characteristic refinements for finite groups, Parallel enumeration of triangulations, Bases of Schurian antisymmetric coherent configurations and an isomorphism test for Schurian tournaments, Baby-step giant-step algorithms for the symmetric group, Base sizes for sporadic simple groups., Groups synchronizing a transformation of non-uniform kernel, Computational complexity of reconstruction and isomorphism testing for designs and line graphs, Recognising the small Ree groups in their natural representations., Constructing composition factors for a linear group in polynomial time, Space efficient representations of finite groups, On Cayley representations of central Cayley graphs over almost simple groups, Filters compatible with isomorphism testing, Computational group theory. Abstracts from the workshop held August 15--21, 2021 (hybrid meeting), Closed subsets of root systems and regular subalgebras, Practical graph isomorphism. II., Constructive recognition of classical groups in even characteristic., Fast recognition of alternating groups of unknown degree., Computing conjugacy classes of elements in matrix groups., Burnside problem for measure preserving groups and for 2-groups of toral homeomorphisms, On the diameter of permutation groups., Universal covers of finite groups, Constructive recognition of classical groups in their natural representation., Generation of finite groups with cyclic Sylow subgroups, Growth in solvable subgroups of $\mathrm{GL}_r(\mathbb Z/p\mathbb Z)$., The product replacement prospector., Effective black-box constructive recognition of classical groups., SZK proofs for black-box group problems, Growth and expansion in algebraic groups over finite fields, A practical model for computation with matrix groups., Recognizing and Testing Isomorphism of Cayley Graphs over an Abelian Group of Order 4p in Polynomial Time, Reformulations in mathematical programming: automatic symmetry detection and exploitation, On the twisted modules for finite matrix groups, Irreducible constituents of monomial representations., Stabilizer-based symmetry breaking constraints for mathematical programs, Cubic surfaces over small finite fields, Constructive recognition of $\text{SL}_3(q)$., A computational comparison of symmetry handling methods for mixed integer programs, Finite Groups and Complexity Theory: From Leningrad to Saint Petersburg via Las Vegas, A fast isomorphism test for groups whose Lie algebra has genus 2, Algorithms for polycyclic-by-finite groups, The complexity of the weight problem for permutation and matrix groups., New refiners for permutation group search, Computing finite semigroups, On the asymmetric complexity of the group-intersection problem, Presentations of finite simple groups: A quantitative approach, The largest group of invariance for Markov bases and toric ideals, Colored hypergraph isomorphism is fixed parameter tractable, Enumeration of viral capsid assembly pathways: tree orbits under permutation group action, On base sizes for algebraic groups, Base sizes for $\mathcal S$-actions of finite classical groups., Recognising the Suzuki groups in their natural representations., Computing the soluble radical of a permutation group., Extremely primitive classical groups., Every coprime linear group admits a base of size two, Recognition of finite exceptional groups of Lie type, Finding a cycle base of a permutation group in polynomial time, Isomorphism testing of groups of cube-free order, Presentations on standard generators for classical groups, On short expressions for cosets of permutation subgroups, Random bases for coprime linear groups, A polynomial-time reduction algorithm for groups of semilinear or subfield class., Constructive recognition of classical groups in odd characteristic., The simultaneous conjugacy problem in the symmetric group, Error Thresholds for Arbitrary Pauli Noise, On base sizes for almost simple primitive groups, The Markov chain Monte Carlo revolution, Simple groups, fixed point ratios and applications, Disjoint direct product decompositions of permutation groups, Computation of orders and cycle lengths of automorphisms of finite solvable groups, Improved Static Symmetry Breaking for SAT, The 2-closure of a $\frac{3}{2}$-transitive group in polynomial time, Primitive normalisers in quasipolynomial time, Two-closures of supersolvable permutation groups in polynomial time, Black box exceptional groups of Lie type, The hidden subgroup problem and MKTP, Exploiting Symmetries in Polyhedral Computations, Writing projective representations over subfields., Constructive recognition of finite alternating and symmetric groups acting as matrix groups on their natural permutation modules., Faster tensor canonicalization, The complexity of the Weight Problem for permutation groups, Improving the quantum cost of NCT-based reversible circuit, Computing Galois groups of polynomials (especially over function fields of prime characteristic), Finding fixed point free elements and small bases in permutation groups, Isomorphism Testing for Graphs Excluding Small Minors, Algorithms for Group Isomorphism via Group Extensions and Cohomology, On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials I: Tensor Isomorphism-Completeness, Characterization of graphs which admit vertex‐transitive embeddings, Nonsingular cubic surfaces over F2k, Computing Autotopism Groups of Partial Latin Rectangles, A subquadratic algorithm for the simultaneous conjugacy problem, On the Burness-Giudici conjecture, Classification of some cosets of the Reed-Muller code, Algebraic properties of the values of newform Dedekind sums, Computing generating sets of minimal size in finite algebras, Graphs isomorphisms under edge-replacements and the family of amoebas, A Faster Isomorphism Test for Graphs of Small Degree, The minimum generating set problem, Fast computation of the centralizer of a permutation group in the symmetric group, Derangements in wreath products of permutation groups, Two-closure of rank $3$ groups in polynomial time, Base sizes of primitive groups of diagonal type, Formations of finite groups in polynomial time: $\mathfrak{F}$-residuals and $\mathfrak{F}$-subnormality, Isomorphism Testing Parameterized by Genus and Beyond, Interactions of computational complexity theory and mathematics, Unnamed Item, On classifying Minkowskian sublattices, On Cayley representations of finite graphs over Abelian $p$-groups, Extending Symmetry Reduction Techniques to a Realistic Model of Computation, An adaptive prefix-assignment technique for symmetry reduction, Nearly linear time isomorphism algorithms for some nonabelian group classes, On the geometry of symmetry breaking inequalities, Subgroups of minimal index in polynomial time, On the geometry of symmetry breaking inequalities, On the Saxl graph of a permutation group, A Generic Framework for Engineering Graph Canonization Algorithms, Book Review: Theory of finite simple groups, Most permutations power to a cycle of small prime length, Unnamed Item, On Pyber’s base size conjecture, Growth in groups: ideas and perspectives

Uses Software