English
Related papers

Related papers: A fractional Helly theorem for boxes

200 papers

We prove that for every irrational number $\alpha$, real number $\beta$, real number $c$ satisfying $1<c<9/8$ and positive real number $\theta$ satisfying $\theta<(9/c-8)/10$, there exist infinitely many primes of the form…

Number Theory · Mathematics 2025-09-16 Stephan Baier , Habibur Rahaman

Helly graphs are graphs in which every family of pairwise intersecting balls has a non-empty intersection. This is a classical and widely studied class of graphs. In this article we focus on groups acting geometrically on Helly graphs --…

Group Theory · Mathematics 2025-01-08 Jérémie Chalopin , Victor Chepoi , Anthony Genevois , Hiroshi Hirai , Damian Osajda

We prove transcendence of the Hecke-Mahler series $\sum_{n=0}^\infty f(\lfloor n\theta+\alpha \rfloor) \beta^{-n}$, where $f(x) \in \mathbb{Z}[x]$ is a non-constant polynomial $\alpha$ is a real number, $\theta$ is an irrational real…

Number Theory · Mathematics 2024-12-19 Florian Luca , Joel Ouaknine , James Worrell

In this paper we consider fractional quasi-Bessel equations $$\sum_{i=1}^{m}d_i x^{\alpha_i+p_i}D^{\alpha_i} u(x) + (x^\beta - \nu^2)u(x)=0$$ and construct their existence and uniqueness theory in the class of fractional series. Our…

Analysis of PDEs · Mathematics 2022-01-26 Pavel B. Dubovski , Jeffrey A. Slepoi

Let $\mathcal{A}=\{A_{1},...,A_{p}\}$ and $\mathcal{B}=\{B_{1},...,B_{q}\}$ be two families of subsets of $[n]$ such that for every $i\in [p]$ and $j\in [q]$, $|A_{i}\cap B_{j}|= \frac{c}{d}|B_{j}|$, where $\frac{c}{d}\in [0,1]$ is an…

Combinatorics · Mathematics 2019-03-06 Rogers Mathew , Ritabrata Ray , Shashank Srivastava

Given a finite set $X$ of points in $R^n$ and a family $F$ of sets generated by the pairs of points of $X$, we determine volumetric and structural conditions for the sets that allow us to guarantee the existence of a positive-fraction…

Metric Geometry · Mathematics 2016-08-22 Alexander Magazinov , Pablo Soberón

Dvir and Moran proved the following upper bound for the size of a family $\mbox{$\cal F$}$ of subsets of $[n]$ with $\mbox{Vdim}(\mbox{$\cal F$} \Delta \mbox{$\cal F$})\leq d$. Let $d\leq n$ be integers. Let $\mbox{$\cal F$}$ be a family of…

Combinatorics · Mathematics 2021-05-11 Gábor Hegedüs

We show that if A is a large subset of a box in Z^d with dimensions L_1 >= L_2 >= ... >= L_d which are all reasonably large, then |A + A| > 2^{d/48}|A|. By combining this with Chang's quantitative version of Freiman's theorem, we prove a…

Number Theory · Mathematics 2007-05-23 Ben Green

In this paper, we investigate Erd\H os--Ko--Rado type theorems for families of vectors from $\{0,\pm 1\}^n$ with fixed numbers of $+1$'s and $-1$'s. Scalar product plays the role of intersection size. In particular, we sharpen our earlier…

Combinatorics · Mathematics 2020-04-21 Peter Frankl , Andrey Kupavskii

Let $\lfloor t\rfloor$ denote the integer part of $t\in\mathbb{R}$ and $\|x\|$ the distance from $x$ to the nearest integer. Suppose that $1/2<\gamma_2<\gamma_1<1$ are two fixed constants. In this paper, it is proved that, whenever $\alpha$…

Number Theory · Mathematics 2026-05-05 Junyi Chu , Jinjiang Li , Min Zhang

In this paper we present a combinatorial generalization of the fact that the number of plane partitions that fit in a $2a\times b\times b$ box is equal to the number of such plane partitions that are symmetric, times the number of such…

Combinatorics · Mathematics 2017-02-13 Mihai Ciucu , Christian Krattenthaler

Analytical expressions are derived for the number of fractions with equal numerators in the Farey sequence of order $n$, $F_n$, and in the truncated Farey sequence $F_n^{1/k}$ containing all Farey fractions below $1/k$, with $1\leq k \leq…

Number Theory · Mathematics 2024-07-16 Rogelio Tomas Garcia

In this short note, we provide the necessary and sufficient condition for an infinite collection of axis-parallel boxes in $\mathbb{R}^{d}$ to be pierceable by finitely many axis-parallel $k$-flats, where $0 \leq k < d$. We also consider…

Combinatorics · Mathematics 2024-12-13 Sutanoya Chakraborty , Arijit Ghosh , Soumi Nandi

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

Let $\mathbb{D}$ be a division ring and $\mathbb{F}$ be a subfield of the center of $\mathbb{D}$ over which $\mathbb{D}$ has finite dimension $d$. Let $n,p,r$ be positive integers and $\mathcal{V}$ be an affine subspace of the…

Rings and Algebras · Mathematics 2015-04-09 Clément de Seguins Pazzis

Let $\mathcal F\subset 2^{[n]}$ be a family in which any three sets have non-empty intersection and any two sets have at least $38$ elements in common. The nearly best possible bound $|\mathcal F|\le 2^{n-2}$ is proved. We believe that $38$…

Combinatorics · Mathematics 2018-08-06 Peter Frankl , Andrey Kupavskii

An intersecting family of sets is trivial if all of its members share a common element. Hilton and Milner proved a strong stability result for the celebrated Erd\H{o}s--Ko--Rado theorem: when $n> 2k$, every non-trivial intersecting family…

Combinatorics · Mathematics 2017-05-30 Peter Frankl , Jie Han , Hao Huang , Yi Zhao

For $\varepsilon\in(0,1/2)$ and a natural number $d\ge 2$, let $N$ be a natural number with \[ N \,\ge\, 2^9\,\log_2(d)\, \left(\frac{\log_2(1/\varepsilon)}{\varepsilon}\right)^2. \] We prove that there is a set of $N$ points in the unit…

Classical Analysis and ODEs · Mathematics 2019-08-15 Mario Ullrich , Jan Vybíral

We call $(a_1, \dots, a_n)$ an \emph{$r$-partial sequence} if exactly $r$ of its entries are positive integers and the rest are all zero. For ${\bf c} = (c_1, \dots, c_n)$ with $1 \leq c_1 \leq \dots \leq c_n$, let $S_{\bf c}^{(r)}$ be the…

Combinatorics · Mathematics 2014-01-20 Peter Borg

A family $\mathcal{F}$ of $k$-subsets of an $n$-set is called $s$-almost $t$-intersecting if each member is $t$-disjoint with at most $s$ members. In this paper, we prove that, if $\left|\mathcal{F}\right|$ is maximum, then $\mathcal{F}$…

Combinatorics · Mathematics 2026-01-13 Dehai Liu , Kaishun Wang , Tian Yao