Related papers: Non-Homogenizable Classes of Finite Structures
A relational structure is (connected-)homogeneous if every isomorphism between finite (connected) substructures extends to an automorphism of the structure. We investigate notions which generalise (connected-)homogeneity, where…
In this paper we prove that the automorphism groups of certain countable generic structures are not amenable. For doing that, we first prove the existence of particular matrices that do not satisfy the convex Ramsey condition. For a pair of…
Constraint Satisfaction Problems (CSP) constitute a convenient way to capture many combinatorial problems. The general CSP is known to be NP-complete, but its complexity depends on a template, usually a set of relations, upon which they are…
In this paper we introduce a new topological Ramsey space whose elements are infinite ordered polyhedra. Then, we show as an application that the set of finite polyhedra satisfies two types of Ramsey property: one, when viewed as a category…
Motivated by recent best case analyses for some sorting algorithms and based on the type of complexity we partition the algorithms into two classes: homogeneous and non homogeneous algorithms. Although both classes contain algorithms with…
Here homogenization theory is used to establish a connection between the symmetries of a periodic elastic structure associated with the microscopic properties of an elastic material and the material symmetries of the effective, macroscopic…
We study stochastic particle systems that conserve the particle density and exhibit a condensation transition due to particle interactions. We restrict our analysis to spatially homogeneous systems on finite lattices with stationary product…
We determine, up to the equivalence of first-order interdefinability, all structures which are first-order definable in the random partial order. It turns out that these structures fall into precisely five equivalence classes. We achieve…
The algebraic dichotomy conjecture for Constraint Satisfaction Problems (CSPs) of reducts of (infinite) finitely bounded homogeneous structures states that such CSPs are polynomial-time tractable when the model-complete core of the template…
The intended model of the homotopy type theories used in Univalent Foundations is the infinity-category of homotopy types, also known as infinity-groupoids. The problem of higher structures is that of constructing the homotopy types needed…
Coherent structures emerge from the dynamics of many kinds of dissipative, externally driven, nonlinear systems, and continue to provoke new questions that challenge our physical and mathematical understanding. In one specific sub-class of…
In this article we give an explicit classification for the countably infinite graphs $\mathcal{G}$ which are, for some $k$, $\geq$$ k$-homogeneous. It turns out that a $\geq$$k-$homogeneous graph $\mathcal{M}$ is non-homogeneous if and only…
We analyse how the standard reductions between constraint satisfaction problems affect their proof complexity. We show that, for the most studied propositional, algebraic, and semi-algebraic proof systems, the classical constructions of…
For any infinite-type surface $S$, a natural question is whether the homology of its mapping class group contains any non-trivial classes that are supported on (i) a compact subsurface or (ii) a finite-type subsurface. Our purpose here is…
Constraint satisfaction problems are computational problems that naturally appear in many areas of theoretical computer science. One of the central themes is their computational complexity, and in particular the border between…
Let M be ternary, homogeneous and simple. We prove that if M is finitely constrained, then it is supersimple with finite SU-rank and dependence is $k$-trivial for some $k < \omega$ and for finite sets of real elements. Now suppose that, in…
Let G be a simple Lie group of real rank one, and S the ideal boundary of the corresponding symmetric space of noncompact type (H^n_R, H^n_C, H^n_H or H^2_O). We show the finiteness of the possible values of the secondary characteristic…
The homology groups of the automorphism group of a free group are known to stabilize as the number of generators of the free group goes to infinity, and this paper relativizes this result to a family of groups that can be defined in terms…
We classify all group topologies coarser than the topology of stabilizers of finite sets in the case of automorphism groups of countable free-homogeneous structures, Urysohn space and Urysohn sphere, among other related results.
Regionalization is the task of dividing up a landscape into homogeneous patches with similar properties. Although this task has a wide range of applications, it has two notable challenges. First, it is assumed that the resulting regions are…