Related papers: Big Ramsey degrees using parameter spaces
We consider a generalisation of the classical Ramsey theory setting to a setting where each of the edges of the underlying host graph is coloured with a {\em set} of colours (instead of just one colour). We give bounds for monochromatic…
This paper is the third part of the series "Spherical higher order Fourier analysis over finite fields", aiming to develop the higher order Fourier analysis method along spheres over finite fields, and to solve the geometric Ramsey…
We derive a new sufficient condition for the existence of {\omega}-categorical universal structures in classes of relational structures with constraints, augmenting results by Cherlin, Shelah, Chi, and Hubi\v{c}ka and Ne\v{s}et\v{r}il.…
One major open conjecture in the area of critical random graphs, formulated by statistical physicists, and supported by a large amount of numerical evidence over the last decade [23, 24, 28, 63] is as follows: for a wide array of random…
We prove some results on the border of Ramsey theory (finite partition calculus) and model theory. Also a beginning of classification theory of finite models in undertaken.
We calibrate the reverse mathematical strength of a family of extensions of Ramsey's theorem to finite colorings of certain subsets of the natural numbers of unbounded finite dimension. Specifically, we analyze the principles…
The one-plaquette Hamiltonian of large N lattice gauge theory offers a constructive model of a $1+1$-dimensional string theory with a stable ground state. The free energy is found to be equivalent to the partition function of a string where…
In this paper we are concerned with the problem of finding hypersurfaces of constant curvature and prescribed boundary in the Euclidean space, using the theory of fully nonlinear elliptic equations. We prove that if the given data admits a…
We prove geometric Ramsey-type statements on collections of lines in 3-space. These statements give guarantees on the size of a clique or an independent set in (hyper)graphs induced by incidence relations between lines, points, and reguli…
We show that the big Ramsey degree of the Boolean algebra with 3 atoms within the countable atomless Boolean algebra is infinite.
We study freely infinitely divisible $R$-diagonal elements in the unbounded setting and Brown measures for free additive perturbations by such elements. This class includes circular elements, circular Cauchy elements, and other previously…
We prove a metric space scaling limit for a critical random graph with independent and identically distributed degrees having power-law tail behaviour with exponent $\alpha+1$, where $\alpha \in (1,2)$. The limiting components are…
In this paper we introduce a general framework for the study of limits of relational structures in general and graphs in particular, which is based on a combination of model theory and (functional) analysis. We show how the various…
We show that the Ramsey theory of block sequences in infinite-dimensional discrete vector spaces can be parametrized by perfect sets. As special cases, we prove combinatorial dichotomies for definable families of partitions and linear…
We give a short proof that any k-uniform hypergraph H on n vertices with bounded degree \Delta has Ramsey number at most c(\Delta, k)n, for an appropriate constant c(\Delta, k). This result was recently proved by several authors, but those…
Let $G$ be an $r$-uniform hypergraph. When is it possible to orient the edges of $G$ in such a way that every $p$-set of vertices has some $p$-degree equal to $0$? (The $p$-degrees generalise for sets of vertices what in-degree and…
We announce a generalization of Zimmer's cocycle superrigidity theorem proven using harmonic map techniques. This allows us to generalize many results concerning higher rank lattices to all lattices in semisimple groups with property $(T)$.…
In the parlance of relational structures, the Finite Ramsey Theorem states that the class of all finite chains has the Ramsey property. A classical result of J. Ne\v{s}et\v{r}il and V. R\"{o}dl claims that the class of all finite posets…
We prove a sampling theorem for infinite-dimensional Paley-Wiener spaces on graphs which allows for stable frame reconstruction. We prove that all sampling sets for a fixed Paley-Wiener space are complements of lambda-sets (i.e. sets where…
We announce two breakthrough results concerning important questions in the Theory of Computational Complexity. In this expository paper, a systematic and comprehensive geometric characterization of the Subset Sum Problem is presented. We…