English
Related papers

Related papers: On the Gap between Hereditary Discrepancy and the …

200 papers

In this paper, we show a new upper bound of prime gaps, that is the gap between a prime number and its consecutive prime number. We show that the gap between a prime number $p_n$ and its consecutive prime number is not larger than…

Number Theory · Mathematics 2026-05-22 Cheng-TIng Wang

We introduce a definition of thickness in $\mathbb{R}^d$ and obtain a lower bound for the Hausdorff dimension of the intersection of finitely or countably many thick compact sets using a variant of Schmidt's game. As an application we prove…

Classical Analysis and ODEs · Mathematics 2026-01-26 Kenneth Falconer , Alexia Yavicoli

A collection of families $(\mathcal{F}_{1}, \mathcal{F}_{2} , \cdots , \mathcal{F}_{k}) \in \mathcal{P}([n])^k$ is cross-Sperner if there is no pair $i \not= j$ for which some $F_i \in \mathcal{F}_i$ is comparable to some $F_j \in…

Combinatorics · Mathematics 2023-02-07 Natalie Behague , Akina Kuperus , Natasha Morrison , Ashna Wright

A common way to quantify the ,,distance'' between measures is via their discrepancy, also known as maximum mean discrepancy (MMD). Discrepancies are related to Sinkhorn divergences $S_\varepsilon$ with appropriate cost functions as…

Optimization and Control · Mathematics 2020-08-25 Sebastian Neumayer , Gabriele Steidl

Cai and Hemachandra used iterative constant-setting to prove that Few $\subseteq$ $\oplus$P (and thus that FewP $\subseteq$ $\oplus$P). In this paper, we note that there is a tension between the nondeterministic ambiguity of the class one…

Computational Complexity · Computer Science 2024-02-12 Lane A. Hemaspaandra , Mandar Juvekar , Arian Nadjimzadah , Patrick A. Phillips

We present a detailed study of estimation errors in terms of surrogate loss estimation errors. We refer to such guarantees as $\mathscr{H}$-consistency estimation error bounds, since they account for the hypothesis set $\mathscr{H}$…

Machine Learning · Computer Science 2022-05-18 Pranjal Awasthi , Anqi Mao , Mehryar Mohri , Yutao Zhong

We provide probabilistic lower bounds for the star discrepancy of Latin hypercube samples. These bounds are sharp in the sense that they match the recent probabilistic upper bounds for the star discrepancy of Latin hypercube samples proved…

Numerical Analysis · Mathematics 2021-09-21 Benjamin Doerr , Carola Doerr , Michael Gnewuch

A famous conjecture of Graham asserts that every set $A \subseteq \mathbb{Z}_p \setminus \{0\}$ can be ordered so that all partial sums are distinct. Although this conjecture was recently proved for sufficiently large primes by Pham and…

Combinatorics · Mathematics 2026-02-24 Simone Costa , Stefano Della Fiore

We consider the longest common subsequence problem in the context of subsequences with gap constraints. In particular, following Day et al. 2022, we consider the setting when the distance (i. e., the gap) between two consecutive symbols of…

Data Structures and Algorithms · Computer Science 2023-06-05 Duncan Adamson , Maria Kosche , Tore Koß , Florin Manea , Stefan Siemer

The P\'osa-Seymour conjecture asserts that every graph on $n$ vertices with minimum degree at least $(1 - 1/(r+1))n$ contains the $r^{th}$ power of a Hamilton cycle. Koml\'os, S\'ark\"ozy and Szemer\'edi famously proved the conjecture for…

Combinatorics · Mathematics 2022-08-29 Domagoj Bradač

Let $La(n,P)$ be the maximum size of a family of subsets of $[n]=\{1,2,...,n\}$ not containing $P$ as a (weak) subposet. The diamond poset, denoted $B_{2}$, is defined on four elements $x,y,z,w$ with the relations $x<y,z$ and $y,z<w$.…

Combinatorics · Mathematics 2017-11-27 Dániel Grósz , Abhishek Methuku , Casey Tompkins

Robustness of deep neural networks against adversarial perturbations is a pressing concern motivated by recent findings showing the pervasive nature of such vulnerabilities. One method of characterizing the robustness of a neural network…

Machine Learning · Statistics 2021-03-15 Hisham Husain , Borja Balle

In nonadaptive group testing, the main research objective is to design an efficient algorithm to identify a set of up to $t$ positive elements among $n$ samples with as few tests as possible. Disjunct matrices and separable matrices are two…

Combinatorics · Mathematics 2021-10-15 Bingchen Qian , Xin Wang , Gennian Ge

We bound the variance and other moments of a random vector based on the range of its realizations, thus generalizing inequalities of Popoviciu (1935) and Bhatia and Davis (2000) concerning measures on the line to several dimensions. This is…

Probability · Mathematics 2020-02-03 Tongseok Lim , Robert J. McCann

Let $\mbox{$\cal F$}\subseteq 2^{[n]}$ be a fixed family of subsets. Let $D(\mbox{$\cal F$})$ stand for the following set of Hamming distances: $$ D(\mbox{$\cal F$}):=\{d_H(F,G):~ F, G\in \mbox{$\cal F$},\ F\neq G\}. $$ $\mbox{$\cal F$}$ is…

Combinatorics · Mathematics 2023-05-02 Gábor Hegedüs

We show that for any union-closed family $\mathcal{F} \subseteq 2^{[n]}, \mathcal{F} \neq \{\emptyset\}$, there exists an $i \in [n]$ which is contained in a $0.01$ fraction of the sets in $\mathcal{F}$. This is the first known constant…

Combinatorics · Mathematics 2022-11-29 Justin Gilmer

This paper is concerned with the hard thresholding operator which sets all but the $k$ largest absolute elements of a vector to zero. We establish a {\em tight} bound to quantitatively characterize the deviation of the thresholded solution…

Machine Learning · Statistics 2020-08-12 Jie Shen , Ping Li

Vacuum stability implies a lower limit on the mass of the higgs boson in the Standard Model (SM). In contrast, an upper limit on the lightest higgs mass can be calculated in supersymmetric (susy) models. The main uncertainty in each limit…

High Energy Physics - Phenomenology · Physics 2015-06-25 Marco A. Diaz , Tonnis A. ter Veldhuis , Thomas J. Weiler

The aim of this paper is to study the matrix discrepancy problem. Assume that $\xi_1,\ldots,\xi_n$ are independent scalar random variables with finite support and $\mathbf{u}_1,\ldots,\mathbf{u}_n\in \mathbb{C}^d$. Let $\mathcal{C}_0$ be…

Combinatorics · Mathematics 2021-05-25 Jiaxin Xie , Zhiqiang Xu , Ziheng Zhu

Suppose that we have $n$ agents and $n$ items which lie in a shared metric space. We would like to match the agents to items such that the total distance from agents to their matched items is as small as possible. However, instead of having…

Computer Science and Game Theory · Computer Science 2023-05-23 Nima Anari , Moses Charikar , Prasanna Ramakrishnan
‹ Prev 1 4 5 6 7 8 10 Next ›