On relational complexity and base size of finite primitive groups

DOI10.2140/pjm.2022.318.89MaRDI QIDQ2160167

Colva M. Roney-Dougal, Veronica Kelsey

Publication date: 3 August 2022

Published in: Pacific Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2107.14208

zbMATH Keywords

computational complexity; permutation group; relational complexity; base size

Mathematics Subject Classification ID

20B25: Finite automorphism groups of algebraic, geometric, or combinatorial structures

20E32: Simple groups

20B15: Primitive groups

20-08: Computational methods for problems pertaining to group theory

Related Items

Minimal degree, base size, order: selected topics on primitive permutation groups, Computational group theory. Abstracts from the workshop held August 15--21, 2021 (hybrid meeting)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Base sizes for sporadic simple groups.
• On minimal degrees and base sizes of primitive permutation groups
• On countable stable structures which are homogeneous for a finite relational language
• On the minimal degrees of projective representations of the finite Chevalley groups
• On base sizes for almost simple primitive groups
• Chains of subgroups in symmetric groups
• Arities of permutation groups: Wreath products and \(k\)-sets
• Base sizes of primitive permutation groups
• Generation and random generation: from simple groups to maximal subgroups.
• Cherlin's conjecture for finite primitive binary permutation groups
• The Maximal Subgroups of the Low-Dimensional Finite Classical Groups
• Classical Groups, Derangements and Primes
• Base sizes for simple groups and a conjecture of Cameron
• The Inclusion Problem for Finite Primitive Permutation Groups
• Minimum bases for permutation groups: The greedy approximation
• ON THE HEIGHT AND RELATIONAL COMPLEXITY OF A FINITE PERMUTATION GROUP
• On base sizes for actions of finite classical groups