ON THE HEIGHT AND RELATIONAL COMPLEXITY OF A FINITE PERMUTATION GROUP
From MaRDI portal
Publication:5078587
Recommendations
- Cherlin's conjecture for finite primitive binary permutation groups
- On relational complexity and base size of finite primitive groups
- Base sizes of primitive permutation groups
- On the relational complexity of a finite permutation group
- Base sizes of primitive groups: bounds with explicit constants
- The Minimal Base Size of Primitive Solvable Permutation Groups
- Base sizes for primitive groups with soluble stabilisers
- Publication:3487624
- The base size of a primitive diagonal group.
- On the orders of doubly transitive permutation groups, elementary estimates
Cites work
- scientific article; zbMATH DE number 1703931 (Why is no real title available?)
- scientific article; zbMATH DE number 46357 (Why is no real title available?)
- scientific article; zbMATH DE number 1047717 (Why is no real title available?)
- scientific article; zbMATH DE number 894528 (Why is no real title available?)
- scientific article; zbMATH DE number 278880 (Why is no real title available?)
- Arities of permutation groups: Wreath products and \(k\)-sets
- Base sizes for simple groups and a conjecture of Cameron
- Base sizes for sporadic simple groups.
- Chains of subgroups in symmetric groups
- Classical Groups, Derangements and Primes
- Minimum bases for permutation groups: The greedy approximation
- On base sizes for actions of finite classical groups
- On base sizes for symmetric groups
- On minimal degrees and base sizes of primitive permutation groups
- On the maximum orders of elements of finite almost simple groups and primitive permutation groups.
- On the order of uniprimitive permutation groups
- On the relational complexity of a finite permutation group
- Probabilistic Generation of Wreath Products of Non-abelian Finite Simple Groups
- Simple groups, permutation groups, and probability
- The Inclusion Problem for Finite Primitive Permutation Groups
- The maximal subgroups of the low-dimensional finite classical groups.
Cited in
(12)- On the relational complexity of a finite permutation group
- Irredundant bases for finite groups of Lie type
- On the complexity of coloring areflexive \(h\)-ary relations with given permutation group
- Independence and bases: theme and variations
- The relational complexity of linear groups acting on subspaces
- On the cardinality of irredundant and minimal bases of finite permutation groups
- On the height and relational complexity of a finite permutation group
- A classification of finite primitive IBIS groups with alternating socle
- Irredundant bases for the symmetric group
- Computational group theory. Abstracts from the workshop held August 15--21, 2021 (hybrid meeting)
- On relational complexity and base size of finite primitive groups
- The maximal size of a minimal generating set
This page was built for publication: ON THE HEIGHT AND RELATIONAL COMPLEXITY OF A FINITE PERMUTATION GROUP
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5078587)