Related papers: Ramsey growth in some NIP structures

Given a prime $p$, a number field $\K$ and a finite set of places $S$ of $\K$, let $\K_S$ be the maximal pro-$p$ extension of $\K$ unramified outside $S$. Using the Golod-Shafarevich criterion one can often show that $\K_S/\K$ is infinite.…

We prove a structure theorem for multiplicative functions which states that an arbitrary bounded multiplicative function can be decomposed into two terms, one that is approximately periodic and another that has small Gowers uniformity norm…

We define the class of groups of bounded type from tile inflations. These tile inflations also determine some automata describing the groups. In the case when the automata are stationary, we show that if the set of incompressible elements…

We characterize the big Ramsey degrees of free amalgamation classes in finite binary languages defined by finitely many forbidden irreducible substructures, thus refining the recent upper bounds given by Zucker. Using this characterization,…

We prove a theorem which provides a method for constructing points on varieties defined by certain smooth functions. We require that the functions are definable in a definably complete expansion of a real closed field and are locally…

We prove the definability, and actually the finiteness of the commutator width, of many commutator subgroups in groups definable in o-minimal structures. It applies in particular to derived series and to lower central series of solvable…

Let $M$ be a connected complete noncompact $n$-dimensional Riemannian manifold with a base point $p \in M$ whose radial sectional curvature at $p$ is bounded from below by that of a noncompact surface of revolution which admits a finite…

The study of symmetric structures is a new trend in Ramsey theory. Recently in [7], Di Nasso initiated a systematic study of symmetrization of classical Ramsey theoretical results, and proved a symmetric version of several Ramsey theoretic…

We propose new structures called almost o-minimal structures and $\mathfrak X$-structures. The former is a first-order expansion of a dense linear order without endpoints such that the intersection of a definable set with a bounded open…

We give a criterion for bounding the homological finiteness length of certain HF-groups. This is used in two distinct contexts. Firstly, the homological finiteness length of a non-uniform lattice on a locally finite n-dimensional…

We develop a Ramsey-like theorem for subsets of the two and three-dimensional simplex. A generalization of the combinatorial theorem presented here to all dimensions would produce a new proof that $\textrm{Homeo}_+[0,1]$ is extremely…

A nearly logarithmic lower bound on the randomized competitive ratio for the metrical task systems problem is presented. This implies a similar lower bound for the extensively studied k-server problem. The proof is based on Ramsey-type…

In this paper, we consider relational structures arising from Comer's finite field construction, where the cosets need not be sum free. These Comer schemes generalize the notion of a Ramsey scheme and may be of independent interest. As an…

The purpose of this paper is twofold. 1. We give combinatorial bounds on the ranks of the groups $\Tor^{R}_\bullet(k,k)_\bullet$ in the case where $R = k[\Lambda]$ is an affine semi-group ring, and in the process provide combinatorial…

Motivated by problems on random differences in Szemer\'{e}di's theorem and on large deviations for arithmetic progressions in random sets, we prove upper bounds on the Gaussian width of point sets that are formed by the image of the…

We use and adapt the Borsuk-Ulam Theorem from topology to derive limitations on list-replicable and globally stable learning algorithms. We further demonstrate the applicability of our methods in combinatorics and topology. We show that,…

We prove an effective version of the inverse theorem for the Gowers $U^3$-norm for functions supported on high-rank quadratic level sets in finite vector spaces. For configurations controlled by the $U^3$-norm (complexity-two…

We generalize the stable graph regularity lemma of Malliaris and Shelah to the case of finite structures in finite relational languages, e.g., finite hypergraphs. We show that under the model-theoretic assumption of stability, such a…

We prove a new characterization of the Ramsey property of categories in terms of a generalized form of K\H{o}nig's tree lemma. Afterwards, we discuss its applications to structural Ramsey theory. In particular, we provide a new proof of the…

We prove a Ramsey theorem for finite sets equipped with a partial order and a fixed number of linear orders extending the partial order. This is a common generalization of two recent Ramsey theorems due to Soki\'c. As a bonus, our proof…