相关论文: Unequal dimensional small balls and quantization o…

A range counting problem is specified by a set $P$ of size $|P| = n$ of points in $\mathbb{R}^d$, an integer weight $x_p$ associated to each point $p \in P$, and a range space ${\cal R} \subseteq 2^{P}$. Given a query range $R \in {\cal…

Density modeling is notoriously difficult for high dimensional data. One approach to the problem is to search for a lower dimensional manifold which captures the main characteristics of the data. Recently, the Gaussian Process Latent…

Gromov--Wasserstein (GW) distances compare graphs, shapes, and point clouds through internal distances, without requiring a common coordinate system. This invariance is powerful, but discrete GW is a nonconvex quadratic optimal transport…

In this paper, we consider the mismatched rate-distortion problem, in which the encoding is done using a codebook, and the encoder chooses the minimum-distortion codeword according to a mismatched distortion function that differs from the…

Applying the Riemann geometric machinery of volume estimates in terms of curvature, bounds for the minimal distance of packings/codes in the Grassmann and Stiefel manifolds will be derived and analyzed. In the context of space-time block…

In the setting of a Gaussian channel without power constraints, proposed by Poltyrev, the codewords are points in an n-dimensional Euclidean space (an infinite constellation) and the tradeoff between their density and the error probability…

We prove that for any $2<p<\infty$ and for every $n$-dimensional subspace $X$ of $L_p$, represented on $\mathbb R^n$, whose unit ball $B_X$ is in Lewis' position one has the following two-level Gaussian concentration inequality: \[ \mathbb…

As an undergraduate exercise, in an article (2012 Am. J. Phys. $\bf{80}$ 780-14), quantum and classical uncertainties for dimensionless variables of position and momentum were evaluated in three potentials: infinite well, bouncing ball, and…

We consider channel coding for Gaussian channels with the recently introduced mean and variance cost constraints. Through matching converse and achievability bounds, we characterize the optimal first- and second-order performance. The main…

Given a homogeneous component of an exterior algebra, we characterize those subspaces in which every nonzero element is decomposable. In geometric terms, this corresponds to characterizing the projective linear subvarieties of the Grassmann…

Caianiello's derivation of Quantum Geometry through an isometric embedding of the spacetime ({\bf M},\tilde{g}) in the pseudo-Riemannian structure ({\bf T^*M},g^*_{AB}) is reconsidered. In the new derivation, a non-linear connection and the…

Four years ago the Extended Scale Relativity (ESR) theory in C-spaces (Clifford manifolds) was proposed as the plausible physical foundations of string theory. In such theory the speed of light and the minimum Planck scale are the two…

Lower and upper bounds on the size of a covering of subspaces in the Grassmann graph $\cG_q(n,r)$ by subspaces from the Grassmann graph $\cG_q(n,k)$, $k \geq r$, are discussed. The problem is of interest from four points of view: coding…

A method to unitarize the scattering amplitude produced by infinite-range forces is developed and applied to Born terms. In order to apply $S$-matrix techniques, based on unitarity and analyticity, we first derive an $S$-matrix free of…

Let $X=G/K$ be a symmetric space of noncompact type and rank $k\ge 2$. We prove that horospheres in $X$ are Lipschitz $(k-2)$--connected if their centers are not contained in a proper join factor of the spherical building of $X$ at…

Let $G$ be a finite union of disjoint and bounded Jordan domains in the complex plane, let $\mathcal{K}$ be a compact subset of $G$ and consider the set $G^\star$ obtained from $G$ by removing $\mathcal{K}$; i.e., $G^\star:=G\setminus…

We establish that the optimal bound for the size of the smallest integral solution of the Oppenheim Diophantine approximation problem $\abs{Q(x)-\xi}< \epsilon$ for a generic ternary form $Q$ is $\abs{x}\ll \epsilon^{-1}$. We also establish…

We introduce a new technique for reducing the dimension of the ambient space of low-degree polynomials in the Gaussian space while preserving their relative correlation structure, analogous to the Johnson-Lindenstrauss lemma. As…

In the random graph $G(n,p)$ with $pn$ bounded, the degrees of the vertices are almost i.i.d Poisson random variables with mean $\gl:= p(n-1)$. Motivated by this fact, we introduce the Poisson cloning model $G_{PC} (n,p)$ for random graphs…

In ``Characterization, stability and convergence of hierarchical clustering methods'' by G. E. Carlsson, F. Memoli, the natural way to construct an ultrametric space from a given metric space was presented. It was shown that the…