English
Related papers

Related papers: Improved bounds on the Hadwiger-Debrunner numbers

200 papers

Let M(n, d) be the maximum size of a permutation array on n symbols with pairwise Hamming distance at least d. We use various combinatorial, algebraic, and computational methods to improve lower bounds for M(n, d). We compute the Hamming…

Discrete Mathematics · Computer Science 2016-10-03 Sergey Bereg , Avi Levy , I. Hal Sudborough

We address a special case of a conjecture of M. Talagrand relating two notions of "threshold" for an increasing family $\mathcal F$ of subsets of a finite set $V$. The full conjecture implies equivalence of the "Fractional…

Combinatorics · Mathematics 2021-05-25 Keith Frankston , Jeff Kahn , Jinyoung Park

To measure the shape similarity of point sets, various notions of the Hausdorff distance under translation are widely studied. In this context, for an $n$-point set $P$ and $m$-point set $Q$ in $\mathbb{R}^d$, we consider the task of…

Computational Geometry · Computer Science 2026-03-11 Sebastian Angrick , Kevin Buchin , Geri Gokaj , Marvin Künnemann

Let $P$ be the image of a period map. We discuss progress towards a conjectural Hodge theoretic completion $\overline{P}$, an analogue of the Satake-Baily-Borel compactification in the classical case. The set $\overline{P}$ is defined and…

Algebraic Geometry · Mathematics 2023-08-16 Mark Green , Phillip Griffiths , Radu Laza , Colleen Robles

We provide sufficient and necessary conditions guaranteeing equations $(A+B)^*=A^*+B^*$ and $(AB)^*=B^*A^*$ concerning densely defined unbounded operators $A,B$ between Hilbert spaces. We also improve the perturbation theory of selfadjoint…

Functional Analysis · Mathematics 2015-07-31 Zoltán Sebestyén , Zsigmond Tarcsay

In recent years, many connections have been made between minimal codes, a classical object in coding theory, and other remarkable structures in finite geometry and combinatorics. One of the main problems related to minimal codes is to give…

Information Theory · Computer Science 2023-02-13 Martin Scotti

Fix a number field $k$, integers $\ell, n \geq 2$, and a prime $p$. For all $r \geq 1$, we prove strong unconditional upper bounds on the $r$-th moment of $\ell$-torsion in the ideal class groups of degree $p$ extensions of $k$ and of…

Number Theory · Mathematics 2024-12-12 Peter Koymans , Jesse Thorner

For a finite set $A\subset \mathbb{R}$ and real $\lambda$, let $A+\lambda A:=\{a+\lambda b :\, a,b\in A\}$. Combining a structural theorem of Freiman on sets with small doubling constants together with a discrete analogue of…

Combinatorics · Mathematics 2023-06-07 Dmitry Krachun , Fedor Petrov

We prove tight H\"olderian error bounds for all $p$-cones. Surprisingly, the exponents differ in several ways from those that have been previously conjectured; moreover, they illuminate $p$-cones as a curious example of a class of objects…

Optimization and Control · Mathematics 2024-03-29 Scott B. Lindstrom , Bruno F. Lourenço , Ting Kei Pong

Kupavskii proved a codegree version of the Erd\H{o}s--Ko--Rado theorem by showing that for an intersecting family $\mathcal{F} \subseteq \binom{[n]}{k}$ with $n \geq 2k +3d/(1-d/k)$, the minimum $d$-degree of $\mathcal{F}$ is at most…

Combinatorics · Mathematics 2026-05-19 Luyining Gan , Jie Han , Seonghyuk Im

Let $n, d$ be integers with $1 \leq d \leq \left \lfloor \frac{n-1}{2} \right \rfloor$, and set $h(n,d):={n-d \choose 2} + d^2$ and $e(n,d):= \max\{h(n,d),h(n, \left \lfloor \frac{n-1}{2} \right \rfloor)\}$. Because $h(n,d)$ is quadratic in…

Combinatorics · Mathematics 2017-04-07 Zoltán Füredi , Alexandr Kostochka , Ruth Luo

We prove existence of solutions $(\phi,\lambda)$ of a family of of Feigenbaum-like equations \label{family} \phi(x)={1+\eps \over \lambda} \phi(\phi(\lambda x)) -\eps x +\tau(x), where $\eps$ is a small real number and $\tau$ is analytic…

Dynamical Systems · Mathematics 2010-09-28 Denis Gaidashev

For any two configurations of ordered points $p=(p_{1},...,\p_{N})$ and $q=(q_{1},...,q_{N})$ in Euclidean space $E^d$ such that $q$ is an expansion of $p$, there exists a continuous expansion from $p$ to $q$ in dimension 2d; Bezdek and…

Metric Geometry · Mathematics 2011-07-04 Holun Cheng , Ser Peow Tan , Yidan Zheng

We establish a lower bound theorem for the number of $k$-faces ($1\le k\le d-2$) in a $d$-dimensional polytope $P$ (abbreviated as a $d$-polytope) with $2d+2$ vertices, extending the previously known case for $k=1$. We identify all…

Combinatorics · Mathematics 2025-12-10 Guillermo Pineda-Villavicencio , Aholiab Tritama , Jie Wang , David Yost

We prove a quantitative distortion theorem for iterated function systems that generate sets of continued fractions. As a consequence, we obtain upper and lower bounds on the Hausdorff dimension of any set of real or complex continued…

Number Theory · Mathematics 2020-02-25 Daniel Ingebretson

We consider a system of polynomials $T_{s}(z,q)\in\mathbb{Z}[z,q]$ which appear as truncations of the K-theoretic vertex function for the cotangent bundles over Grassmannians $T^{*}Gr(k,n)$. We prove that these polynomials satisfy a natural…

Number Theory · Mathematics 2025-05-08 Pavan Kartik , Andrey Smirnov

Hadwiger's conjecture in convex geometry, formulated in 1957, states that every convex body in $\mathbb{R}^n$ can be covered by $2^n$ translations of its interior. Despite significant efforts, the best known bound related to this problem…

Metric Geometry · Mathematics 2024-10-16 Daniel Galicer , Joaquín Singer

Let $G$ be a simple graph and let $p$ and $q$ be two integer-valued functions on $V(G)$ with $p< q$ in which for each $v\in V(G)$, $q(v) \ge \frac{1}{2}d_G(v)$ and $p(v) \ge \frac{1}{2} q(v)-2$. In this note, we show that $G$ has an…

Combinatorics · Mathematics 2022-05-24 Morteza Hasanvand

For $n,\,d\ge1$ let $p(n,2d)$ denote the smallest number $p$ such that every sum of squares of forms of degree $d$ in $\mathbb{R}[x_1,\dots,x_n]$ is a sum of $p$ squares. We establish lower bounds for these numbers that are considerably…

Algebraic Geometry · Mathematics 2016-03-18 Claus Scheiderer

The Erd\H{o}s-Ginzburg-Ziv constant of an abelian group $G$, denoted $\mathfrak{s}(G)$, is the smallest $k\in\mathbb{N}$ such that any sequence of elements of $G$ of length $k$ contains a zero-sum subsequence of length $\exp(G)$. In this…

Combinatorics · Mathematics 2023-03-13 Eric Naslund