Canonical functions: a proof via topological dynamics
From MaRDI portal
(Redirected from Publication:5154970)
Recommendations
Cites work
- \(2^{\aleph_{0}}\) pairwise nonisomorphic maximal-closed subgroups of \(\mathrm{Sym}(\mathbb N)\) via the classification of the reducts of the Henson digraphs
- \({\aleph_{0}}\)-categorical structures: endomorphisms and interpretations
- A complexity dichotomy for poset constraint satisfaction
- A uniform Birkhoff theorem
- Automorphism groups and Ramsey properties of sparse graphs
- Constraint satisfaction problems for reducts of homogeneous graphs
- CORES OVER RAMSEY STRUCTURES
- Decidability of definability
- Dynamics of non-Archimedean Polish groups
- Equivalence constraint satisfaction problems
- Ergodic Ramsey theory: a dynamical approach to static theorems
- Fraïssé limits, Ramsey theory, and topological dynamics of automorphism groups
- scientific article; zbMATH DE number 1007358 (Why is no real title available?)
- scientific article; zbMATH DE number 6862042 (Why is no real title available?)
- Locally finite constraint satisfaction problems
- Permutations on the random permutation
- PROJECTIVE CLONE HOMOMORPHISMS
- Reducts of finitely bounded homogeneous structures, and lifting tractability from finite-domain constraint satisfaction
- Reducts of the generic digraph
- Reducts of the Henson graphs with a constant
- Reducts of the random partial order
- The algebraic dichotomy conjecture for infinite domain constraint satisfaction problems
- The reducts of the homogeneous binary branching C-relation
- The wonderland of reflections
Cited in
(19)- Topological realization of transfer functions in canonical forms
- Equations in oligomorphic clones and the constraint satisfaction problem for \(\omega \)-categorical structures
- When symmetries are not enough: a hierarchy of hard constraint satisfaction problems
- Hardness of Network Satisfaction for Relation Algebras with Normal Representations
- Solving equation systems in ω-categorical algebras
- Constraint satisfaction problems for reducts of homogeneous graphs
- The Complexity of Network Satisfaction Problems for Symmetric Relation Algebras with a Flexible Atom
- Polish topologies on endomorphism monoids of relational structures
- Canonical Functions: a proof via topological dynamics
- On the descriptive complexity of temporal constraint satisfaction problems
- Complexity classification transfer for CSPs via algebraic products
- Smooth approximations and CSPs over finitely bounded homogeneous structures
- Collapsing the bounded width hierarchy for infinite-domain constraint satisfaction problems: when symmetries are enough
- Promise and infinite-domain constraint satisfaction
- An algebraic proof of the dichotomy for graph orientation problems with forbidden tournaments
- Smooth approximations: an algebraic approach to CSPs over finitely bounded homogeneous structures
- A complexity dichotomy in spatial reasoning via Ramsey theory
- Generalized completion problems with forbidden tournaments
- Three fundamental questions in modern infinite-domain constraint satisfaction
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)
