On relational complexity and base size of finite primitive groups

DOI10.2140/PJM.2022.318.89MaRDI QIDQ2160167zbMATH OpenOpenAlexFDO

Authors Veronica Kelsey, Colva M. Roney-Dougal

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 complexityrelational complexitybase sizepermutation group

Mathematics Subject Classification ID

Primitive groups (20B15) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Simple groups (20E32) Computational methods for problems pertaining to group theory (20-08)

Recommendations

• On the orders of doubly transitive permutation groups, elementary estimates
• Base sizes for primitive groups with soluble stabilisers
• Base sizes of primitive permutation groups
• ON THE HEIGHT AND RELATIONAL COMPLEXITY OF A FINITE PERMUTATION GROUP
• scientific article; zbMATH DE number 663788
• Base sizes of primitive groups: bounds with explicit constants
• Minimum bases for permutation groups: The greedy approximation
• Bases for primitive permutation groups and a conjecture of Babai
• scientific article; zbMATH DE number 1981753
• scientific article; zbMATH DE number 4165152

Cites work

• scientific article; zbMATH DE number 3906699 (Why is no real title available?)
• scientific article; zbMATH DE number 5793093 (Why is no real title available?)
• scientific article; zbMATH DE number 1421206 (Why is no real title available?)
• scientific article; zbMATH DE number 1431691 (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.
• Base sizes of primitive permutation groups
• Chains of subgroups in symmetric groups
• Cherlin's conjecture for finite primitive binary permutation groups
• Classical Groups, Derangements and Primes
• Generation and random generation: from simple groups to maximal subgroups.
• 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
• On base sizes for almost simple primitive groups
• On countable stable structures which are homogeneous for a finite relational language
• On minimal degrees and base sizes of primitive permutation groups
• On the minimal degrees of projective representations of the finite Chevalley groups
• The Inclusion Problem for Finite Primitive Permutation Groups
• The maximal subgroups of the low-dimensional finite classical groups.

Cited in

(9)

• On the relational complexity of a finite permutation group
• ON THE HEIGHT AND RELATIONAL COMPLEXITY OF A FINITE PERMUTATION GROUP
• Base sizes of primitive permutation groups
• The relational complexity of linear groups acting on subspaces
• On relational complexity and base size of finite primitive groups
• Irredundant bases for the symmetric group
• On base sizes for primitive groups of product type
• Computational group theory. Abstracts from the workshop held August 15--21, 2021 (hybrid meeting)
• Minimal degree, base size, order: selected topics on primitive permutation groups

This page was built for publication: On relational complexity and base size of finite primitive groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2160167)