English
Related papers

Related papers: Bounds for the local properties problem for differ…

200 papers

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

An orthogonal set of states in multipartite systems is called to be strong quantum nonlocality if it is locally irreducible under every bipartition of the subsystems…

Quantum Physics · Physics 2023-09-13 Mao-Sheng Li , Yan-Ling Wang

Let $G$ be a simple graph. The $k$-th neighborhood of a vertex subset $S \subseteq V(G)$, denoted $\Lambda^k(S)$, is the set of vertices that are adjacent to at least $k$ vertices in $S$. The $k$-th binding number $\beta^k(G)$ is defined as…

Combinatorics · Mathematics 2025-08-27 Guantao Chen , Mikhail Lavrov , Yuying Ma , Jennifer Vandenbussche , Hein van der Holst

Non-locality without inequality is an elegant argument introduced by L. Hardy for two qubit systems, and later generalised to $n$ qubits, to establish contradiction of quantum theory with local realism. Interestingly, for $n=2$ this…

Quantum Physics · Physics 2015-05-19 Sibasish Ghosh , Shasanka Mohan Roy

A finite family $\mathcal F$ of convex sets is $k$-intersecting in $S \subseteq \mathbb{R}^d$ if the intersection of every subset of $k$ convex sets in $\mathcal F$ contains a point in $S$. The Helly number of $S$ is the minimum $k$, if it…

Combinatorics · Mathematics 2025-04-24 Srinivas Arun , Travis Dillon

We derive some new results on the k-th barycentric Olson constants of abelian groups (mainly cyclic). This quantity, for a finite abelian (additive) group (G,+), is defined as the smallest integer l such that each subset A of G with at…

Number Theory · Mathematics 2013-06-20 Oscar Ordaz , Alain Plagne , Wolfgang A. Schmid

We adapt Luk's analysis of the characteristic initial value problem in General Relativity to the asymptotic characteristic problem for the conformal Einstein field equations to demonstrate the local existence of solutions in a neighbourhood…

General Relativity and Quantum Cosmology · Physics 2020-06-25 David Hilditch , Juan A. Valiente Kroon , Peng Zhao

Given a set of points in a metric space, the $(k,z)$-clustering problem consists of finding a set of $k$ points called centers, such that the sum of distances raised to the power of $z$ of every data point to its closest center is…

Data Structures and Algorithms · Computer Science 2022-02-28 Vincent Cohen-Addad , Kasper Green Larsen , David Saulpic , Chris Schwiegelshohn

Kr\'al' and Sgall (2005) introduced a refinement of list colouring where every colour list must be subset to one predetermined palette of colours. We call this $(k,\ell)$-choosability when the palette is of size at most $\ell$ and the lists…

Combinatorics · Mathematics 2017-07-19 Marthe Bonamy , Ross J. Kang

Let $X$ be a set of items of size $n$ that contains some defective items, denoted by $I$, where $I \subseteq X$. In group testing, a {\it test} refers to a subset of items $Q \subset X$. The outcome of a test is $1$ if $Q$ contains at least…

Data Structures and Algorithms · Computer Science 2023-08-16 Nader H. Bshouty

We consider the following Lane-Emden system with Neumann boundary conditions \[ -\Delta u= |v|^{q-1}v \text{ in } \Omega,\qquad -\Delta v= |u|^{p-1}u \text{ in } \Omega,\qquad \partial_\nu u=\partial_\nu v=0 \text{ on } \partial \Omega, \]…

Analysis of PDEs · Mathematics 2024-12-13 Alberto Saldaña , Delia Schiera , Hugo Tavares

For bound states of atoms and molecules of $N$ electrons we consider the corresponding $K$-particle reduced density matrices, $\Gamma^{(K)}$, for $1 \le K \le N-1$. Previously, eigenvalue bounds were obtained in the case of $K=1$ and…

Mathematical Physics · Physics 2024-12-23 Peter Hearnshaw

We consider problems where the input is a set of points in the plane and an integer $k$, and the task is to find a subset $S$ of the input points of size $k$ such that $S$ satisfies some property. We focus on properties that depend only on…

Computational Geometry · Computer Science 2018-08-08 David Eppstein , Daniel Lokshtanov

Suppose $c_1,\ldots,c_{n+k}$ are real numbers, $\{a_1,\ldots,a_{n+k}\}\!\subset\!\mathbb{R}^n$ is a set of points not all lying in the same affine hyperplane, $y\!\in\!\mathbb{R}^n$, $a_j\cdot y$ denotes the standard real inner product of…

Algebraic Geometry · Mathematics 2017-10-31 Jens Forsgård , Mounir Nisse , J. Maurice Rojas

In the study of quantum nonlocality, one obstacle is that the analytical criterion for identifying the boundaries between quantum and postquantum correlations has not yet been given, even in the simplest Bell scenario. We propose a…

Quantum Physics · Physics 2018-05-23 Satoshi Ishizaka

For a graph $G$, we associate a family of real symmetric matrices, $S(G)$, where for any $A\in S(G)$, the location of the nonzero off-diagonal entries of $A$ are governed by the adjacency structure of $G$. Let $q(G)$ be the minimum number…

Combinatorics · Mathematics 2021-10-20 Shaun Fallat , Seyed Ahmad Mojallal

In the setting of generic $\beta$-ensembles, we use the loop equation hierarchy to prove a local law with optimal error up to a constant, valid on any scale including microscopic. This local law has the following consequences. (i) The…

Probability · Mathematics 2022-03-23 Paul Bourgade , Krishnan Mody , Michel Pain

Bell's Theorem requires any theory which obeys the technical definitions of Free Choice and Local Causality to satisfy the Bell inequality. Invariant set theory is a finite theory of quantum physics which violates the Bell inequality…

Quantum Physics · Physics 2019-03-27 T. N. Palmer

The nonlocal properties of the W states are investigated under particle loss. By removing all but two particles from an $N$-qubit W state, the resulting two-qubit state is still entangled. Hence, the W state has high persistency of…

Quantum Physics · Physics 2016-05-20 Péter Diviánszky , Réka Trencsényi , Erika Bene , Tamás Vértesi

Determining the size of a maximum independent set of a graph $G$, denoted by $\alpha(G)$, is an NP-hard problem. Therefore, many attempts are made to find upper and lower bounds, or exact values of $\alpha (G)$ for special classes of…

Combinatorics · Mathematics 2011-03-01 Nazli Besharati , J. Ebrahimi B , A. Azadi