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

It is found that, in addition to the conventional ones, a local approach to the relativistic quantum field theories at both zero and finite density consistent with the violation of Bell like inequalities should contain, and provide…

Let $G$ be an additive group of order $v$. A $k$-element subset $D$ of $G$ is called a $(v, k, \lambda, t)$-almost difference set if the expressions $gh^{-1}$, for $g$ and $h$ in $D$, represent $t$ of the non-identity elements in $G$…

Let $S$ be a noncompact, finite area hyperbolic surface of type $(g, n)$. Let $\Delta_S$ denote the Laplace operator on $S$. As $S$ varies over the {\it moduli space} ${\mathcal{M}_{g, n}}$ of finite area hyperbolic surfaces of type $(g,…

Based on a result of Makeev, in 2012 Blagojevi\'c and Karasev proposed the following problem: given any positive integers $m$ and $1\leq \ell\leq k$, find the minimum dimension $d=\Delta(m;\ell/k)$ such that for any $m$ mass distributions…

By implicitly assuming that all measurements occur simultaneously, Bell's Theorem only applied to local theories that violated Heisenberg's Uncertainty Principle. By explicitly introducing time into our derivation of Bell's theorem, an…

In this paper, we prove that the Morley element eigenvalues approximate the exact ones from below on regular meshes, including adaptive local refined meshes, for the fourth-order elliptic eigenvalue problems with the clamped boundary…

In this paper, we are concerned with the local well-posedness of the initial-boundary value problem for complex Ginzburg-Landau (CGL) equations in bounded domains. There are many studies for the case where the real part of its nonlinear…

For a finite abelian group $G$ written additively, and a non-empty subset $A\subset [1,\exp(G)-1]$ the weighted Davenport Constant of $G$ with respect to the set $A$, denoted $D_A(G)$, is the least positive integer $k$ for which the…

We introduce the nonlocal analogue of the classical free boundary minimal hypersurfaces in an open domain $\Omega$ of $\mathbb{R}^n$ as the (boundaries of) critical points of the fractional perimeter $\operatorname{Per}_s(\cdot,\,\Omega )$…

The classical Andr\'{a}sfai--Erd\H{o}s--S\'{o}s Theorem states that for $\ell\ge 2$, every $n$-vertex $K_{\ell+1}$-free graph with minimum degree greater than $\frac{3\ell-4}{3\ell-1}n$ must be $\ell$-partite. We establish a simple…

We consider a minimizing variant of the well-known \emph{No-Three-In-Line Problem}, the \emph{Geometric Dominating Set Problem}: What is the smallest number of points in an $n\times n$~grid such that every grid point lies on a common line…

By filtering out the philosophic component we can be said that the EPR-paper was directed against the straightforward interpretation of the Heisenberg's uncertainty principle or more generally the Bohr's complementarity principle. The…

Nonlocality is the most characteristic feature of quantum mechanics. John Bell, in his seminal 1964 work, proved that local-realism imposes a bound on the correlations among the measurement statistics of distant observers. Surpassing this…

Let $K$ be an algebraically closed field of characteristic $2$, $G$ be the algebraic group $\mathrm{SL}_2$ over $K$, and $V$ be the natural representation of $G$. Let $b_k^{G,V}$ denote the number of $G$-indecomposable factors of…

We prove that each eigenvalue l(k) of the Kirchhoff Laplacian K of a graph or quiver is bounded above by d(k)+d(k-1) for all k in {1,...,n}. Here l(1),...,l(n) is a non-decreasing list of the eigenvalues of K and d(1),..,d(n) is a…

According to Bell's theorem, any model based on local variables cannot reproduce certain quantum correlations. A critical question is whether one could devise an alternative framework, based on nonlocal variables, to reproduce quantum…

Results are obtained for two minimization problems: $$I_k(c)=\inf \{\lambda_k(\Omega): \Omega\ \textup{open, convex in}\ \mathbb{R}^m,\ \mathcal{T}(\Omega)= c \},$$ and $$J_k(c)=\inf\{\lambda_k(\Omega): \Omega\ \textup{quasi-open in}\…

From gravity to electromagnetism, apparent action at a distance has always been resolved by deeper, local explanations. Yet today, Bell's theorem is widely interpreted as the death knell for local reality. In this chapter, I present the…

An identifying code is a subset of vertices of a graph such that each vertex is uniquely determined by its neighbourhood within the identifying code. If $\M(G)$ denotes the minimum size of an identifying code of a graph $G$, it was…

We consider the quantum query complexity of local search as a function of graph geometry. Given a graph $G = (V,E)$ with $n$ vertices and black box access to a function $f : V \to \mathbb{R}$, the goal is find a vertex $v$ that is a local…