相关论文: Bounds for the local properties problem for differ…

A standard approach in the foundations of quantum mechanics studies local realism and hidden variables models exclusively in terms of violations of Bell-like inequalities. Thus quantum nonlocality is tied to the celebrated no-go theorems,…

We state and prove estimates for the local boundedness of subsolutions of non-local, possibly degenerate, parabolic integro-differential equations of the form \begin{equation*} \partial_tu(x,t)+\mbox{P.V.}\int\limits_{\mathbb R^n}K(x,y,t)…

We study the problem of estimating the number of edges in an unknown graph. We consider a hybrid model in which an algorithm may issue independent set, degree, and neighbor queries. We show that this model admits strictly more efficient…

The classical center based clustering problems such as $k$-means/median/center assume that the optimal clusters satisfy the locality property that the points in the same cluster are close to each other. A number of clustering problems arise…

In this paper we look at a particular problem related to under-determined linear systems of equations with sparse solutions. $\ell_1$-minimization is a fairly successful polynomial technique that can in certain statistical scenarios find…

Given a subset S of R^n, let c(S,k) be the smallest number t such that whenever finitely many convex sets have exactly k common points in S, there exist at most t of these sets that already have exactly k common points in S. For S = Z^n,…

This paper deals with the eigenvalue problem for the operator $L=-\Delta -x\cdot \nabla $ with Dirichlet boundary conditions. We are interested in proving the existence of a set minimizing any eigenvalue $\lambda_k$ of $L$ under a suitable…

In this paper we present three different results dealing with the number of $(\leq k)$-facets of a set of points: 1. We give structural properties of sets in the plane that achieve the optimal lower bound $3\binom{k+2}{2}$ of $(\leq…

Given a graph $G$ and an integer $\ell\ge 2$, we denote by $\alpha_{\ell}(G)$ the maximum size of a $K_{\ell}$-free subset of vertices in $V(G)$. A recent question of Nenadov and Pehova asks for determining the best possible minimum degree…

Given graphs $G$, $H_1$, and $H_2$, let $G\xrightarrow{\text{mr}}(H_1,H_2)$ denote the property that in every edge colouring of $G$ there is a monochromatic copy of $H_1$ or a rainbow copy of $H_2$. The constrained Ramsey number, defined as…

We study the problem of detecting local geometry in random graphs. We introduce a model $\mathcal{G}(n, p, d, k)$, where a hidden community of average size $k$ has edges drawn as a random geometric graph on $\mathbb{S}^{d-1}$, while all…

Let $G$ be a connected graph of order $n$ with girth $g$. For $k=1,\dots,\min\{g-1, n-g\}$, let $n(G,k)$ be the number of Laplacian eigenvalues (counting multiplicities) of $G$ that fall inside the interval $[n-g-k+4,n]$. We prove that if…

Bell's test, initially devised to distinguish quantum theory from local hidden variable models through {violations of local bounds}, is also a common tool for detecting entanglement. For this purpose, one can assume the quantum description…

Bell nonlocality and uncertainty relations are distinct features of quantum theory from classical physics. Bell nonlocality concerns the correlation strength among local observables on different quantum particles, whereas the uncertainty…

The family of $(k,\ell)$-sparse graphs, introduced by Lorea, plays a central role in combinatorial optimization and has a wide range of applications, particularly in rigidity theory. A key algorithmic problem is to decide whether a given…

This paper studies explicit and theoretical bounds for several interesting quantities in number theory, conditionally on the Generalized Riemann Hypothesis. Specifically, we improve the existing explicit bounds for the least quadratic…

The purpose of this paper is to prove local upper and lower bounds for weak solutions of semilinear elliptic equations of the form $-\Delta u= c u^p$, with $0<p<p_s=(d+2)/(d-2)$, defined on bounded domains of $\RR^d$, $d\ge 3$, without…

A graph $G$ is $k$-critical (list $k$-critical, DP $k$-critical) if $\chi(G)= k$ ($\chi_\ell(G)= k$, $\chi_\mathrm{DP}(G)= k$) and for every proper subgraph $G'$ of $G$, $\chi(G')<k$ ($\chi_\ell(G')< k$, $\chi_\mathrm{DP}(G')<k$). Let $f(n,…

Fix integers $1\le k<n$, and numbers $a,s$ satisfying $0<s<\min\{k,a\}$. The problem of exceptional set estimate is to determine \[T(a,s):=\sup_{A\subset \mathbb{R}^n\ \text{dim}A=a}\text{dim}(\{ V\in G(k,n): \text{dim}(\pi_V(A))<s \}). \]…

We prove a local central limit theorem (LCLT) for the number of points $N(J)$ in a region $J$ in $\mathbb R^d$ specified by a determinantal point process with an Hermitian kernel. The only assumption is that the variance of $N(J)$ tends to…