Related papers: Non-Homogenizable Classes of Finite Structures

We give strengthened versions of the Herwig-Lascar and Hodkinson-Otto extension theorems for partial automorphisms of finite structures. Such strengthenings yield several combinatorial and group-theoretic consequences for homogeneous…

In this paper an extended CPR decomposition theorem for Finsler symmetric spaces of semi-negative curvature in the context of reductive structures is proven. This decomposition theorem is applied to give a geometric description of the…

We classify the finite connected-homogeneous digraphs, as well as the infinite such digraphs with precisely one end. This completes the classification of all the locally finite connected-homogeneous digraphs.

This paper deals with the finite-time stabilization of a class of nonlinear infinite-dimensional systems. First, we consider a bounded matched perturbation in its linear form. It is shown that by using a set-valued function, both the…

Machine learning models can be used to predict physical quantities like homogenized elasticity stiffness tensors, which must always be symmetric positive definite (SPD) based on conservation arguments. Two datasets of homogenized elasticity…

We show that if a complex has free finitely generated reduced homology groups for two consecutive dimensions and trivial homology for all other dimensions, then it must have the homotopy type of a wedge of spheres of two consecutive…

We study the problem of existence and uniqueness of homotopy colimits in stable representation theory, where one typically does not have model category structures to guarantee that these homotopy colimits exist or have good properties. We…

We show that the class of finite rooted binary plane trees is a Ramsey class (with respect to topological embeddings that map leaves to leaves). That is, for all such trees P,H and every natural number k there exists a tree T such that for…

Automatic structures are infinite structures that are finitely represented by synchronized finite-state automata. This paper concerns specifically automatic structures over finite words and trees (ranked/unranked). We investigate the…

We prove a theorem ensuring that the compositions of certain Ramsey families are still Ramsey. As an application, we show that in any finite coloring of $\mathbb{N}$ there is an infinite set $A$ and an as large as desired finite set $B$…

The constraint satisfaction problem (CSP) is a computational problem that includes a range of important problems in computer science. We point out that fundamental concepts of the CSP, such as the solution set of an instance and…

The necessity to find the global optimum of multiextremal functions arises in many applied problems where finding local solutions is insufficient. One of the desirable properties of global optimization methods is \emph{strong homogeneity}…

In this paper, we show that coherence witness for a single qubit itself yields conditions for nonlocality and entanglement inequalities for multiqubit systems. It also yields a condition for quantum discord in two--qubit systems. It is…

One of the most fundamental mathematical contributions of Garrett Birkhoff is the HSP theorem, which implies that a finite algebra B satisfies all equations that hold in a finite algebra A of the same signature if and only if B is a…

We look at spaces of infinite-by-infinite matrices, and consider closed subsets that are stable under simultaneous row and column operations. We prove that up to symmetry, any of these closed subsets is defined by finitely many equations.

We introduce a reducibility on classes of structures, essentially a uniform enumeration reducibility. This reducibility is inspired by the Friedman-Stanley paper on using Borel reductions to compare classes of countable structures. This…

Coherent states for equally spaced, homogeneous waveguide arrays are defined, in the infinite, semiinfinite and finite cases, and resolutions of the identity are constructed, using different methods. In the infinite case, which corresponds…

This paper completely determines the non-amenability of the mapping class groups of infinite-type surfaces, the mapping class groups of locally finite infinite graphs of higher ranks, gives an example of non-amenable stabiliser of a point…

Non-autonomous self-similar sets are a family of compact sets which are, in some sense, highly homogeneous in space but highly inhomogeneous in scale. The main purpose of this note is to clarify various regularity properties and separation…

We connect the mixing behaviour of random walks over a graph to the power of the local-consistency algorithm for the solution of the corresponding constraint satisfaction problem (CSP). We extend this connection to arbitrary CSPs and their…