Related papers: On Unit Spherical Euclidean Distance Matrices Whic…

Permanent Electric Dipole Moments (EDMs) of elementary particles violate two fundamental symmetries: time reversal invariance (T) and parity (P). Assuming the CPT theorem this implies CP-violation. The CP-violation of the Standard Model is…

A distance measure is presented between two unitary propagators of quantum systems of differing dimensions along with a corresponding method of computation. A typical application is to compare the propagator of the actual (real) process…

A discrete conformal map (DCM) maps the square lattice to the Riemann sphere such that the image of every irreducible square has the same cross-ratio. This paper shows that every periodic DCM can be determined from spectral data (a…

A finite collection of unit vectors $S \subset \mathbb{R}^n$ is called a spherical two-distance set if there are two numbers $a$ and $b$ such that the inner products of distinct vectors from $S$ are either $a$ or $b$. We prove that if $a\ne…

This note aims to bring attention to a simple class of discrete dynamical systems exhibiting some complex behaviour. Each of these systems is defined as a self-mapping of the unit square and is obtained by coupling two families of…

The predicted Standard Model (SM) electric dipole moments (EDMs) of electrons and quarks are tiny, providing an important window to observe new physics. Theories beyond the SM typically allow relatively large EDMs. The EDMs depend on the…

Let $X$ be a finite set in the Euclidean space $\mathbb{R}^d$. If the squared distance between any two distinct points in $X$ is an odd integer, then the cardinality of $X$ is bounded above by $d+2$, as shown by Rosenfeld (1997) or Smith…

The \emph{distance matrix} of a simple connected graph $G$ is $D(G)=(d_{ij})$, where $d_{ij}$ is the distance between the vertices $i$ and $j$ in $G$. We consider a weighted tree $T$ on $n$ vertices with edge weights are square matrix of…

We study the empirical spectral distribution (ESD) of symmetric random matrices with ergodic entries on the diagonals. We observe that for entries with correlations that decay to 0, when the distance of the diagonal entries becomes large…

The celebrated Dvoretzky theorem asserts that every $N$-dimensional convex body admits central sections of dimension $d = \Omega(\log N)$, which is nearly spherical. For many instances of convex bodies, typically unit balls with respect to…

For some centrally symmetric convex bodies $K\subset \mathbb R^n$, we study the energy integral $$ \sup \int_{K} \int_{K} \|x - y\|_r^{p}\, d\mu(x) d\mu(y), $$ where the supremum runs over all finite signed Borel measures $\mu$ on $K$ of…

We view ultrametric spaces as two-sorted structures consisting of a set of points and of a linearly ordered set of distances. We call the appropriate notion of embeddings distance-carrying (dc for short). Those are obtained by combining…

Let $S(A)$ denote the orbit of a complex or real matrix $A$ under a certain equivalence relation such as unitary similarity, unitary equivalence, unitary congruences etc. Efficient gradient-flow algorithms are constructed to determine the…

Given sets $\mathcal{P}, \mathcal{Q} \subseteq \mathbb{R}^2$ of sizes $m$ and $n$ respectively, we are interested in the number of distinct distances spanned by $\mathcal{P} \times \mathcal{Q}$. Let $D(m, n)$ denote the minimum number of…

We study the problem of representing all distances between $n$ points in $\mathbb R^d$, with arbitrarily small distortion, using as few bits as possible. We give asymptotically tight bounds for this problem, for Euclidean metrics, for…

Let $T$ be a tree on $n$ vertices whose edge weights are positive definite matrices of order $s$. The squared distance matrix of $T$, denoted by $\Delta$, is the $ns \times ns$ block matrix with $\Delta_{ij}=d(i,j)^2$, where $d(i,j)$ is the…

We consider the classic 1-center problem: Given a set $P$ of $n$ points in a metric space find the point in $P$ that minimizes the maximum distance to the other points of $P$. We study the complexity of this problem in $d$-dimensional…

We study the spectral measure of large Euclidean random matrices. The entries of these matrices are determined by the relative position of $n$ random points in a compact set $\Omega_n$ of $\R^d$. Under various assumptions we establish the…

Let a \neq b be two positive scalars. A Euclidean representation of a simple graph G in R^r is a mapping of the nodes of G into points in R^r such that the squared Euclidean distance between any two points is a if the corresponding nodes…

The Standard Model (SM) is the best description of fundamental particles and their interactions we have to date. From this theory, all phenomena in the macroscopic world (except for gravity) can be explained, and it has successfully…