English
Related papers

Related papers: A unifying generalization of Sperner's theorem

200 papers

In a capacitated directed graph, it is known that the set of all min-cuts forms a distributive lattice [1], [2]. Here, we describe this lattice as a regular predicate whose forbidden elements can be advanced in constant parallel time after…

Data Structures and Algorithms · Computer Science 2025-12-23 Robert Streit , Vijay K. Garg

The celebrated Stallings' decomposition theorem states that the splitting of a finite index subgroup $H$ of a finitely generated group $G$ as an amalgamated free product or an HNN-extension over a finite group implies the same for $G$. We…

Group Theory · Mathematics 2021-10-12 Mattheus Aguiar , Pavel Zalesski

A collection of families $(\mathcal{F}_{1}, \mathcal{F}_{2} , \cdots , \mathcal{F}_{k}) \in \mathcal{P}([n])^k$ is cross-Sperner if there is no pair $i \not= j$ for which some $F_i \in \mathcal{F}_i$ is comparable to some $F_j \in…

Combinatorics · Mathematics 2023-02-07 Natalie Behague , Akina Kuperus , Natasha Morrison , Ashna Wright

The Pinsker inequality lower bounds the Kullback--Leibler divergence $D_{\textrm{KL}}$ in terms of total variation and provides a canonical way to convert $D_{\textrm{KL}}$ control into $\lVert \cdot \rVert_1$-control. Motivated by…

Information Theory · Computer Science 2026-02-06 Guglielmo Beretta , Tommaso Cesari , Roberto Colomboni

One theorem of Nemhauser and Trotter ensures that, under certain conditions, a stable set of a graph G can be enlarged to a maximum stable set of this graph. For example, any stable set consisting of only simplicial vertices is contained in…

Combinatorics · Mathematics 2007-05-23 Vadim E. Levit , Eugen Mandrescu

We extend Elitzur's theorem to systems with symmetries intermediate between global and local. In general, our theorem formalizes the idea of {\it dimensional reduction}. We apply the results of this generalization to many systems that are…

Statistical Mechanics · Physics 2009-11-10 Cristian D. Batista , Zohar Nussinov

Originally motivated by questions of P. Etingof related to growth rates of tensor powers in symmetric tensor categories, we obtain general bounds on the order of finite subgroups of ${\rm GL}(n,\mathbb{C})$ with restricted composition…

Group Theory · Mathematics 2023-10-03 Geoffrey R. Robinson

In this paper, we obtain sharp estimates for the number of lattice points under and near the dilation of a general parabola, the former generalizing an old result of Popov. We apply Vaaler's lemma and the Erd\H{o}s-Turan inequality to…

Number Theory · Mathematics 2019-10-31 Jing-Jing Huang , Huixi Li

We consider the question of how approximations satisfying Dirichlet's theorem spiral around vectors in $\mathbb{R}^d$. We give pointwise almost everywhere results (using only the Birkhoff ergodic theorem on the space of lattices). In…

Number Theory · Mathematics 2014-11-27 Jayadev S. Athreya , Anish Ghosh , Jimmy Tseng

The exponential growth rate of non polynomially growing subgroups of $GL_d$ is conjectured to admit a uniform lower bound. This is known for non-amenable subgroups, while for amenable subgroups it is known to imply the Lehmer conjecture…

Classical Analysis and ODEs · Mathematics 2022-08-25 Emmanuel Breuillard , Péter P. Varjú

The Minkowski length of a lattice polytope $P$ is a natural generalization of the lattice diameter of $P$. It can be defined as the largest number of lattice segments whose Minkowski sum is contained in $P$. The famous Ehrhart theorem…

Combinatorics · Mathematics 2020-12-22 Ivan Soprunov , Jenya Soprunova

We prove an endpoint version of the Stein-Tomas restriction theorem, for a general class of measures, and with a strengthened Lorentz space estimate. A similar improvement is obtained for Stein's estimate on oscillatory integrals of…

Classical Analysis and ODEs · Mathematics 2015-03-17 Jong-Guk Bak , Andreas Seeger

We introduce a general framework, based on \'etale topological categories, for studying discrete restriction semigroups and their algebras. Generalizing Paterson's universal groupoid of an inverse semigroup, we define the universal category…

Rings and Algebras · Mathematics 2025-11-07 Ganna Kudryavtseva

We prove a counting theorem concerning the number of lattice points for the dual lattices of weakly admissible lattices in an inhomogeneously expanding box, which generalises a counting theorem of Skriganov. The error term is expressed in…

Number Theory · Mathematics 2016-11-09 Niclas Technau , Martin Widmer

We give a poly-time construction for a combinatorial classic known as Sparse Incomparability Lemma, studied by Erdos, Lovasz, Nesetril, Rodl and others: We show that every Constraint Satisfaction Problem is poly-time equivalent to its…

Combinatorics · Mathematics 2013-03-15 Gabor Kun

The chain length of a set family $\mathcal{S} \subseteq 2^{[m]}$ is the largest ascending sequence of sets in containment order in the union-closure of $\mathcal S$. In this work, we provide a significantly simpler and more optimal…

Combinatorics · Mathematics 2026-05-05 Joshua Brakensiek , Venkatesan Guruswami , Aaron Putterman

Let $P$ be a finite point set in $\mathbb{R}^2$ with the set of distance $n$-chains defined as $$ \Delta_n(P)=\{(|p_1-p_2|,|p_2-p_3|,\ldots,|p_n-p_{n+1}|):p_i \in P\}.$$ We show that for $2\leq n=O_{|P|}(1)$ we have $$|\Delta_n(P)|\gtrsim…

Combinatorics · Mathematics 2021-02-09 Jonathan Passant

The paper is devoted to an adaptation of author's approach to Leray theorems in bounded cohomology theory to infinite chains. The main results are a stronger and more general form of Gromov's Vanishing-finiteness theorem and a…

Algebraic Topology · Mathematics 2020-12-17 Nikolai V. Ivanov

The local $SL(2N,C)$ symmetry is shown to provide, when appropriately constrained, a viable framework for a consistent unification of the known elementary forces, including gravity. Such a covariant constraint implies that an actual gauge…

High Energy Physics - Theory · Physics 2024-11-07 J. L. Chkareuli

Von Neumann's original proof of the ergodic theorem is revisited. A uniform convergence rate is established under the assumption that one can control the density of the spectrum of the underlying self-adjoint operator when restricted to…

Dynamical Systems · Mathematics 2020-03-03 Jonathan Ben-Artzi , Baptiste Morisse