A survey of homogeneous structures

From MaRDI portal
Publication:2275386

DOI10.1016/j.disc.2011.01.024zbMath1238.03032OpenAlexW2058971493WikidataQ55885818 ScholiaQ55885818MaRDI QIDQ2275386

Dugald Macpherson

Publication date: 8 August 2011

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2011.01.024




Related Items

On a stronger reconstruction notion for monoids and clonesA topological characterisation of endomorphism monoids of countable structuresLattice of definability (of reducts) for integers with successorBoundedness and nuclearity of pseudo-differential operators on homogeneous treesIB-homogeneous graphsThe poset of morphism-extension classes of countable graphsA classification of orbits admitting a unique invariant measureWhen Symmetries Are Not Enough: A Hierarchy of Hard Constraint Satisfaction ProblemsHomogenizable structures and model completenessAntichains of copies of ultrahomogeneous structuresPolymorphism clones of homogeneous structures: gate coverings and automatic homeomorphicityPolymorphism clones of homogeneous structures: generating sets, Sierpiński rank, cofinality and the Bergman propertyReconstructing the topology of the elementary self-embedding monoids of countable saturated structuresFraïssé limits in comma categoriesAutomorphism groups of generic structures: extreme amenability and amenabilityBetweenness relations in a categorical settingOn sets with rank one in simple homogeneous structuresPAIRWISE NONISOMORPHIC MAXIMAL-CLOSED SUBGROUPS OF SYM(ℕ) VIA THE CLASSIFICATION OF THE REDUCTS OF THE HENSON DIGRAPHSRELATIVELY EXCHANGEABLE STRUCTURESBeyond Lebesgue and Baire. III: Steinhaus' theorem and its descendantsOn the definition of the small index property\(>k\)-homogeneous infinite graphsThe 42 reducts of the random ordered graphFraïssé sequences: category-theoretic approach to universal homogeneous structuresPolish topologies on endomorphism monoids of relational structuresBig Ramsey degrees of 3-uniform hypergraphs are finiteNIP ω$\omega$‐categorical structures: The rank 1 casePermutation monoids and MB-homogeneity for graphs and relational structuresAutomorphism invariant measures and weakly generic automorphismsTHE AUTOMORPHISM GROUP OF THE FRAÏSSÉ LIMIT OF FINITE HEYTING ALGEBRASBowtie‐free graphs and generic automorphismsCOHERENT EXTENSION OF PARTIAL AUTOMORPHISMS, FREE AMALGAMATION AND AUTOMORPHISM GROUPSHomogeneous 1‐based structures and interpretability in random structuresProperties of the automorphism group and a probabilistic construction of a class of countable labeled structuresThe conjugacy problem for automorphism groups of countable homogeneous structuresUltrahomogeneous tensor spacesThe lattice of definability: origins, recent developments, and further directionsMonadic stability and growth rates of ω$\omega$‐categorical structuresSolving infinite-domain CSPs using the patchwork propertyGENERALIZED AMALGAMATION AND HOMOGENEITYRETRACTIONS OF REVERSIBLE STRUCTURESUnnamed ItemThe classification of homomorphism homogeneous tournamentsGroup topologies on automorphism groups of homogeneous structuresOn automatic homeomorphicity for transformation monoidsUnitary representations of oligomorphic groupsAction of endomorphism semigroups on definable setsTHE REDUCTS OF THE HOMOGENEOUS BINARY BRANCHING C-RELATIONON PRODUCTS OF ELEMENTARILY INDIVISIBLE STRUCTURESCountable homogeneous linearly ordered posetsPositive families and Boolean chains of copies of ultrahomogeneous structuresReducts of the random partial orderHomogeneous 2-partite digraphsSimplicity of some automorphism groups.Non-universality of automorphism groups of uncountable ultrahomogeneous structuresConjugacy for homogeneous ordered graphsInfinite lexicographic productsThe lattice of definable equivalence relations in homogeneous \(n\)-dimensional permutation structuresON CONSTRAINTS AND DIVIDING IN TERNARY HOMOGENEOUS STRUCTURESConstants and finite unary relations in qualitative constraint reasoningCharacterizations of monadic NIPFraïssé's construction from a topos-theoretic perspectiveIsomorphic and strongly connected componentsBINARY PRIMITIVE HOMOGENEOUS SIMPLE STRUCTURESINVARIANT MEASURES CONCENTRATED ON COUNTABLE STRUCTURESTractability of quantified temporal constraints to the maxEliminating unbounded search in computable algebraBinary simple homogeneous structures are supersimple with finite rankExtending partial isometries of antipodal graphsThe back-and-forth method and computability without delayTwo Fraïssé-style theorems for homomorphism-homogeneous relational structuresUniversal locally finite maximally homogeneous semigroups and inverse semigroupsWQO dichotomy for 3-graphs\(\aleph_0\)-categoricity of semigroups. II.Homogeneous actions on the random graphBinary simple homogeneous structuresThe classification of homogeneous finite-dimensional permutation structuresAutomorphism groups of finite topological rankEquations in oligomorphic clones and the constraint satisfaction problem for ω-categorical structuresWeakly almost periodic functions, model-theoretic stability, and minimality of topological groupsDecidability Border for Petri Nets with Data: WQO Dichotomy ConjecturePermutation groups containing infinite symplectic linear groups and reducts of linear spaces over the two element fieldFOUNDATIONS OF ONLINE STRUCTURE THEORYOn holographic structuresOn highly regular strongly regular graphsTopological dynamics of unordered Ramsey structuresCategoricity in multiuniversal classesSupersimple \(\omega\)-categorical theories and pregeometriesA characterization of retracts in certain Fraïssé limitsUsing model theory to find decidable and tractable description logics with concrete domainsDescription logics with concrete domains and general concept inclusions revisitedMULTIDIMENSIONAL EXACT CLASSES, SMOOTH APPROXIMATION AND BOUNDED 4-TYPESThe automorphism group of Hall’s universal groupOn the automorphism group of homogeneous structuresON THE AUTOMORPHISM GROUP OF THE UNIVERSAL HOMOGENEOUS MEET-TREEThe Complexity of Network Satisfaction Problems for Symmetric Relation Algebras with a Flexible AtomFunctional reducts of the countable atomless Boolean algebra



Cites Work