相关论文: Embedding dimension gaps in sparse codes

Subspace codes have important applications in random network coding. It is interesting to construct subspace codes with both sizes, and the minimum distances are as large as possible. In particular, cyclic constant dimension subspaces codes…

Multilayer perceptrons (MLPs) have been successfully used to represent 3D shapes implicitly and compactly, by mapping 3D coordinates to the corresponding signed distance values or occupancy values. In this paper, we propose a novel…

In this article we construct many examples of properly convex irreducible domains divided by Zariski dense relatively hyperbolic groups in every dimension at least 3. This answers a question of Benoist. Relative hyperbolicity and non-strict…

We address the problem of converting large-scale high-dimensional image data into binary codes so that approximate nearest-neighbor search over them can be efficiently performed. Different from most of the existing unsupervised approaches…

A directed path whose edges are assigned labels "up", "down", "right", or "left" is called \emph{four-directional}, and \emph{three-directional} if at most three out of the four labels are used. A \emph{direction-consistent embedding} of an…

We consider the Fano scheme $F_k(X)$ of $k$--dimensional linear subspaces contained in a complete intersection $X \subset \mathbb{P}^n$ of multi--degree $\underline{d} = (d_1, \ldots, d_s)$. Our main result is an extension of a result of…

For countably infinite IFSs on $\mathbb R^2$ consisting of affine contractions with diagonal linear parts, we give conditions under which the affinity dimension is an upper bound for the Hausdorff dimension and a lower bound for the lower…

The polar orthogonal Grassmann code $C(\mathbb{O}_{3,6})$ is the linear code associated to the Grassmann embedding of the Dual Polar space of $Q^+(5,q)$. In this manuscript we study the minimum distance of this embedding. We prove that the…

We provide a computational framework for approximating a class of structured matrices; here, the term structure is very general, and may refer to a regular sparsity pattern (e.g., block-banded), or be more highly structured (e.g., symmetric…

We study a new class of codes for lossy compression with the squared-error distortion criterion, designed using the statistical framework of high-dimensional linear regression. Codewords are linear combinations of subsets of columns of a…

We obtain new transference bounds that connect two active areas of research: proximity and sparsity of solutions to integer programs. Specifically, we study the additive integrality gap of the integer linear programs min{cx: x in P, x…

We study Q-factorial terminal Fano 3-folds whose equations are modelled on those of the Segre embedding of P^2 x P^2. These lie in codimension 4 in their total anticanonical embedding and have Picard rank 2. They fit into the current state…

We study flip graphs of triangulations whose maximum vertex degree is bounded by a constant $k$. In particular, we consider triangulations of sets of $n$ points in convex position in the plane and prove that their flip graph is connected if…

We present new bounds on the existence of general quantum maximum distance separable codes (QMDS): the length $n$ of all QMDS codes with local dimension $D$ and distance $d \geq 3$ is bounded by $n \leq D^2 + d - 2$. We obtain their weight…

Multidimensional scaling (MDS) is a popular technique for mapping a finite metric space into a low-dimensional Euclidean space in a way that best preserves pairwise distances. We study a notion of MDS on infinite metric measure spaces,…

Given a finite metric, one can construct its tight span, a geometric object representing the metric. The dimension of a tight span encodes, among other things, the size of the space of explanatory trees for that metric; for instance, if the…

We prove that every $1$-error-correcting code over a finite field can be embedded in a $1$-perfect code of some larger length. Embedding in this context means that the original code is a subcode of the resulting $1$-perfect code and can be…

In this paper we construct multidimensional codes with high dimension. The codes can correct high dimensional errors which have the form of either small clusters, or confined to an area with a small radius. We also consider small number of…

For an embedded Fano manifold $X$, we introduce a new invariant $S_X$ related to the dimension of covering linear spaces. The aim of this paper is to classify Fano manifolds $X$ which have large $S_X$.

We consider entanglement entropy between two halves of space separated by a plane, in the theory of free photon in 3+1 dimensions. We show how to separate local gauge invariant quantities that belong to the two spatial regions. We calculate…