Related papers: The externally definable Ramsey property and fixed…
Ramsey's theorem states that each coloring has an infinite homogeneous set, but these sets can be arbitrarily spread out. Paul Erdos and Fred Galvin proved that for each coloring f, there is an infinite set that is "packed together" which…
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…
Observability is a modelling property that describes the possibility of inferring the internal state of a system from observations of its output. A related property, structural identifiability, refers to the theoretical possibility of…
We study the uniform computational content of Ramsey's theorem in the Weihrauch lattice. Our central results provide information on how Ramsey's theorem behaves under product, parallelization and jumps. From these results we can derive a…
We describe a flexible construction that produces triples of finitely generated, residually finite groups $M\hookrightarrow P \hookrightarrow \Gamma$, where the maps induce isomorphisms of profinite completions…
The main result provide a common generalization for Ramsey-type theorems concerning finite colorings of edge sets of complete graphs with vertices in infinite semigroups. We capture the essence of theorems proved in different fields: for…
In this note we give a simple unifying proof of the undecidability of several diagrammatic properties of term rewriting systems that include: local confluence, strong confluence, diamond property, subcommutative property, and the existence…
While hidden class models of various types arise in many statistical applications, it is often difficult to establish the identifiability of their parameters. Focusing on models in which there is some structure of independence of some of…
In this paper we further study links between concentration of measure in topological transformation groups, existence of fixed points, and Ramsey-type theorems for metric spaces. We prove that whenever the group $\Iso(\U)$ of isometries of…
Solutions of Rough Differential Equations (RDE) may be defined as paths whose increments are close to an approximation of the associated flow. They are constructed through a discrete scheme using a non-linear sewing lemma. In this article,…
A characterization of finite homogeneous ultrametric spaces and finite ultrametric spaces generated by unrooted labeled trees is found in terms of representing trees. A characterization of finite ultrametric spaces having perfect strictly…
Ramsey's theorem, concerning the guarantee of certain monochromatic patterns in large enough edge-coloured complete graphs, is a fundamental result in combinatorial mathematics. In this work, we highlight the connection between this…
Dynamical system theory is a widely used technique in the analysis of cosmological models. Within this framework, the equations describing the dynamics of a model are recast in terms of dimensionless variables, which evolve according to a…
A celebrated result of R\"odl and Ruci\'nski states that for every graph $F$, which is not a forest of stars and paths of length $3$, and fixed number of colours $r\ge 2$ there exist positive constants $c, C$ such that for $p \leq…
We state the Ramsey property of classes of ordered structures with closures and given local properties. This generalises many old and new results: the Ne\v{s}et\v{r}il-R\"{o}dl Theorem, the author's Ramsey lift of bowtie-free graphs as well…
In the paper we prove, in particular, that for any measurable coloring of the euclidian plane into two colours there is a monochromatic triangle with some restrictions on the sides. Also we consider similar problems in finite fields…
We investigate the isomorphism problem in the setting of definable sets (equivalent to sets with atoms): given two definable relational structures, are they related by a definable isomorphism? Under mild assumptions on the underlying…
We examine the topological dynamics of the automorphism groups of omega-categorical sparse graphs resulting from Hrushovski constructions. Specifically, we consider the fixed points on type spaces property, which a structure M has if, for…
Nonexpansive mappings play a central role in modern optimization and monotone operator theory because their fixed points can describe solutions to optimization or critical point problems. It is known that when the mappings are sufficiently…
Hyperuniformity refers to the suppression of density fluctuations at large scales. Typical for ordered systems, this property also emerges in several disordered physical and biological systems, where it is particularly relevant to…