Canonical functions: a proof via topological dynamics

MaRDI QIDQ5154970FDOQ5154970

Authors: Michael Pinsker, Manuel Bodirsky 

Publication date: 5 October 2021

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

Recommendations

• Topologically inseparable functions II: Infinitary case
• Topologically inseparable functions I: Finitary case
• Definability in functional analysis
• Ultrafilters and Ramsey-type shadowing phenomena in topological dynamics
• Representation of algebraic theories and non-expanding maps

zbMATH Keywords

Ramsey propertycanonical functionoligomorphic permutation group\( \omega \)-categorical structureextremely amenable permuation group

Mathematics Subject Classification ID

Groups as automorphisms of other structures (22F50) Categoricity and completeness of theories (03C35) Infinite automorphism groups (20B27)

Cites Work

• Fraïssé limits, Ramsey theory, and topological dynamics of automorphism groups
• Title not available (Why is that?)
• Decidability of definability
• Reducts of the random partial order
• Equivalence constraint satisfaction problems
• Permutations on the random permutation
• The algebraic dichotomy conjecture for infinite domain constraint satisfaction problems
• Reducts of the Henson graphs with a constant
• \({\aleph_{0}}\)-categorical structures: endomorphisms and interpretations
• Automorphism groups and Ramsey properties of sparse graphs
• CORES OVER RAMSEY STRUCTURES
• Reducts of the generic digraph
• PROJECTIVE CLONE HOMOMORPHISMS
• A uniform Birkhoff theorem
• The wonderland of reflections
• The reducts of the homogeneous binary branching \(C\)-relation
• Ergodic Ramsey theory: a dynamical approach to static theorems
• \(2^{\aleph_{0}}\) pairwise nonisomorphic maximal-closed subgroups of \(\mathrm{Sym}(\mathbb N)\) via the classification of the reducts of the Henson digraphs
• Title not available (Why is that?)
• Constraint satisfaction problems for reducts of homogeneous graphs
• Reducts of finitely bounded homogeneous structures, and lifting tractability from finite-domain constraint satisfaction
• Dynamics of non-Archimedean Polish groups
• A complexity dichotomy for poset constraint satisfaction
• Locally finite constraint satisfaction problems

Cited In (12)

• On the descriptive complexity of temporal constraint satisfaction problems
• Hardness of Network Satisfaction for Relation Algebras with Normal Representations
• The Complexity of Network Satisfaction Problems for Symmetric Relation Algebras with a Flexible Atom
• Topological realization of transfer functions in canonical forms
• Complexity classification transfer for CSPs via algebraic products
• When symmetries are not enough: a hierarchy of hard constraint satisfaction problems
• Equations in oligomorphic clones and the constraint satisfaction problem for \(\omega \)-categorical structures
• Smooth approximations and CSPs over finitely bounded homogeneous structures
• Polish topologies on endomorphism monoids of relational structures
• Collapsing the bounded width hierarchy for infinite-domain constraint satisfaction problems: when symmetries are enough
• Solving equation systems in ω-categorical algebras
• Constraint satisfaction problems for reducts of homogeneous graphs

This page was built for publication: Canonical functions: a proof via topological dynamics

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