The Dense Hindman's Theorem states that, in any finite coloring of the integers, one may find a single color and a "dense" set $B_1$, for each $b_1\in B_1$ a "dense" set $B_2^{b_1}$ (depending on $b_1$), for each $b_2\in B_2^{b_1}$ a "dense" set $B_3^{b_1,b_2}$ (depending on $b_1,b_2$), and so on, such that for any such sequence of $b_i$, all finite sums belong to the chosen color. (Here density is often taken to be "piecewise syndetic", but the proof is unchanged for any notion of density satisfying certain properties.) This theorem is an example of a combinatorial statement for which the only known proof requires the use of ultrafilters or a similar infinitary formalism. Here we give a direct combinatorial proof of the theorem.
Hindman's Theorem is a prototypical example of a combinatorial theorem with a proof that uses the topology of the ultrafilters. We show how the methods of this proof, including topological arguments about ultrafilters, can be translated into second order arithmetic.
H. Furstenberg introduced the notion of central set in terms of topological dynamics and established the central set theorem. The essence of central set theorem is that it is the simultaneous extension of van der Waerden's theorem and Hindman's theorem. Later V. Bergelson and N. Hindman established a connection between central sets and the algebra of Stone-cech compactification and proved that the central sets are the member of minimal idempotent ultrafilter of discrete semigroup. In some subsequent papers the central set theorem has been studied more deeply and some generalizations has been e…
In this article, we give two proofs of Carlson's theorem for located words in~$\mathsf{ACA}^+_0$. The first proof is purely combinatorial, in the style of Towsner's proof of Hindman's theorem. The second uses topological dynamics to show that an iterated version of Hindman's theorem for bounded sums implies Carlson's theorem for located words.
Using dynamics, Furstenberg defined the concept of a central subset of positive integers and proved several powerful combinatorial properties of central sets. Later using the algebraic structure of the Stone-Čech compactification, Bergelson and Hindman, with the assistance of B. Weiss, generalized the notion of a central set to any semigroup and extended the most important combinatorial property of central sets to the central sets theorem. Currently the most powerful formulation of the central sets theorem is due to De, Hindman, and Strauss in [3, Corollary 3.10]. However their formulation of …
We give a purely combinatorial proof for a two-fold generalization of van der Waerden-Brauer's theorem and Hindman's theorem. We also give tower bounds for a finite version of it.
A theorem due to Hindman states that if $E$ is a subset of $\mathbb{N}$ with $d^*(E)>0$, where $d^*$ denotes the upper Banach density, then for any $\varepsilon>0$ there exists $N \in \mathbb{N}$ such that $d^*\left(\bigcup_{i=1}^N(E-i)\right) > 1-\varepsilon$. Curiously, this result does not hold if one replaces the upper Banach density $d^*$ with the upper density $\bar{d}$. Originally proved combinatorially, Hindman's theorem allows for a quick and easy proof using an ergodic version of Furstenberg's correspondence principle. In this paper, we establish a variant of the ergodic Furstenberg'…
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 natural numbers due to Milliken--Tylor, Deuber--Hindman, Bergelson--Hindman, for combinatorial covering properties due to Scheepers and Tsaban, and local properties in function spaces due to Scheepers. To this end, we use idempotent ultrafilters in the Čech--Stone compactifications of discrete infinite semigroups and topological games. The research is motivate…
Hindman and Leader first introduced the notion of Central sets near zero for dense subsemigroups of $((0,\infty),+)$ and proved a powerful combinatorial theorem about such sets. Using the algebraic structure of the Stone-$\breve{C}$ech compactification, Bayatmanesh and Tootkabani generalized and extended this combinatorial theorem to the central theorem near zero. Algebraically one can define quasi-central set near zero for dense subsemigroup of $((0,\infty),+)$, and they also satisfy the conclusion of central sets theorem near zero. In a dense subsemigroup of $((0,\infty),+)$, C-sets near zer…
Hindman proved that, whenever the set $\mathbb{N}$ of naturals is finitely colored, there must exist non-constant monochromatic solution of the equation $a+b=cd$. In this paper we extend this result for dense subsemigroups of $((0, \infty), +)$ to near zero.
The dense O(1) loop model is a statistical physics model with connections to the quantum XXZ spin chain, alternating sign matrices, the six-vertex model and critical bond percolation on the square lattice. When cylindrical boundary conditions are imposed, the model possesses a commuting family of transfer matrices. The original proof of the commutation property is algebraic and is based on the Yang-Baxter equation. In this paper we give a new proof of this fact using a direct combinatorial bijection.
Nowhere dense classes of graphs are classes of sparse graphs with rich structural and algorithmic properties, however, they fail to capture even simple classes of dense graphs. Monadically stable classes, originating from model theory, generalize nowhere dense classes and close them under transductions, i.e. transformations defined by colorings and simple first-order interpretations. In this work we aim to extend some combinatorial and algorithmic properties of nowhere dense classes to monadically stable classes of finite graphs. We prove the following results. - In monadically stable classes …
We propose a slightly revised Miller-Hagberg (MH) algorithm that efficiently generates a random network from a given expected degree sequence. The revision was to replace the approximated edge probability between a pair of nodes with a combinatorically calculated edge probability that better captures the likelihood of edge presence especially where edges are dense. The computational complexity of this combinatorial MH algorithm is still in the same order as the original one. We evaluated the proposed algorithm through several numerical experiments. The results demonstrated that the proposed al…
Given a complete graph with positive weights on its edges, we define the weight of a subset of edges as the product of weights of the edges in the subset and consider sums (partition functions) of weights over subsets of various kinds: cycle covers, closed walks, spanning trees. We show that if the weights of the edges of the graph are within a constant factor, fixed in advance, of each other then the bulk of the partition function is concentrated on the subsets of a particularly simple structure: cycle covers with few cycles, walks that visit every vertex only few times, and spanning trees wi…
The theory of limits of discrete combinatorial objects has been thriving for the last decade or so. The syntactic, algebraic approach to the subject is popularly known as "flag algebras", while the semantic, geometric one is often associated with the name ``graph limits''. The language of graph limits is generally more intuitive and expressible, but a price that one has to pay for it is that it is better suited for the case of ordinary graphs than for more general combinatorial objects. Accordingly, there have been several attempts in the literature, of varying degree of generality, to define …
Hindman's celebrated Finite Sums Theorem, and its high-dimensional version due to Milliken and Taylor, are extended from covers of countable sets to covers of arbitrary topological spaces with Menger's classic covering property. The methods include, in addition to Hurewicz's game theoretic characterization of Menger's property, extensions of the classic idempotent theory in the Stone--Czech compactification of semigroups, and of the more recent theory of selection principles. This provides strong versions of the mentioned celebrated theorems, where the monochromatic substructures are large, be…
We prove a general duality theorem for tangle-like dense objects in combinatorial structures such as graphs and matroids. This paper continues, and assumes familiarity with, the theory developed in [6]
We prove that for every class of graphs $\mathcal{C}$ which is nowhere dense, as defined by Nesetril and Ossona de Mendez, and for every first order formula $ϕ(\bar x,\bar y)$, whenever one draws a graph $G\in \mathcal{C}$ and a subset of its nodes $A$, the number of subsets of $A^{|\bar y|}$ which are of the form $\{\bar v\in A^{|\bar y|}\, \colon\, G\modelsϕ(\bar u,\bar v)\}$ for some valuation $\bar u$ of $\bar x$ in $G$ is bounded by $\mathcal{O}(|A|^{|\bar x|+ε})$, for every $ε>0$. This provides optimal bounds on the VC-density of first-order definable set systems in nowhere dense graph c…
Consider a simplicial complex that allows for an embedding into $\mathbb{R}^d$. How many faces of dimension $\frac{d}{2}$ or higher can it have? How dense can they be? This basic question goes back to Descartes' "Lost Theorem" and Euler's work on polyhedra. Using it and other fundamental combinatorial problems, we introduce a version of the Kähler package beyond positivity, allowing us to prove the hard Lefschetz theorem for toric varieties (and beyond) even when the ample cone is empty. A particular focus lies on replacing the Hodge-Riemann relations by a non-degeneracy relation at torus-inva…
