Related papers: Rigidity of eigenvalues for $\beta$ ensemble in mu…

We have optimized the zero frequency first hyperpolarizability \beta of a one-dimensional piecewise linear potential well containing a single electron by adjusting the shape of that potential. With increasing numbers of parameters in the…

Consider the following class of learning schemes: $$\hat{\boldsymbol{\beta}} := \arg\min_{\boldsymbol{\beta}}\;\sum_{j=1}^n \ell(\boldsymbol{x}_j^\top\boldsymbol{\beta}; y_j) + \lambda R(\boldsymbol{\beta}),\qquad\qquad (1) $$ where…

In 2017, Qiao and Koolen showed that for any fixed integer $D\geq 3$, there are only finitely many such graphs with $\theta_{\min}\leq -\alpha k$, where $0<\alpha<1$ is any fixed number. In this paper, we will study non-bipartite…

We present new algorithms for estimating and testing \emph{collision probability}, a fundamental measure of the spread of a discrete distribution that is widely used in many scientific fields. We describe an algorithm that satisfies…

We investigate regular configurations of a small number of particles settling under gravity in a viscous fluid. The particles do not touch each other and can move relative to each other. The dynamics is analyzed in the point-particle…

We establish a free analogue of Obata's rigidity theorem. More precisely, Cheng and Zhou (2017) proved that on a weighted Riemannian manifold, the sharp spectral gap (Poincar\'e constant) is achieved only when the space splits isometrically…

We calculate analytically the probability of large deviations from its mean of the largest (smallest) eigenvalue of random matrices belonging to the Gaussian orthogonal, unitary and symplectic ensembles. In particular, we show that the…

In this paper we introduce and explore the notion of rigidity group, associated with a collection of finitely many sequences, and show that this concept has many, somewhat surprising characterizations of algebraic, spectral, and unitary…

In this work we discuss how to correctly obtain the number of degrees of freedom of a system constituted by n particles with fixed relative distances and which are immerse in a three-dimensional space. As a result of our analysis, we…

This article investigates the phenomenon of maximal rigidity in spatial processes, where perfect interpolation of the process is possible from partial information, specifically, from its restriction to a strict subdomain, often resulting in…

This paper studies the motion of a particle whose tune is inside and near a linear half-integer stopband. Results are found for the tune and beta functions in the stable region close to an edge of the stopband. It is shown that the…

Let ${\cal L}$ be an arrangement of $n$ lines in the Euclidean plane. The \emph{$k$-level} of ${\cal L}$ consists of all vertices $v$ of the arrangement which have exactly $k$ lines of ${\cal L}$ passing below $v$. The complexity (the…

The relationship between correlations and entanglement has played a major role in understanding quantum theory since the work of Einstein, Podolsky and Rosen (1935). Tsirelson (1980) proved that Bell states, shared among two parties, when…

In order to assess whether quantum resources can provide an advantage over classical computation, it is necessary to characterize and benchmark the non-classical properties of quantum algorithms in a practical manner. In this paper, we show…

The intensity of an electromagnetic wave interacting self-consistently with a beam of charged particles, as in a Free Electron Laser, displays large oscillations due to an aggregate of particles, called the macro-particle. In this article,…

We prove a quantitative rigidity result for almost constant mean curvature spheres in $\mathbb{R}^3$. Under a sub--two--sphere Willmore bound and a small $L^2$--CMC defect, we show that an almost--CMC surface is close to the round sphere,…

We demonstrate $|W\rangle$ state encoding of multi-atom ensemble qubits. Using optically trapped Rb atoms the $T_2$ coherence time is 2.6(3) ms for $\bar N=7.6$ atoms and scales approximately inversely with the number of atoms. Strong…

We prove a \emph{query complexity} lower bound on rank-one principal component analysis (PCA). We consider an oracle model where, given a symmetric matrix $M \in \mathbb{R}^{d \times d}$, an algorithm is allowed to make $T$ \emph{exact}…

Lipschitz decomposition is a useful tool in the design of efficient algorithms involving metric spaces. While many bounds are known for different families of finite metrics, the optimal parameters for $n$-point subsets of $\ell_p$, for $p >…

We provide a simplified characterization of entanglement in physical systems which are symmetric under the action of subgroups of the symmetric group acting on the party labels. Sets of entanglements are inherently equal, lying in the same…