scientific article; zbMATH DE number 2133330
From MaRDI portal
Publication:4650358
character tablescomputational group theorycoset enumerationfinitely presented groupsmatrix group recognitionpermutation group algorithmstextbook
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to group theory (20-01) Software, source code, etc. for problems pertaining to group theory (20-04) Generators, relations, and presentations of groups (20F05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Grammars and rewriting systems (68Q42) Algebraic theory of languages and automata (68Q70) Symbolic computation and algebraic computation (68W30)
Recommendations
- Fundamental algorithms for permutation groups
- scientific article; zbMATH DE number 1276819
- Representations of groups. A computational approach.
- Computation with linear algebraic groups
- Group theory and computation. Invited papers based on the presentations at the workshop `Group theory and computational methods', Bangalore, India, November 5--14, 2016
Cited in
(only showing first 100 items - show all)- Computing the nonabelian tensor squares of polycyclic groups.
- Introduction to: Computational group theory II
- Fundamental algorithms for permutation groups
- Computational group theory in St. Petersburg
- Hyper-algebras of vector-valued modular forms
- Word problems of groups: formal languages, characterizations and decidability
- Effective subgroup separability of finitely generated nilpotent groups
- Random nilpotent groups, polycyclic presentations, and Diophantine problems
- Small partial Latin squares that embed in an infinite group but not into any finite group
- On the embedding of central extensions into permutation wreath products
- Enumeration of conformers for octahedral \textit{trans}/\textit{cis}-[MX\(_2\)(AB)\(_4\)] and \textit{trans}/\textit{cis}-[MX\(_2\)(ABC)\(_4\)] complexes on the basis of computational group theory
- Products of vector valued Eisenstein series
- Computing subfields of number fields and applications to Galois group computations
- Low time complexity algorithms for path computation in Cayley graphs
- Maximal linear groups induced on the Frattini quotient of a \(p\)-group
- Minimal and canonical images
- Computing stable epimorphisms onto finite groups
- Calculating characters of \(p\)-groups
- Optimal line packings from nonabelian groups
- Automorphism groups of 2-groups of coclass at most 3
- The use of permutation representations in structural computations in large finite matrix groups
- On the semigroup rank of a group
- From automatic structures to automatic groups.
- Subquadratic-time algorithms for normal bases
- Disjoint direct product decompositions of permutation groups
- Groups whose orders factorise into at most four primes
- Computation of orders and cycle lengths of automorphisms of finite solvable groups
- Primitive normalisers in quasipolynomial time
- Modular flavor symmetry and vector-valued modular forms
- Faster tensor canonicalization
- A Lyndon's identity theorem for one-relator monoids
- Computing normalisers of intransitive groups
- Residual dimension of nilpotent groups
- Universal covers of finite groups
- Generation of finite groups with cyclic Sylow subgroups
- Solving a fixed number of equations over finite groups
- Polynomial-time proofs that groups are hyperbolic
- Deciding finiteness of matrix groups in positive characteristic.
- A simple group generated by involutions interchanging residue classes of the integers.
- Improved method for finding optimal formulas for bilinear maps in a finite field
- Construction of the irreducible modular representations of a finite group
- Isomorphism testing of groups of cube-free order
- A polycyclic presentation for the \(q\)-tensor square of a polycyclic group
- Linear groups and computation
- An algorithm for decomposing representations of finite groups using invariant projections
- New classes of quantum codes on closed orientable surfaces
- Some computational aspects of solvable regular covers of graphs
- Symmetry type graphs of polytopes and maniplexes
- Enumeration of conformers for octahedral \([\mathrm{MX(AB)}_{5}]\) and \([\mathrm{MX(ABC)}_{5}]\) complexes on the basis of computational group theory
- Computational aspects of Burnside rings. I: The ring structure
- An algorithm for canonical forms of finite subsets of \(\mathbb {Z}^d\) up to affinities
- Baby-step giant-step algorithms for the symmetric group
- Constructive recognition of classical groups in even characteristic.
- Computing conjugacy classes of elements in matrix groups.
- Computing polycyclic presentations for polycyclic rational matrix groups.
- String rewriting for double coset systems.
- Constructive Sylow theorems for the classical groups.
- Using the Mal'cev correspondence for collection in polycyclic groups.
- Algorithms for computing with nilpotent matrix groups over infinite domains.
- Recognising the Suzuki groups in their natural representations.
- A computer-assisted analysis of some matrix groups.
- Computing conjugacy class representatives in permutation groups.
- Computing the soluble radical of a permutation group.
- Matrix representations for torsion-free nilpotent groups by Deep Thought.
- Explicit representations of maximal subgroups of the Monster.
- Computational group theory.
- On isomorphism testing of groups with normal Hall subgroups
- Fibonacci groups F(2,n) are hyperbolic for n odd and n 11
- Groups with a solvable subgroup of prime-power index
- On the Frattini subgroup of a polycyclic group
- Mathematical frameworks for oscillatory network dynamics in neuroscience
- Recognition of finite exceptional groups of Lie type.
- Orbits of crystallographic embedding of non-crystallographic groups and applications to virology
- Exploiting symmetries in polyhedral computations
- The automorphism group of a finitely generated virtually abelian group.
- Factorizations of finite groups by conjugate subgroups which are solvable or nilpotent
- Computing Hilbert class polynomials with the Chinese remainder theorem
- On the action of the sporadic simple Baby Monster group on its conjugacy class 2B.
- Computing a chief series and the soluble radical of a matrix group over a finite field.
- Computing in unipotent and reductive algebraic groups.
- scientific article; zbMATH DE number 5976624 (Why is no real title available?)
- Minimum circuit size, graph isomorphism, and related problems
- Classifying semisimple orbits of \theta -groups
- A class of descendant \(p\)-groups of order \(p^{9}\) and Higman's PORC conjecture
- Duality between \(p\)-groups with three characteristic subgroups and semisimple anti-commutative algebras
- Equivariant simplicial reconstruction
- A parallel evolutionary approach to solving systems of equations in polycyclic groups
- The status of polycyclic group-based cryptography: a survey and open problems
- Testing polycyclicity of finitely generated rational matrix groups
- Efficient characteristic refinements for finite groups
- SCHREIER CONDITIONS ON CHIEF FACTORS AND RESIDUALS OF SOLVABLE-LIKE GROUP FORMATIONS
- On the application of computational group theory to the theory of groups.
- Algorithms for crystallographic groups
- Presentations of finite simple groups: a quantitative approach.
- Embedding theorems for tree-free groups.
- Representations of groups. A computational approach.
- The Markov chain Monte Carlo revolution
- An infinite Family of 4-Arc-Transitive Cubic Graphs Each with Girth 12
- A note on computing involution centralizers.
- The construction of finite solvable groups revisited.
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4650358)
