Related papers: A remark on dimensionality reduction in discrete s…
We consider classical shadows of fermion wavefunctions with $\eta$ particles occupying $n$ modes. We prove that all $k$-Reduced Density Matrices (RDMs) may be simultaneously estimated to an average variance of $\epsilon^{2}$ using at most…
Let $G=\mathbf{Z}_{p} \oplus \mathbf{Z}_{p^2}$, where $p$ is a prime number. Suppose that $d$ is a divisor of the order of $G$. In this paper we find the number of automorphisms of $G$ fixing $d$ elements of $G$, and denote it by…
This work constructs Jonson-Lindenstrauss embeddings with best accuracy, as measured by variance, mean-squared error and exponential concentration of the length distortion. Lower bounds for any data and embedding dimensions are determined,…
There is recent interest in compressing data sets for non-sequential settings, where lack of obvious orderings on their data space, require notions of data equivalences to be considered. For example, Varshney & Goyal (DCC, 2006) considered…
We show that for any natural number $s$, there is a constant $\gamma$ and a subgraph-closed class having, for any natural $n$, at most $\gamma^n$ graphs on $n$ vertices up to isomorphism, but no adjacency labeling scheme with labels of size…
In this paper, we present a fine-grained analysis of the local landscape of phase retrieval under the regime of limited samples. Specifically, we aim to ascertain the minimal sample size required to guarantee a benign local landscape…
Let $\varphi_{n,K}$ denote the largest angle in all the triangles with vertices among the $n$ points selected at random in a compact convex subset $K$ of $\mathbb{R}^d$ with nonempty interior, where $d\ge2$. It is shown that the…
We derive a nice representation for point symmetry transformations of the (1+1)-dimensional linear heat equation and properly interpret them. This allows us to prove that the pseudogroup of these transformations has exactly two connected…
In this paper we show the existence of a closed, embedded $\lambda$-hypersurfaces $\Sigma \subset \mathbb{R}^{2n}$. The hypersurface is diffeomorhic to $\mathbb{S}^{n-1} \times \mathbb{S}^{n-1} \times \mathbb{S}^1$ and exhibits $SO(n)…
We introduce a regularity method for sparse graphs, with new regularity and counting lemmas which use the Schatten-von-Neumann norms to measure uniformity. This leads to $k$-cycle removal lemmas in subgraphs of mildly-pseudorandom graphs,…
Let $K$ be a maximal lattice-free set in $\mathbb{R}^d$, that is, $K$ is convex and closed subset of $\mathbb{R}^d$, the interior of $K$ does not cointain points of $\mathbb{Z}^d$ and $K$ is inclusion-maximal with respect to the above…
Let $D\subset \mathbb{R}^{n}$ be a bounded convex domain and $F:D\rightarrow D$ a $1$-Lipschitz mapping with respect to the Hilbert metric $d$ on $D$ satisfying condition $d(sx+(1-s)y,sz+(1-s)w)\leq \max \{d(x,z),d(y,w) \}$. We show that if…
The paper re-analyzes a version of the celebrated Johnson-Lindenstrauss Lemma, in which matrices are subjected to constraints that naturally emerge from neuroscience applications: a) sparsity and b) sign-consistency. This particular variant…
Consider the normalized adjacency matrices of random $d$-regular graphs on $N$ vertices with fixed degree $d\geq 3$, and denote the eigenvalues as $\lambda_1=d/\sqrt{d-1}\geq \lambda_2\geq\lambda_3\cdots\geq \lambda_N$. We prove that the…
We introduce the theory of div point sets, which aims to provide a framework to study the combinatoric nature of any set of points in general position on an Euclidean plane. We then show that proving the unsatisfiability of some first-order…
We obtain nontrivial exponents for Erd\H os-Falconer type problems. Let $T_k(E)$ denote the set of distinct congruent $k$-dimensional simplexes determined by $(k+1)$-tuples of points from $E$. We prove that there exists $s_0(d)<d$ such…
We consider a second-order nonlocal parabolic MEMS equation with Dirichlet boundary conditions: \[ u_t-\Delta u=\frac{\lambda}{(1-u)^2\bigl(1+\int_\Omega\frac{1}{1-u}\,dx\bigr)^2},\quad x\in\Omega,\ t>0, \] where…
We introduce a randomized iterative fragmentation procedure for finite metric spaces, which is guaranteed to result in a polynomially large subset that is $D$-equivalent to an ultrametric, where $D\in (2,\infty)$ is a prescribed target…
We gain insight on the fixed point dynamics of $d$ dimensional quantum field theories by exploiting the critical behavior of the $d-\epsilon$ sister theories. To this end we first derive a self-consistent relation between the $d-\epsilon$…
Fix a space dimension $d\ge 2$, parameters $\alpha > -1$ and $\beta \ge 1$, and let $\gamma_{d,\alpha, \beta}$ be the probability measure of an isotropic random vector in $\mathbb{R}^d$ with density proportional to \begin{align*}…