惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

大猫的无限游戏
大猫的无限游戏
H
Hackread – Cybersecurity News, Data Breaches, AI and More
博客园_首页
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
D
Docker
酷 壳 – CoolShell
酷 壳 – CoolShell
宝玉的分享
宝玉的分享
Martin Fowler
Martin Fowler
美团技术团队
量子位
M
MIT News - Artificial intelligence
Apple Machine Learning Research
Apple Machine Learning Research
阮一峰的网络日志
阮一峰的网络日志
博客园 - 叶小钗
博客园 - 三生石上(FineUI控件)
腾讯CDC
Hugging Face - Blog
Hugging Face - Blog
博客园 - 【当耐特】
小众软件
小众软件
博客园 - 司徒正美
罗磊的独立博客
云风的 BLOG
云风的 BLOG
B
Blog RSS Feed
博客园 - 聂微东

math.CO updates on arXiv.org

Complement Submodular Information Measures for Balanced and Robust Data Selection A Proof of a Conjecture on Positive and Negative Square Energies of Unicyclic Graphs Laplacian Spectrum of the Weakly Zero-Divisor Graph of a Finite Commutative Ring An identity for second Eulerian numbers via lattice-point counting $t$-tone edge coloring of graphs Constructing Maximal Bumpless Pipedreams for Double Grothendieck Polynomials Mubayi's Polynomial-Ideal Conjecture and Cover-Ideal Turán Methods Implicit Binarization via Complex Phase Dynamics in Combinatorial Optimization The limits of Schur multipliers in Pólya conversion problems for the $q$-permanent function Universality theorems for generalized splines Framing Triangulations for Arbitrary Integer Flow Polytopes On the Common Generalization of Gentle Algebras and Framed Directed Acyclic Graphs The complexity of frugal digraph homomorphisms Chaotic and periodic behavior of jeu de taquin on infinite Young tableaux Enumerating Pattern Avoiding Parking Functions Incidence toric ideals and three-point functions Unique Winning Opening Move in Three-Row Chomp Strong majority colorings of graphs A Balancing Theorem for Spanning Trees of Rectangular Grid Graphs Spectral radius and edge-disjoint connected factors of graphs New invariants for rank metric codes, with applications to the classification of rank two semifields of order 256 Flexible DP-4-coloring of planar graphs without 4-cycles and intersecting triangles Balanced intersection size distributions in projective planes List Reconstruction Problem with List Size Two Is Dimensionality a Barrier for Retrieval Models? The INIEP: Irreducible and Positive Realizations The number of Pfaffian orientations on punctured polygonally cellulated surfaces Explicit Construction of Polytopes whose Ehrhart Polynomials Realize any Given Sign Pattern Finite-state enumeration of adjacency-constrained 132-avoiding permutations AMDS and quantum AMDS Constacyclic codes of length $4p^ς$ over $\mathbb{F}_{{p}^{m}}$
The fractional Helly number for separable convexity spaces
[Submitted on 2 Dec 2024 (v1), last revised 19 Jul 2026 (this ve · 2024-12-02 · via math.CO updates on arXiv.org

View PDF HTML (experimental)

Abstract:A convex lattice set in $\mathbb{Z}^d$ is the intersection of a convex set in $\mathbb{R}^d$ with the integer lattice $\mathbb{Z}^d$. A classical theorem of Doignon states that the Helly number of $d$-dimensional convex lattice sets equals $2^d$, exponentially larger than the Helly number $d+1$ of ordinary convex sets in $\mathbb{R}^d$. By contrast, a remarkable theorem of Bárány and Matousek states that the fractional Helly number of convex lattice sets drops back down to $d+1$, matching the classical fractional Helly theorem of Katchalski and Liu. In this paper we generalize the Bárány--Matousek theorem to abstract convexity spaces (in the sense of van de Vel) that satisfy a suitable separation axiom. Our main result implies the following: if a separable convexity space has Radon number at most $r$, then its fractional Helly number is at most $2^{r}$. This bound is nearly tight, as illustrated by the case of box convexity in $\mathbb{R}^d$, whose Radon number is $\Theta(\log d)$ and fractional Helly number equals $d+1$.

Submission history

From: Andreas Holmsen [view email]
[v1] Mon, 2 Dec 2024 12:34:43 UTC (14 KB)
[v2] Fri, 6 Dec 2024 15:40:45 UTC (13 KB)
[v3] Tue, 18 Feb 2025 09:41:51 UTC (13 KB)
[v4] Sun, 19 Jul 2026 01:53:27 UTC (16 KB)