Permutations on the random permutation

zbMathNonearXiv1405.4297MaRDI QIDQ491556

Michael Pinsker, Julie Linman

Publication date: 26 August 2015

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

Ramsey theoryrandom permutationcanonical functionreduct

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorics of partially ordered sets (06A07) Ramsey theory (05D10) Model theory of denumerable and separable structures (03C15) Groups as automorphisms of other structures (22F50)

Related Items (6)

PAIRWISE NONISOMORPHIC MAXIMAL-CLOSED SUBGROUPS OF SYM(ℕ) VIA THE CLASSIFICATION OF THE REDUCTS OF THE HENSON DIGRAPHS ⋮ The 42 reducts of the random ordered graph ⋮ NIP ω$\omega$‐categorical structures: The rank 1 case ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item

Cites Work

• Unnamed Item
• New Ramsey classes from old
• Reducts of the random partial order
• Transitivity of permutation groups on unordered sets
• Homogeneous permutations
• Reducts of random hypergraphs
• Ramsey properties of permutations
• Minimal functions on the random graph
• Directed graphs and boron trees
• Schaefer's Theorem for Graphs
• The 42 reducts of the random ordered graph
• Reducts of Ramsey structures
• The 116 reducts of (ℚ, <, a)
• Reducts of the random graph
• Decidability of Definability

This page was built for publication: Permutations on the random permutation