English
Related papers

Related papers: Exponents in the local properties problem for diff…

200 papers

A set $A$ of natural numbers possesses property $\mathcal{P}_h$, if there are no distinct elements $a_0,a_1,\dots ,a_h\in A$ with $a_0$ dividing the product $a_1a_2\dots a_h$. Erd\H{o}s determined the maximum size of a subset of…

Combinatorics · Mathematics 2020-09-16 Péter Pál Pach , Richárd Palincza

Given a finite point set $P \subset \mathbb{R}^d$, a $k$-ary semi-algebraic relation $E$ on $P$ is the set of $k$-tuples of points in $P$, which is determined by a finite number of polynomial equations and inequalities in $kd$ real…

Combinatorics · Mathematics 2015-10-20 Andrew Suk

Let $k$ and $\ell$ be positive integers. We prove that if $1 \leq \ell \leq o_k(k^{6/5})$, then in every large enough graph $G$, the fraction of $k$-vertex subsets that induce exactly $\ell$ edges is at most $1/e + o_k(1)$. Together with a…

Combinatorics · Mathematics 2021-08-12 Anders Martinsson , Frank Mousset , Andreas Noever , Miloš Trujić

It is generally assumed that {\em local realism} represented by a noncontextual and local hidden-variables model in $d=4$ such as the one used by Bell always gives rise to CHSH inequality $|\langle B\rangle|\leq 2$. On the other hand, the…

Quantum Physics · Physics 2014-10-08 Kazuo Fujikawa , Koichiro Umetsu

In this paper, we consider a high-dimensional quantile regression model where the sparsity structure may differ between two sub-populations. We develop $\ell_1$-penalized estimators of both regression coefficients and the threshold…

Methodology · Statistics 2018-12-07 Sokbae Lee , Yuan Liao , Myung Hwan Seo , Youngki Shin

We prove various results about the Local Converse Problem for split reductive groups $G$ over a non-archimedean local field~$F$ of characteristic $0$ and residual characteristic $p$. In particular, we prove that when $G$ is a symplectic or…

Representation Theory · Mathematics 2025-09-29 Moshe Adrian , Shaun Stevens

While most classical NP-hard graph problems cannot be solved in time $2^{o(n)}$ on general graphs under the Exponential Time Hypothesis (ETH), many exhibit the square-root phenomenon and admit optimal algorithms running in time…

Data Structures and Algorithms · Computer Science 2026-04-30 Malory Marin , Rémi Watrigant

We investigate the relationship between the sizes of the sum and difference sets attached to a subset of {0,1,...,N}, chosen randomly according to a binomial model with parameter p(N), with N^{-1} = o(p(N)). We show that the random subset…

Number Theory · Mathematics 2010-09-15 Peter Hegarty , Steven J. Miller

The two-particle correlation obtained from the quantum state used in the Bell inequality is sinusoidal, but the standard Bell inequality only uses two pairs of settings and not the whole sinusoidal curve. The highest to-date visibility of…

Quantum Physics · Physics 2022-03-16 Marek Zukowski , Dagomir Kaszlikowski , Adam Baturo , Jan-Åke Larsson

Relying on some auxiliary assumptions, usually considered mild, Bell's theorem proves that no local theory can reproduce all the predictions of quantum mechanics. In this work, we introduce a fully local, superdeterministic model that, by…

Quantum Physics · Physics 2020-08-04 G. S. Ciepielewski , E. Okon , D. Sudarsky

The distinct dot products problem, a variant of the Erd\H{o}s distinct distances problem, asks "Given a set $P_n$ of $n$ points in $\mathbb{R}^2$, what is the minimum number $|D(P_n)|$ of distinct dot products they determine?" The best…

Combinatorics · Mathematics 2026-05-28 Anshula Gandhi

The Ramsey number $r_k(s,n)$ is the smallest integer $N$ such that every $N$-vertex $k$-graph contains either a copy of $K_s^{(k)}$ or an independent set of size $n$. A well-known conjecture of Erd\H{o}s and Hajnal states that for any fixed…

Combinatorics · Mathematics 2026-05-12 Chunchao Fan , Mingze Li , Qizhong Lin , Bo Ning

We investigate the length $\ell(n,k)$ of a shortest preset distinguishing sequence (PDS) in the worst case for a $k$-element subset of an $n$-state Mealy automaton. It was mentioned by Sokolovskii that this problem is closely related to the…

Formal Languages and Automata Theory · Computer Science 2014-12-02 Pavel Panteleev

The minimal set of Shannon-type inequalities (referred to as elemental inequalities), plays a central role in determining whether a given inequality is Shannon-type. Often, there arises a situation where one needs to check whether a given…

Information Theory · Computer Science 2017-06-13 Satyajit Thakor , Terence Chan , Alex Grant

Given a finite set of points $S\subset\mathbb{R}^d$, a $k$-set of $S$ is a subset $A \subset S$ of size $k$ which can be strictly separated from $S \setminus A $ by a hyperplane. Similarly, a $k$-facet of a point set $S$ in general position…

Metric Geometry · Mathematics 2022-03-23 Brett Leroux , Luis Rademacher

Let A be an n x n symmetric random matrix whose upper-triangular entries are independent and follow possibly non-identical subgaussian distributions. This paper investigates the spectral properties of A, including its eigenvalues and…

Probability · Mathematics 2026-04-14 Zeyan Song , Hanchao Wang

Given a set of $n$ points in $d$ dimensions, the Euclidean $k$-means problem (resp. the Euclidean $k$-median problem) consists of finding $k$ centers such that the sum of squared distances (resp. sum of distances) from every point to its…

Computational Geometry · Computer Science 2022-11-17 Vincent Cohen-Addad , Kasper Green Larsen , David Saulpic , Chris Schwiegelshohn , Omar Ali Sheikh-Omar

EPR showed that two particles emitted from a source can be entangled by a shared wavefunction where two non-commuting observables (position, momentum) can be simultaneously real, leading to a contradiction with quantum mechanics (two…

Quantum Physics · Physics 2026-03-12 Mafiz Uddin

We derive a new class of correlation Bell-type inequalities. The inequalities are valid for any number of outcomes of two observables per each of n parties, including continuous and unbounded observables. We show that there are no…

Quantum Physics · Physics 2007-11-24 E. G. Cavalcanti , C. J. Foster , M. D. Reid , P. D. Drummond

Motivated by the celebrated Beck-Fiala conjecture, we consider the random setting where there are $n$ elements and $m$ sets and each element lies in $t$ randomly chosen sets. In this setting, Ezra and Lovett showed an $O((t \log t)^{1/2})$…

Data Structures and Algorithms · Computer Science 2018-10-09 Nikhil Bansal , Raghu Meka