English
Related papers

Related papers: The Quantitative Fractional Helly theorem

200 papers

Given a monotonically decreasing $\psi: \mathbb{N} \to [0,\infty)$, Khintchine's Theorem provides an efficient tool to decide whether, for almost every $\alpha \in \mathbb{R}$, there are infinitely many $(p,q) \in \mathbb{Z}^2$ such that…

Number Theory · Mathematics 2024-03-19 Lorenz Frühwirth , Manuel Hauke

A remarkable theorem due to Khovanskii asserts that for any finite subset $A$ of an abelian group, the cardinality of the $h$-fold sumset $hA$ grows like a polynomial for all sufficiently large $h$. Currently, neither the polynomial nor…

Number Theory · Mathematics 2021-12-23 Michael J. Curran , Leo Goldmakher

We deduce a new set of symmetries and relations between the coefficients of the expansion of Abelian and Non-Abelian Fractional Quantum Hall (FQH) states in free (bosonic or fermionic) many-body states. Our rules allow to build an…

Mesoscale and Nanoscale Physics · Physics 2015-05-13 B. Andrei Bernevig , N. Regnault

We prove existence of Helly numbers for crystals and for cut-and-project sets with convex windows. Also we show that for a two-dimensional crystal consisting of $k$ copies of a single lattice the Helly number does not exceed $k+6$.

Metric Geometry · Mathematics 2024-02-14 Alexey Garber

In this paper we draw attention to the fact that the studies by V. G. Kadyshevsky devoted to the creation of the which \emph{\emph{to the geometric quantum field theory with a fundamental mass}} containing non-Hermitian mass extensions. It…

High Energy Physics - Phenomenology · Physics 2016-04-20 V. N. Rodionov , G. A. Kravtsova

Partial multivariate Bell polynomials have been defined by E.T. Bell in 1934. These polynomials have numerous applications in Combinatorics, Analysis, Algebra, Probabilities, etc. Many of the formulae on Bell polynomials involve…

Combinatorics · Mathematics 2016-01-25 Ammar Aboud , Jean-Paul Bultel , Ali Chouria , Jean-Gabriel Luque , Olivier Mallet

We show that the noncontextual inequality proposed by Klyachko et al. [Phys. Rev. Lett. 101, 020403 (2008)] belongs to a broader family of inequalities, one associated to each compatibility structure of a set of events (a graph), and its…

Quantum Physics · Physics 2010-11-17 Adan Cabello , Simone Severini , Andreas Winter

Helly's selection theorem provides a criterion for compactness of sets of single-variable functions with bounded pointwise variation. Fra{\v{n}}kov{\'a} has given a proper extension of Helly's theorem to the setting of single-variable…

Functional Analysis · Mathematics 2023-03-27 Helge Kristian Jenssen

A result of Kaufmann shows that if $L_\alpha$ is countable, admissible and satisfies $\Pi_n\textsf{-Collection}$, then $\langle L_\alpha, \in \rangle$ has a proper $\Sigma_{n+1}$-elementary end extension. This paper investigates to what…

Logic · Mathematics 2022-01-14 Zachiri McKenzie

We construct effective $\mathrm{U}(2)$ Chern-Simons-Ginzburg-Landau theories for Abelian and non-Abelian fractional quantum Hall hierarchies for those which had previously been described only through categorical data or trial wavefunctions.…

Strongly Correlated Electrons · Physics 2026-04-13 Taegon Lee , Gil Young Cho , Donghae Seo

The Shapley-Folkman theorem is a statement about the Minkowski sum of (non-convex) sets, expressing the closeness of the Minkowski sum to convexity in a quantitative manner. This paper establishes similar theorems for integrally convex…

Combinatorics · Mathematics 2024-08-20 Kazuo Murota , Akihisa Tamura

Let X be a normed space. A subset A of X is approximately convex if $d(ta+(1-t)b,A) \le 1$ for all $a,b \in A$ and $t \in [0,1]$ where $d(x,A)$ is the distance of $x$ to $A$. Let $\Co(A)$ be the convex hull and $\diam(A)$ the diameter of…

Functional Analysis · Mathematics 2007-05-23 S. J. Dilworth , Ralph Howard , James W. Roberts

The Union-Closed Sets Conjecture asks whether every union-closed set family $\mathcal{F}$ has an element contained in half of its sets. In 2022, Nagel posed a generalisation of this problem, suggesting that the $k$th-most popular element in…

Combinatorics · Mathematics 2025-07-15 Shagnik Das , Saintan Wu

We show finite-size bounds on the deviation of the optimal type II error from its asymptotic value in the quantum hypothesis testing problem of Stein's lemma with composite null-hypothesis. The proof is based on some simple properties of a…

Quantum Physics · Physics 2014-07-07 Milán Mosonyi

In this short note we show that Helly's Intersection Theorem holds for convex sets in uniquely geodesic spaces (in particular in CAT(0) spaces) without the assumption that the convex sets are open or closed.

Metric Geometry · Mathematics 2014-05-20 Sergei Ivanov

Alexandrov's inequalities imply that for any convex body $A$, the sequence of intrinsic volumes $V_1(A),\ldots,V_n(A)$ is non-increasing (when suitably normalized). Milman's random version of Dvoretzky's theorem shows that a large initial…

Metric Geometry · Mathematics 2017-02-22 Grigoris Paouris , Peter Pivovarov , Petros Valettas

In this work, we introduce a natural notion concerning finite vector spaces. A family of $k$-dimensional subspaces of $\mathbb{F}_q^n$, which forms a partial spread, is called almost affinely disjoint if any $(k+1)$-dimensional subspace…

Combinatorics · Mathematics 2021-06-29 Hedongliang Liu , Nikita Polyanskii , Ilya Vorobyev , Antonia Wachter-Zeh

Set systems with strongly restricted intersections, called $\alpha$-intersecting families for a vector $\alpha$, were introduced recently as a generalization of several well-studied intersecting families including the classical oddtown and…

Combinatorics · Mathematics 2024-04-15 Xin Wei , Xiande Zhang , Gennian Ge

We develop the framework of $\alpha$-largeness introduced by Ketonen and Solovay, by proving a partition theorem for $\alpha$-large sets with $\alpha < \epsilon_0$ which generalizes theorems from Ketonen and Solovay and from Bigorajska and…

Logic · Mathematics 2026-02-10 Quentin Le Houérou , Ludovic Patey

In 1974, Erd\H{o}s and Kleitman conjectured that if a family $\mathcal{F}\subseteq 2^{[n]}$ contains no matching of size \(s\) and is maximal with respect to this property, then $ |\mathcal{F}|\ge \left(1-2^{-(s-1)}\right)\cdot 2^{n}. $ For…

Combinatorics · Mathematics 2026-03-20 Gennian Ge , Jialuo Wang , Zixiang Xu