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

We consider a nonlocal isoperimetric problem defined in the whole space $\R^N$, whose nonlocal part is given by a Riesz potential with exponent $\alpha\in(0, N-1)$. We show that critical configurations with positive second variation are…

We give a description of the set of exceptional pairs for a number field $K$, that is the set of pairs $(\ell, j(E))$, where $\ell$ is a prime and $j(E)$ is the $j$-invariant of an elliptic curve $E$ over $K$ which admits an $\ell$-isogeny…

We study an approximate version of $q$-query LDCs (Locally Decodable Codes) over the real numbers and prove lower bounds on the encoding length of such codes. A $q$-query $(\alpha,\delta)$-approximate LDC is a set $V$ of $n$ points in…

We introduce the concept of boundariness capturing the most efficient way of expressing a given element of a convex set as a probability mixture of its boundary elements. In other words, this number measures (without the need of any…

Consider a random uniform sample of $n$ points in a compact region $A$ of Euclidean $d$-space, $d \geq 2$, with a smooth or (when $d=2$) polygonal boundary. Fix $k \in {\bf N}$. Let $T_{n,k}$ be the threshold $r$ at which the geometric…

Although the notion of superdeterminism can, in principle, account for the violation of the Bell inequalities, this potential explanation has been roundly rejected by the quantum foundations community. The arguments for rejection, one of…

Let $R$ be a 2-dimensional normal excellent henselian local domain in which 2 is invertible and let $L$ and $k$ be respectively its fraction field and residue field. Let $\Omega_R$ be the set of rank 1 discrete valuations of $L$…

Given a set of $n$ points in the plane, and a parameter $k$, we consider the problem of computing the minimum (perimeter or area) axis-aligned rectangle enclosing $k$ points. We present the first near quadratic time algorithm for this…

Let G=(V,E) be a finite graph, and f:V->N be any function. The Local Search problem consists in finding a local minimum of the function f on G, that is a vertex v such that f(v) is not larger than the value of f on the neighbors of v in G.…

Let $G$ be a simple connected graph with order $ n(G)$, local metric dimension $ {\rm dim}_l(G)$, local adjacency metric dimension $ {\rm dim}_{A,l}(G)$, and clique number $ \omega(G)$, where $G\not\cong K_{n(G)}$ and $\omega(G)\geq3$. It…

We analyze and compare the mathematical formulations of the criterion for separability for bipartite density matrices and the Bell inequalities. We show that a violation of a Bell inequality can formally be expressed as a witness for…

We consider the problem of estimating an unknown $\theta\in {\mathbb{R}}^n$ from noisy observations under the constraint that $\theta$ belongs to certain convex polyhedral cones in ${\mathbb{R}}^n$. Under this setting, we prove bounds for…

Let $s(n)$ be the number of different remainders $n \bmod k$, where $1 \leq k \leq \lfloor n/2 \rfloor$. This rather natural sequence is sequence A283190 in the OEIS and while some basic facts are known, it seems that surprisingly it has…

We study two principle minimizing problems, subject of different constraints. Our open sets are assumed bounded, except mentioning otherwise;precisely $\Omega=]0,1[^n \in {\mathbb{R}}^n , n=1 $ or $n=2$.

In this paper we address the problem of the minimization of the $k$-th Robin eigenvalue $\lambda_{k,\beta}$ with parameter $\beta>0$ among bounded open Lipschitz sets with prescribed perimeter. The perimeter constraint allows us to…

We consider the first Dirichlet eigenvalue problem for a mixed local/nonlocal elliptic operator and we establish a quantitative Faber-Krahn inequality. More precisely, we show that balls minimize the first eigenvalue among sets of given…

We prove the local boundedness for solutions to a class of obstacle problems with non-standard growth conditions. The novelty here is that we are able to establish the local boundedness under a sharp bound on the gap between the growth…

We consider singular perturbed eigenvalue problem for Laplace operator in a two-dimensional domain. In the boundary we select a set depending on a character small parameter and consisting of a great number of small disjoint parts. On this…

Let $n_g(k)$ denote the smallest order of a $k$-chromatic graph of girth at least $g$. We consider the problem of determining $n_g(k)$ for small values of $k$ and $g$. After giving an overview of what is known about $n_g(k)$, we provide…

A graph $G=(V,E)$ is called a \emph{$k$-threshold graph} with \emph{thresholds} $\theta_1<\theta_2<...<\theta_k$ if we can assign a real number $r(v)$ to each vertex $v\in V$, such that for any $u,v\in V$, we have $uv\in E$ if and only if…