Related papers: A Ramsey theorem on semigroups and a general van d…
The first-order part of the Ramsey's Theorem for pairs with an arbitrary number of colors is known to be precisely BSigma03. We compare this to the known division of Ramsey's Theorem for pairs into the weaker principles, EM (the…
In his seminal paper on complex reflection arrangements, Bessis introduces a Garside structure for the braid group of a well-generated irreducible complex reflection group. Using this Garside structure, he establishes a strong connection…
We introduce the concept of a restriction semigroupoid S, which unifies the notion of restriction semigroups and restriction categories within a single structure. We prove a representation theorem, showing that every restriction…
We prove a pointwise ergodic theorem for quasi-probability-measure-preserving (quasi-pmp) locally countable measurable graphs, equivalently, Schreier graphs of quasi-pmp actions of countable groups. For ergodic graphs, the theorem gives an…
We study a one-parameter family of binomial-convolution operators acting on sequences. These operators form an additive semigroup with an explicit inverse, and they subsume iterated classical binomial transforms as a special case. We…
In this paper we characterize the congruence associated to the direct sum of all irreducible representations of a finite semigroup over an arbitrary field, generalizing results of Rhodes for the field of complex numbers. Applications are…
The classical Ramsey theorem, states that every graph contains either a large clique or a large independent set. Here we investigate similar dichotomic phenomena in the context of finite metric spaces. Namely, we prove statements of the…
A complete partition theory is presented for omega-located words (and omega-words), namely for located words over an infinite alphabet dominated by a fixed increasing sequence. This theory strengthens in an essential way the classical…
In 1975 Szemer\'edi proved that a set of integers of positive upper density contains arbitrarily long arithmetic progressions. Bergelson and Leibman showed in 1996 that the common difference of the arithmetic progression can be a square, a…
We are living in a world which is getting more and more interconnected and, as physiological effect, the interaction between the entities produces more and more information. This high throughput generation calls for techniques able to…
The Ramsey number $r(G)$ of a graph $G$ is the minimum $N$ such that every red-blue coloring of the edges of the complete graph on $N$ vertices contains a monochromatic copy of $G$. Determining or estimating these numbers is one of the…
We resolve a conjecture of Cooper-Fenner-Purewal that a certain sequence of combinatorial matrices which can be used to bound small product-Ramsey numbers is positive semidefinite. Because the connection to Ramsey Theory involves solving…
We survey recent (and not so recent) results concerning arrangements of lines, points and other geometric objects and the applications these results have in theoretical computer science and combinatorics. The three main types of problems we…
Szemeredi's regularity lemma can be viewed as a rough structure theorem for arbitrary dense graphs, decomposing such graphs into a structured piece (a partition into cells with edge densities), a small error (corresponding to irregular…
We use Grothendieck theorem to prove a structure theorem for multicorrelation sequences of length two, associated with two (not necessarily commuting) measure preserving actions on a probability space. We use this to deduce a multiple…
We use nonstandard methods, based on iterated hyperextensions, to develop applications to Ramsey theory of the theory of monads of ultrafilters. This is performed by studying in detail arbitrary tensor products of ultrafilters, as well as…
Let $\Gamma$ be a convex cocompact thin subgroup of an arithmetic lattice in $\operatorname{SO}(n, 1)$. We generalize Selberg's $\frac{3}{16}$ theorem in this setting, i.e., we prove uniform exponential mixing of the frame flow and obtain a…
The hypergraph container lemma is a powerful tool in probabilistic combinatorics that has found many applications since it was first proved a decade ago. Roughly speaking, it asserts that the family of independent sets of every uniform…
We identify computability-theoretic properties enabling us to separate various statements about partial orders in reverse mathematics. We obtain simpler proofs of existing separations, and deduce new compound ones. This work is part of a…
Some of the classical results of Ramsey Theory can be naturally stated in terms of image partition regularity of matrices. There have been many significant results of image partition regular matrices as well as image partition regular…