Related papers: Colorful fractional Helly theorem via weak saturat…
Recent results show that several important graph classes can be embedded as subgraphs of strong products of simpler graphs classes (paths, small cliques, or graphs of bounded treewidth). This paper develops general techniques to bound the…
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…
The deleting items theorems of weak law of large numbers (WLLN),strong law of large numbers (SLLN) and central limit theorem (CLT) are derived by substituting partial sum of random variable sequence with deleting items partial sum. We…
We generalize many recent uniqueness results on the fractional Calder\'on problem to cover the cases of all domains with nonempty exterior. The highlight of our work is the characterization of uniqueness and nonuniqueness of partial data…
We place additional constraints on the three parameters of the dark matter halo merger rate function recently proposed by Parkinson, Cole & Helly by utilizing Smoluchowski's coagulation equation, which must be obeyed by any binary merging…
Inspired by branch-and-bound and cutting plane proofs in mixed-integer optimization and proof complexity, we develop a general approach via Hoffman's Helly systems. This helps to distill the main ideas behind optimality and infeasibility…
In this paper, we explore affine semigroup versions of the convex geometry theorems of Helly, Tverberg, and Caratheodory. Additionally, we develop a new theory of colored affine semigroups, where the semigroup generators each receive a…
Given an $r$-uniform hypergraph $H$ and a positive integer $n$, the weak saturation number $\mathrm{wsat}(n,H)$ is the minimum number of edges in an $r$-uniform hypergraph $F$ on $n$ vertices such that the missing edges in $F$ can be added,…
The present article proposes a rigorous derivation of the Boltzmann equation in the half-space. We show an analog of the Lanford's theorem in this domain, with specular reflection boundary condition, stating the convergence in the low…
Given a graph $T$ and a family of graphs $\mathcal{F}$, the generalized Tur\'an number $\mathrm{ex}(n,T,\mathcal{F})$ is the maximum number of copies of $T$ in an $n$-vertex $\mathcal{F}$-free graph. We prove a general theorem which states…
A celebrated but non-effective theorem of Tibor Gallai states that for any finite set $A$ of $\Z^n$ and for any finite number of colors $c$ there is a minimal $m$ such that no coloring of the finite $m^n$-grid can avoid that a homothetic…
We introduce the definability strength of combinatorial principles. In terms of definability strength, a combinatorial principle is strong if solving a corresponding combinatorial problem could help in simplifying the definition of a…
A colored complete graph is said to be Gallai-colored if it contains no rainbow triangle. This property has been shown to be equivalent to the existence of a partition of the vertices (of every induced subgraph) in which at most two colors…
Hirst investigated a slight variant of Hindman's Finite Sums Theorem -- called Hilbert's Theorem -- and proved it equivalent over $\RCA_0$ to the Infinite Pigeonhole Principle for all colors. This gave the first example of a natural…
We characterize the computational content and the proof-theoretic strength of a Ramsey-type theorem for bi-colorings of so-called {\em exactly large} sets. An {\it exactly large} set is a set $X\subset\Nat$ such that $\card(X)=\min(X)+1$.…
We deal with the combinatorial principle Weak Diamond, showing that we always either a local version is not saturated or we can increase the number of colours. Then we point out a model theoretic consequence of Weak Diamond.
A Gallai-coloring (Gallai-$k$-coloring) is an edge-coloring (with colors from $\{1, 2, \ldots, k\}$) of a complete graph without rainbow triangles. Given a graph $H$ and a positive integer $k$, the $k$-colored Gallai-Ramsey number $GR_k(H)$…
We study combinatorial properties of convex sets over arbitrary valued fields. We demonstrate analogs of some classical results for convex sets over the reals (e.g. the fractional Helly theorem and B\'ar\'any's theorem on points in many…
This letter investigates the application of Haldane's statistical correlation theory in classical systems. A modified statistical correlation theory has been proposed by including non-linearity in the form of an exponent into the original…
We derive sharp upper and lower bounds on the number of intersection points and closed regions that can occur in sets of line segments with certain structure, in terms of the number of segments. We consider sets of segments whose underlying…