Related papers: Bounding a global red-blue proportion using local …
Bell's theorem shows that local measurements on entangled states give rise to correlations incompatible with local hidden variable models. The degree of quantum nonlocality is not maximal though, as there are even more nonlocal theories…
We study combinatorial configurations with the associated point and line graphs being strongly regular. Examples not belonging to known classes such as partial geometries and their generalizations or elliptic semiplanes are constructed.…
The study on the partial differential equations (systems) in the graph setting is a hot topic in recent years because of their applications to image processing and data clustering. Our motivation is to develop some existence results for…
In this paper we slightly improve the regularity theory for the so called optimal design problem. We first establish the uniform rectifiability of the boundary of the optimal set, for a larger class of minimizers, in any dimension. As an…
Given a large finite point set, $P\subset \mathbb R^2$, we obtain upper bounds on the number of triples of points that determine a given pair of dot products. That is, for any pair of positive real numbers, $(\alpha, \beta)$, we bound the…
In this paper, we establish an improved version of a saddle point theorem ([4]) removing a weak lower semicontinuity assumption at all. We then revisit some of the applications of that theorem in the light of such an improvement. For…
We consider a generic system composed of a fixed number of particles distributed over a finite number of energy levels. We make only general assumptions about system's properties and the entropy. System's constraints other than fixed number…
Given a graph $G$ of $n$ vertices, where each vertex is initially attached an opinion of either red or blue. We investigate a random process known as the Best-of-three voting. In this process, at each time step, every vertex chooses three…
We establish blow-up profiles for any blowing-up sequence of solutions of general conformally invariant fully nonlinear elliptic equations on Euclidean domains. We prove that (i) the distance between blow-up points is bounded from below by…
We study a pinned variant of Bourgain's theorem, concerning the occurrence of affine copies of $k$-point patterns in $\mathbb{R}^d$. Focusing on the case $k=2$, which corresponds to pinned distances, we show that the classical conclusion…
Huemer et al. (Discrete Mathematics, 2019) proved that for any two point sets $R$ and $B$ with $|R|=|B|$, the perfect matching that matches points of $R$ with points of $B$, and maximizes the total \emph{squared} Euclidean distance of the…
We study the properties of `infinite-volume mixing' for two classes of intermittent maps: expanding maps $[0,1] \longrightarrow [0,1]$ with an indifferent fixed point at 0 preserving an infinite, absolutely continuous measure, and expanding…
A pair of subsets of Euclidean space which nearly achieves equality in the Brunn-Minkowski inequality must nearly coincide with a pair of homothetic convex sets. The two-dimensional case was treated in a previous paper in this series by an…
We use and adapt the Borsuk-Ulam Theorem from topology to derive limitations on list-replicable and globally stable learning algorithms. We further demonstrate the applicability of our methods in combinatorics and topology. We show that,…
We study the local and global well-posedness for the coupled system of Schr\"odinger and Kawahara equations on the real line. The Sobolev space $L^{2} \times H^{-2}$ is the space where the lowest regularity local solutions are obtained. The…
A point (x1, x2) with coordinates in a subfield of R of transcendence degree one over Q, with 1, x1, x2 linearly independent over Q, may have a uniform exponent of approximation by elements of Q^2 that is strictly larger than the lower…
In this paper, we consider the one-dimensional generalized Benjamin--Bona--Mahony (gBBM) equation \[(1-\partial_x^2)u_t+(u+u^p)_x=0,\qquad p=2,3,4,\dots,\] posed either on the real line $\mathbb R$ or on the torus $\mathbb T$. This equation…
For a graph whose vertex set is a finite set of points in the Euclidean $d$-space consider the closed (open) balls with diameters induced by its edges. The graph is called a (an open) Tverberg graph if these closed (open) balls intersect.…
We generalize the joints problem to sets of varieties and prove almost sharp bound on the number of joints. As a special case, given a set of $N$ $2$-planes in $\mathbb{R}^6$, the number of points at which three $2$-planes intersect and…
Consider a graph G with n nodes and m edges, which represents a social network, and assume that initially each node is blue or white. In each round, all nodes simultaneously update their color to the most frequent color in their…