Transitivity of permutation groups on unordered sets
From MaRDI portal
(Redirected from Publication:1220148)
Cites work
Cited in
(58)- Retractions of reversible structures
- A survey of homogeneous structures
- Set‐homogeneous hypergraphs
- On the incidence maps of incidence structures
- Finite primitive permutation groups containing a permutation having at most four cycles
- Orbits on \(n\)-tuples for infinite permutation groups
- Permutation groups without exponentially many orbits on the power set
- Set-homogeneous directed graphs
- Sperner properties for groups and relations
- Permutation groups containing infinite symplectic linear groups and reducts of linear spaces over the two element field
- Infinitely many reducts of homogeneous structures
- The 116 reducts of (ℚ, <, a)
- A census of infinite distance-transitive graphs
- On irregular infinite Jordan groups.
- The k-orbit reconstruction and the orbit algebra
- The lattice of definability: origins, recent developments, and further directions
- On a stronger reconstruction notion for monoids and clones
- Reducts of structures and maximal-closed permutation groups
- Homogeneous structures: model theory meets universal algebra. Abstracts from the workshop held January 3--9, 2021 (online meeting)
- The 42 reducts of the random ordered graph
- The reducts of the homogeneous binary branching \(C\)-relation
- NIP ω$\omega$‐categorical structures: The rank 1 case
- Functional reducts of the countable atomless Boolean algebra
- European meeting of the Association for Symbolic Logic, Mons, Belgium, 1978
- Jordan permutation groups and limits of \(D\)-relations
- Permutation orbifolds and chaos
- Semilinear tower of Steiner systems
- Universality of sparse \(d > 2\) conformal field theory at large \(N\)
- \(2^{\aleph_{0}}\) pairwise nonisomorphic maximal-closed subgroups of \(\mathrm{Sym}(\mathbb N)\) via the classification of the reducts of the Henson digraphs
- Orbit-equivalent infinite permutation groups.
- Permutation groups with small orbit growth
- Reducts of the random partial order
- Cayley properties of merged Johnson graphs
- Reconstructing the topology on monoids and polymorphism clones of reducts of the rationals
- The case of equality in the Livingstone-Wagner theorem.
- The number of infinite substructures
- The affine and projective groups are maximal
- Constraint satisfaction problems over numeric domains
- Polynomials with PSL(2,7) as Galois group
- Siblings of an \(\aleph_0\)-categorical relational structure
- Complexity classification transfer for CSPs via algebraic products
- A classification of orbits admitting a unique invariant measure
- Homogeneous Cayley objects
- Permutation orbifolds in the large \(N\) limit
- Reducts of the generic digraph
- Lattice of definability (of reducts) for integers with successor
- Homogeneous multiplications
- Lattice of definability in the order of rational numbers
- When is the orbit algebra of a group an integral domain ? Proof of a conjecture of P.J. Cameron
- Smooth approximations and CSPs over finitely bounded homogeneous structures
- Top-heavy phenomena for transformations
- Permutations on the random permutation
- Minimum topological group topologies
- Well-quasi-ordering and Embeddability of Relational Structures
- Minimal functions on the random graph
- Jordan groups and limits of betweenness relations
- Reducts of the Henson graphs with a constant
- Fault tolerant supergraphs with automorphisms
This page was built for publication: Transitivity of permutation groups on unordered sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1220148)