English
Related papers

Related papers: Uniform Lower Bound for Intersection Numbers of $\…

200 papers

We consider the well-studied problem of learning intersections of halfspaces under the Gaussian distribution in the challenging \emph{agnostic learning} model. Recent work of Diakonikolas et al. (2021) shows that any Statistical Query (SQ)…

Machine Learning · Computer Science 2022-02-11 Daniel Hsu , Clayton Sanford , Rocco Servedio , Emmanouil-Vasileios Vlatakis-Gkaragkounis

We study a local thinning $T_r$ that retains a point with probability $p(n_r)$, where $n_r$ counts neighbors within radius $r$. For Poisson input with spatially varying intensity, we obtain an exact intensity via a Poisson--mixture formula…

Probability · Mathematics 2025-11-14 Kateryna Hlyniana

Let $(\{1,2,\ldots,n\},d)$ be a metric space. We analyze the expected value and the variance of $\sum_{i=1}^{\lfloor n/2\rfloor}\,d({\boldsymbol{\pi}}(2i-1),{\boldsymbol{\pi}}(2i))$ for a uniformly random permutation ${\boldsymbol{\pi}}$ of…

Data Structures and Algorithms · Computer Science 2017-03-27 Ching-Lueh Chang

In this paper we consider the problem of uniformity testing with limited memory. We observe a sequence of independent identically distributed random variables drawn from a distribution $p$ over $[n]$, which is either uniform or is…

Information Theory · Computer Science 2022-06-22 Tomer Berg , Or Ordentlich , Ofer Shayevitz

We consider the limiting behavior of the count of subgraphs isomorphic to a graph $G$ with $m\geq 0$ fixed endpoints (or roots) in the random-connection model, as the intensity $\lambda$ of the underlying Poisson point process tends to…

Probability · Mathematics 2025-11-11 Qingwei Liu , Nicolas Privault

We study an approximate version of $q$-query LDCs (Locally Decodable Codes) over the real numbers and prove lower bounds on the encoding length of such codes. A $q$-query $(\alpha,\delta)$-approximate LDC is a set $V$ of $n$ points in…

Computational Complexity · Computer Science 2014-02-28 Jop Briët , Zeev Dvir , Guangda Hu , Shubhangi Saraf

Let $G$ be a finite, connected metric graph and let $X\subseteq G$ be a subset. If $X$ is sufficiently dense in $G$, we show that the Gromov--Hausdorff distance matches the Hausdorff distance, namely $d_\gh(G,X)=d_\h(G,X)$. When the metric…

Metric Geometry · Mathematics 2025-12-24 Henry Adams , Sushovan Majhi , Fedor Manin , Žiga Virk , Nicolò Zava

The classical Crossing Lemma by Ajtai et al.~and Leighton from 1982 gave an important lower bound of $c \frac{m^3}{n^2}$ for the number of crossings in any drawing of a given graph of $n$ vertices and $m$ edges. The original value was $c=…

Combinatorics · Mathematics 2024-09-06 Aaron Büngener , Michael Kaufmann

We develop a practical and novel method for inference on intersection bounds, namely bounds defined by either the infimum or supremum of a parametric or nonparametric function, or equivalently, the value of a linear programming problem with…

Statistics Theory · Mathematics 2013-05-06 Victor Chernozhukov , Sokbae Lee , Adam M. Rosen

The goal of this paper is to generalize, refine, and improve results on large intersections. We show that if $G$ is a countable abelian group and $\varphi, \psi : G \to G$ are homomorphisms such that at least two of the three subgroups…

Dynamical Systems · Mathematics 2023-02-28 Ethan Ackelsberg , Vitaly Bergelson , Or Shalom

Let $S_{\rm div}(n)$ denote the set of permutations $\pi$ of $n$ such that for each $1\leq j \leq n$ either $j \mid \pi(j)$ or $\pi(j) \mid j$. These permutations can also be viewed as vertex-disjoint directed cycle covers of the divisor…

Number Theory · Mathematics 2022-09-29 Nathan McNew

Let $(u_n)_{n \geq 0}$ be a non-degenerate Lucas sequence, given by the relation $u_n=a_1 u_{n-1}+a_2 u_{n-2}$. Let $\ell_u(m)=lcm(m, z_u(m))$, for $(m,a_2)=1$, where $z_u(m)$ is the rank of appearance of $m$ in $u_n$. We prove that…

Number Theory · Mathematics 2019-01-08 Daniele Mastrostefano

We show the existence of $(\epsilon,n)$-complements for $(\epsilon,\mathbb{R})$-complementary surface pairs when the coefficients of boundaries belong to a DCC set.

Algebraic Geometry · Mathematics 2020-05-19 Guodu Chen , Jingjun Han

In this paper we study relations between intersection numbers on moduli spaces of curves and Hurwitz numbers. First, we prove two formulas expressing Hurwitz numbers of (generalized) polynomials via intersections on moduli spaces of curves.…

Algebraic Geometry · Mathematics 2010-10-04 Sergei Shadrin

Let $\mathcal F\subset 2^{[n]}$ be an $s$-uniform family such that every two distinct sets have a nonempty intersection but intersect in at most $k$ elements. By the well-known Ray-Chaudhuri--Wilson theorem, since the intersections can take…

Combinatorics · Mathematics 2026-05-26 Kristina Ago , Gyula O. H. Katona

We find many examples of compact Riemannian manifolds $(M,g)$ whose closed minimal hypersurfaces satisfy a lower bound on their index that is linear in their first Betti number. Moreover, we show that these bounds remain valid when the…

Differential Geometry · Mathematics 2018-03-26 Claudio Gorodski , Ricardo A. E. Mendes , Marco Radeschi

We consider the configuration model and the uniform simple graph with given degree sequence $\boldsymbol{d}=\left(d_i\right)_{i=1}^n$. We derive quantitative bounds for the errors in (i) joint normal-Poisson approximation to the numbers of…

Probability · Mathematics 2026-05-29 Ryo Imai

Suppose that $M$ is a compact Riemannian manifold with boundary and $u$ is an $L^2$-normalized Dirichlet eigenfunction with eigenvalue $\lambda$. Let $\psi$ be its normal derivative at the boundary. Scaling considerations lead one to expect…

Analysis of PDEs · Mathematics 2007-05-23 Andrew Hassell , Terence Tao

Let $n$ be a positive integer and $\xi$ a transcendental real number. We are interested in bounding from above the uniform exponent of polynomial approximation $\widehat{\omega}_n(\xi)$. Davenport and Schmidt's original 1969 inequality…

Number Theory · Mathematics 2024-05-14 Anthony Poëls

Let $P$ be a set of $n$ points in $\mathbb{R}^d$, in general position. We remove all of them one by one, in each step erasing one vertex of the convex hull of the current remaining set. Let $g_d(P)$ denote the number of different removal…

Combinatorics · Mathematics 2024-11-15 Dániel Gábor Simon