scientific article; zbMATH DE number 3341276

zbMath0215.10002MaRDI QIDQ5617749

Charles C. Sims

Publication date: 1970

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

Mathematics Subject Classification ID

Related Items

Computing Autotopism Groups of Partial Latin Rectangles ⋮ A note on primitive extensions of rank $4$ of alternating groups ⋮ Minimal degree, base size, order: selected topics on primitive permutation groups ⋮ The Hasse invariant of the Tate normal form \(E_7\) and the supersingular polynomial for the Fricke group \(\Gamma_0^*(7)\) ⋮ Distance-transitive graphs of valency 5, 6 and 7 ⋮ A new existence proof for \(Ly\), the sporadic simple group of R. Lyons ⋮ Doubly transitive permutation groups which are not doubly primitive ⋮ Doubly transitive permutation groups which are not doubly primitive ⋮ A nonadaptive NC checker for permutation group intersection ⋮ On the complexity of some problems on groups input as multiplication tables ⋮ The Intersection Problem for Finite Semigroups ⋮ The probability of generating certain profinite groups by two elements ⋮ Large scale geometric programming: An application in coding theory ⋮ Simple primitive permutation groups of small degree ⋮ Computing short generator sequences ⋮ Generation of Colourings and Distinguishing Colourings of Graphs ⋮ Hyperovals in PG(2,16) ⋮ Intersecting families of finite sets and fixed-point-free 2-elements ⋮ The existence of simple \(6\text{-}(14,7,4)\) designs ⋮ Asymmetric coloring of locally finite graphs and profinite permutation groups: Tucker's conjecture confirmed ⋮ Imprimitive flag-transitive symmetric designs ⋮ Regular sets for the affine and projective groups over the field of two elements ⋮ Membership testing in commutative transformation semigroups ⋮ Parallel algorithms for solvable permutation groups ⋮ Unnamed Item ⋮ On the computation of resolvents and Galois groups ⋮ Algorithms for finite near-rings and their \(N\)-groups. ⋮ The relation between Burnside rings and combinatorial species ⋮ Bases for primitive permutation groups and a conjecture of Babai ⋮ Symmetry groups of Boolean functions and constructions of permutation groups ⋮ Feedback control of stochastic systems with a generalized performance index† ⋮ Testing membership: Beyond permutation groups ⋮ On elements of prime order in primitive permutation groups ⋮ The Glasgow Subgraph Solver: Using Constraint Programming to Tackle Hard Subgraph Isomorphism Problem Variants ⋮ An algorithm for computing the automorphism group of a Hadamard matrix ⋮ On the Complexity of the Hidden Subgroup Problem ⋮ The affine primitive permutation groups of degree less than 1000. ⋮ Variable symmetry breaking in numerical constraint problems ⋮ Normalisers of primitive permutation groups in quasipolynomial time ⋮ Computational group theory. Abstracts from the workshop held August 15--21, 2021 (hybrid meeting) ⋮ Links between two semisymmetric graphs on 112 vertices via association schemes ⋮ Constructing the vertex-transitive graphs of order 24 ⋮ Primitive permutation groups of small degree. I, II ⋮ The automorphism group of an [18,9,8 quaternary code] ⋮ On the maximality of \(S_ n\) in \(S_{\binom{n}{k}}\) ⋮ Splitting fields for \(E_8\)-torsors ⋮ Galois correspondence between permutation groups and cellular rings (association schemes) ⋮ Generalized table algebras ⋮ Reliability and reproducibility of Atlas information ⋮ Multiplicity-free permutation representations of the symmetric group. ⋮ Constructing transitive permutation groups. ⋮ Around the numeric-symbolic computation of differential Galois groups ⋮ Bounds for finite semiprimitive permutation groups: order, base size, and minimal degree ⋮ Permutability class of a semigroup ⋮ The primitive permutation groups of certain degrees ⋮ Algorithms for polycyclic-by-finite groups ⋮ Fast recognition of doubly transitive groups ⋮ A strong generating test and short presentations for permutation groups ⋮ Permutation group algorithms based on partitions. I: Theory and algorithms ⋮ Ground resolution with group computations on semantic symmetries ⋮ Computing finite semigroups ⋮ Certain orthogonal and symplectic groups as Galois groups over \(\mathbb{Q}\) ⋮ The use of permutation representations in structural computations in large finite matrix groups ⋮ On the asymmetric complexity of the group-intersection problem ⋮ Subgroup normality degrees of finite groups. I. ⋮ On the codes related to the Higman-Sims graph ⋮ Colored hypergraph isomorphism is fixed parameter tractable ⋮ Groups with a (B,N)-pair of rank 2. I ⋮ On rank 3 permutation groups ⋮ Experiments with General Cubic Surfaces ⋮ Constructive graph labeling using double cosets ⋮ Products of simple groups ⋮ Products of \(A_5\) and a finite simple group ⋮ The Canon package: a fast kernel for tensor manipulators ⋮ Graph Isomorphism is in SPP ⋮ A computer-assisted analysis of some matrix groups. ⋮ Complexity classes of equivalence problems revisited ⋮ Primitive permutation groups containing a p-element of small degree, p a prime. II ⋮ Computing the composition factors of a permutation group in polynomial time ⋮ A description of the Fischer group \(F_{23}\) ⋮ Construction of the irreducible modular representations of a finite group ⋮ Rank 3 groups and biplanes ⋮ On permutation groups containing \(O_{2n}\)(2) as a subgroup ⋮ Orbit Computation for Atomically Generated Subgroups of Isometries of $\mathbb{Z}^n$ ⋮ The complexity of properties of transformation semigroups ⋮ Block-transitive, point-imprimitive designs with \(\lambda \Relbar 1\) ⋮ Polynomials with PSL(2,7) as Galois group ⋮ Disjoint direct product decompositions of permutation groups ⋮ A Polynomial with Galois Groups SL₂(F₁₆) ⋮ Products of simple groups and symmetric groups ⋮ Construction of defining relators for finite groups ⋮ Parameterized complexity of small weight automorphisms and isomorphisms ⋮ On basis-transitive geometric lattices ⋮ The transitive groups of degree twelve ⋮ Doubly transitive groups in which the maximum number of fixed points of involutions is four ⋮ Error-correcting codes from permutation groups ⋮ Unnamed Item ⋮ Linear dependence of zeros of polynomials and construction of primitive elements ⋮ The mathematics of perfect shuffles ⋮ Hadamard matrices of order 28 with automorphisms of order 13 ⋮ Growth in groups: ideas and perspectives ⋮ Generation problems ⋮ The primitive permutation groups of degree less than 2500. ⋮ Macro-operators: A weak method for learning ⋮ The complexity of finding minimum-length generator sequences ⋮ Constructing a short defining set of relations for a finite group ⋮ Homogeneity in infinite permutation groups ⋮ Computing transformation semigroups ⋮ Solvability by radicals is in polynomial time ⋮ Symmetric subgroups of finite groups ⋮ Finding fixed point free elements and small bases in permutation groups

This page was built for publication: