Related papers: Embedding dimension gaps in sparse codes
The dimension of a block design is the maximum positive integer $d$ such that any $d$ of its points are contained in a proper subdesign. Pairwise balanced designs PBD$(v,K)$ have dimension at least two as long as not all points are on the…
This paper provides new constructive lower bounds for constant dimension codes, using different techniques such as Ferrers diagram rank metric codes and pending blocks. Constructions for two families of parameters of constant dimension…
Two-dimensional constrained coding is a problem that is much more difficult than its one-dimensional counterpart. Indeed, in two dimensions, obtaining the answers to very natural questions becomes uncomputable. In particular, it is…
We show that \emph{efficient Turing computability} at any fixed input/output precision implies the existence of \emph{compositionally sparse} (bounded-fan-in, polynomial-size) DAG representations and of corresponding neural approximants…
Given a closed polygon P having n edges, embedded in R^d, we give upper and lower bounds for the minimal number of triangles t needed to form a triangulated PL surface in R^d having P as its geometric boundary. The most interesting case is…
Recently it has been observed that the group $E_7$ can be used to describe a special type of quantum entanglement of seven qubits partitioned into seven tripartite systems. Here we show that this curious type of entanglement is entirely…
It is shown that the maximum size of a binary subspace code of packet length $v=6$, minimum subspace distance $d=4$, and constant dimension $k=3$ is $M=77$; in Finite Geometry terms, the maximum number of planes in $\operatorname{PG}(5,2)$…
Linear error-correcting codes can be used for constructing secret sharing schemes; however finding in general the access structures of these secret sharing schemes and, in particular, determining efficient access structures is difficult.…
We prove new upper bounds on the smallest size of affine blocking sets, that is, sets of points in a finite affine space that intersect every affine subspace of a fixed codimension. We show an equivalence between affine blocking sets with…
The Fano lineshape arises from the interference of two excitation pathways to reach a continuum. Its generality has resulted in a tremendous success in explaining the lineshapes of many one-dimensional spectroscopies - absorption, emission,…
Neural codes, represented as collections of binary strings called codewords, are used to encode neural activity. A code is called convex if its codewords are represented as an arrangement of convex open sets in Euclidean space. Previous…
This work deals with the study of embeddings of toric Calabi-Yau fourfolds which are complex cones over the smooth Fano threefolds. In particular, we focus on finding various embeddings of Fano threefolds inside other Fano threefolds and…
R. Beheshti showed that, for a smooth Fano hypersurface $X$ of degree $\leq 8$ over the complex number field $\mathbb{C}$, the dimension of the space of lines lying in $X$ is equal to the expected dimension. We study the space of conics on…
We determine a formula for the dimension of a family of affine Springer fibers associated to a symmetric space arising from the block diagonal embedding $\mathrm{GL}_n\times\mathrm{GL}_n\hookrightarrow\mathrm{GL}_{2n}$ . As an application,…
Inspired by a recently formulated conjecture by Bannai et al. we investigate spherical codes which admit exactly three different distances and are spherical 5-designs. Computing and analyzing distance distributions we provide new proof of…
This paper considers affine analogues of the isoperimetric inequality in the sense of piecewise linear topology. Given a closed polygon P embedded in R^d having n edges, we give upper and lower bounds for the minimal number of triangles…
The goal of predictive sparse coding is to learn a representation of examples as sparse linear combinations of elements from a dictionary, such that a learned hypothesis linear in the new representation performs well on a predictive task.…
Let $\mathrm{PG}(3,q)$ be the projective space of dimension three over the finite field with $q$ elements. Consider a twisted cubic in $\mathrm{PG}(3,q)$. The structure of the point-plane incidence matrix in $\mathrm{PG}(3,q)$ with respect…
Closure phase is the phase of a closed-loop product of correlations in a $\ge 3$-element interferometer array. Its invariance to element-based phase corruption makes it invaluable for interferometric applications that otherwise require…
We describe a new parameterized family of symmetric error-correcting codes with low-density parity-check matrices (LDPC). Our codes can be described in two seemingly different ways. First, in relation to Reed-Muller codes: our codes are…