Bases of twisted wreath products

@article{Fawcett2021BasesOT,
  title={Bases of twisted wreath products},
  author={Joanna B. Fawcett},
  journal={Journal of Algebra},
  year={2021}
}

Tables from this paper

On base sizes for primitive groups of product type

On the Saxl graphs of primitive groups with soluble stabilisers

Let G be a transitive permutation group on a finite set Ω and recall that a base for G is a subset of Ω with trivial pointwise stabiliser. The base size of G , denoted b ( G ), is the minimal size of

Strongly base-two groups

. Let G be a finite group, let H be a core-free subgroup and let b ( G, H ) denote the base size for the action of G on G/H . Let α ( G ) be the number of conjugacy classes of core-free subgroups H of

References

SHOWING 1-10 OF 58 REFERENCES

The base size of a primitive diagonal group

Base sizes for S-actions of finite classical groups

Let G be a permutation group on a set Ω. A subset B of Ω is a base for G if the pointwise stabilizer of B in G is trivial; the base size of G is the minimal cardinality of a base for G, denoted by

Base sizes for sporadic simple groups

Let G be a permutation group acting on a set Ω. A subset of Ω is a base for G if its pointwise stabilizer in G is trivial. We write b(G) for the minimal size of a base for G. We determine the precise

On base sizes for symmetric groups

A base of a permutation group G on a set Ω is a subset B of Ω such that the pointwise stabilizer of B in G is trivial. The base size of G, denoted by b(G), is the minimal cardinality of a base. Let G

On Pyber's base size conjecture

Let G be a permutation group on a finite set Ω. A subset of Ω is a base for G if its pointwise stabilizer in G is trivial. The base size of G, denoted b(G), is the smallest size of a base. A

Base sizes for simple groups and a conjecture of Cameron

Let G be a permutation group on a finite set Ω. A base for G is a subset B ⊆ Ω with pointwise stabilizer in G that is trivial; we write b(G) for the smallest size of a base for G. In this paper we

On the Order of Uniprimitive Permutation Groups

One of the central problems of 19th century group theory was the estimation of the order of a primitive permutation group G of degree n, where G X An. We prove I G I < exp (4V'/ n log2 n) for the

Bounds on finite quasiprimitive permutation groups

Abstract A permutation group is said to be quasiprimitive if every nontrivial normal subgroup is transitive. Every primitive permutation group is quasiprimitive, but the converse is not true. In this

Trivial Set-Stabilizers in Finite Permutation Groups

  • D. Gluck
  • Mathematics
    Canadian Journal of Mathematics
  • 1983
For which permutation groups does there exist a subset of the permuted set whose stabilizer in the group is trivial? The permuted set has so many subsets that one might expect that subsets with
...