Set-Transitive Permutation Groups

Cited in

(41)

On finite permutation groups with the same orbits on unordered sets
More odd graph theory
Symmetry breaking and branching patterns in equivariant bifurcation theory. II
Rélations non reconstructibles par leurs restrictions
Application d'une propriété combinatoire des parties d'un ensemble aux groupes et aux rélations
Permutation groups without exponentially many orbits on the power set
Symmetry groups of Boolean functions and constructions of permutation groups
The cycle polynomial of a permutation group
Permutation orbifolds and holography
Permutation groups and set-orbits on the power set
The number of set-orbits of a solvable permutation group
Finite permutation groups with few orbits under the action on the power set
On k-homogeneous groups
Identifiability in probabilistic knowledge structures
Cayley properties of merged Johnson graphs
Transitivity of finite permutation groups on unordered sets
Permutation groups on unordered sets
t-designs and t-ply homogeneous groups
An infinite class of 5-designs
A converse to the Grace–Walsh–Szegő theorem
CLONES CLOSED UNDER CONJUGATION I: CLONES WITH CONSTANTS
On a Theorem of Göbel on Permutation Invariants
A Note on Two Set-Transitive Permutation Groups
Orbit equivalence and permutation groups defined by unordered relations.
Orbits of primitive k-homogeneous groups on (n-k)-partitions with applications to semigroups
Groups that are transitive on all partitions of a given shape
Compact hyper-Kähler categories. With an appendix by Grégoire Menet.
Solvable Permutation Groups and Orbits on Power Sets
A characterization of totally compatible automata
The classification of partition homogeneous groups with applications to semigroup theory
The tamely ramified geometric quantitative minimal ramification problem
Hyper-regular graphs and high dimensional expanders
Orbit closed permutation groups, relation groups, and simple groups
New characterizations of primitive permutation groups with applications to synchronizing automata
On the accepting state complexity of operations on permutation automata
Geometric groups of second order and related combinatorial structures
Multiplicity-free permutation representations of the symmetric group.
Solvable permutation group of odd order and orbits on the power set
On a question of permutation groups acting on the power set
On orbit equivalent permutation groups
Trees, wreath products and finite Gelfand pairs

This page was built for publication: Set-Transitive Permutation Groups

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