相关论文: Embedding dimension gaps in sparse codes
One can embed arbitrarily many disjoint, non-parallel, non-boundary parallel, incompressible surfaces in any three manifold with at least one boundary component of genus two or greater [4]. This paper proves the contrasting, but not…
It is shown that any smooth closed orientable manifold of dimension $2k + 1$, $k \geq 2$, admits a smooth polynomially convex embedding into $\mathbb C^{3k}$. This improves by $1$ the previously known lower bound of $3k+1$ on the possible…
Lifted maximum rank distance (MRD) codes, which are constant dimension codes, are considered. It is shown that a lifted MRD code can be represented in such a way that it forms a block design known as a transversal design. A slightly…
Motivated by applications to the theory of rank-metric codes, we study the problem of estimating the number of common complements of a family of subspaces over a finite field in terms of the cardinality of the family and its intersection…
In this paper, we study binary constrained codes that are resilient to bit-flip errors and erasures. In our first approach, we compute the sizes of constrained subcodes of linear codes. Since there exist well-known linear codes that achieve…
We study congruences of lines $X_\omega$ defined by a sufficiently general choice of an alternating 3-form $\omega$ in $n+1$ dimensions, as Fano manifolds of index $3$ and dimension $n-1$. These congruences include the…
It is generally unclear whether smaller codes can be "concatenated" to systematically create quantum LDPC codes or their sparse subsystem code cousins where the degree of the Tanner graph remains bounded while increasing the code distance.…
This paper gives new methods of constructing {\it symmetric self-dual codes} over a finite field $GF(q)$ where $q$ is a power of an odd prime. These methods are motivated by the well-known Pless symmetry codes and quadratic double circulant…
We present the full analytic result for the three-loop angle-dependent cusp anomalous dimension in QCD. With this result, infrared divergences of planar scattering processes with massive particles can be predicted to that order. Moreover,…
The linkage construction and its generalization is one of the most powerful constructions for constant dimension code, accounting for approximately 50\% of all the listed parameters. We show how to improve the linkage construction of…
Recent advances in learning 3D shapes using neural implicit functions have achieved impressive results by breaking the previous barrier of resolution and diversity for varying topologies. However, most of such approaches are limited to…
We calculate and present an analytic form of the magneto-optical conductivity for the gapped low-energy Kane model in two and three dimensions separately. The two-dimensional case maps onto the $\alpha$-$\mathcal{T}_3$ model at a particular…
We address the problems of constructing quantum convolutional codes (QCCs) and of encoding them. The first construction is a CSS-type construction which allows us to find QCCs of rate 2/4. The second construction yields a quantum…
The aim of this work is a systematic investigation of the possible parameters of quasi-perfect (QP) binary and ternary linear codes of small dimensions and preparing a complete classification of all such codes. First we give a list of…
In this work we analyze the dimension-independent convergence property of an abstract sparse quadrature scheme for numerical integration of functions of high-dimensional parameters with Gaussian measure. Under certain assumptions of the…
The objective of this paper is to learn dense 3D shape correspondence for topology-varying generic objects in an unsupervised manner. Conventional implicit functions estimate the occupancy of a 3D point given a shape latent code. Instead,…
Let $X^o=\mathbb P^3\setminus D$ where $D$ is the union of two quadrics such that their intersection contains a smooth conic, or the union of a smooth quadric surface and two planes, or the union of a smooth cubic surface $V$ and a plane…
We introduce a new method from number fields and codes to construct dense packings in the Euclidean spaces. Via the canonical $\mathbb{Q}$-embedding of arbitrary number field $K$ into $\mathbb{R}^{[K:\mathbb{Q}]}$, both the prime ideal…
This paper begins with a class of convex quadratic programs (QPs) with bounded variables solvable by the parametric principal pivoting algorithm with $\mathcal{O}(n^3)$ strongly polynomial complexity, where $n$ is the number of variables of…
Neural codes are lists of subsets of neurons that fire together. Of particular interest are neurons called place cells, which fire when an animal is in specific, usually convex regions in space. A fundamental question, therefore, is to…