Related papers: Sparse Modular Forms, Lattices, and Codes
An algorithm is presented for generating finite modular, semimodular, graded, and geometric lattices up to isomorphism. Isomorphic copies are avoided using a combination of the general-purpose graph-isomorphism tool nauty and some…
We find and propose an explanation for a large variety of modularity-related symmetries in problems of 3-manifold topology and physics of 3d $\mathcal{N}=2$ theories where such structures a priori are not manifest. These modular structures…
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…
We study a class of meromorphic modular forms characterised by Fourier coefficients that satisfy certain divisibility properties. We present new candidates for these so-called magnetic modular forms, and we conjecture properties that these…
Modular invariance strongly constrains the spectrum of states of two dimensional conformal field theories. By summing over the images of the modular group, we construct candidate CFT partition functions that are modular invariant and have…
We propose a construction of lattices from codes corresponding to lattices of type $A_n$, $D_n$ and $E_n$. This construction is a generalization of construction A of lattices from $p$-ary codes corresponding to a lattice of type $A_{p-1}$.…
There is a rich connection between classical error-correcting codes, Euclidean lattices, and chiral conformal field theories. Here we show that quantum error-correcting codes, those of the stabilizer type, are related to Lorentzian lattices…
The spectral moments of ensembles of sparse random block matrices are analytically evaluated in the limit of large order. The structure of the sparse matrix corresponds to the Erd\"os-Renyi random graph. The blocks are i.i.d. random…
We show that the phenomenon of modulational instability in arrays of Bose-Einstein condensates confined to optical lattices gives rise to coherent spatial structures of localized excitations. These excitations represent thin disks in 1D,…
We exhibit simple lattice systems, motivated by recently proposed cold atom experiments, whose continuum limits interpolate between real and $p$-adic smoothness as a spectral exponent is varied. A real spatial dimension emerges in the…
We introduce tile codes, a simple yet powerful way of constructing quantum codes that are local on a planar 2D-lattice. Tile codes generalize the usual surface code by allowing for a bit more flexibility in terms of locality and stabilizer…
Part B (of a project involving four Parts) is about "bases of lines", a concept introduced by C. Herrmann and the author in the late 80's. Bases of lines attempt to describe a given modular lattice in a geometric way akin to how projective…
We study the compactness problem for moduli spaces of holomorphic supercurves which, being motivated by supergeometry, are perturbed such as to allow for transversality. We give an explicit construction of limiting objects for sequences of…
We analyse various structural and order-theoretical aspects of abstract separation systems and partial lattices, as well as the relationship between the different submodularity conditions one can impose on them.
In [1], K\"otter and Kschischang presented a new model for error correcting codes in network coding. The alphabet in this model is the subspace lattice of a given vector space, a code is a subset of this lattice and the used metric on this…
To prove that a modular variety is of general type, there are three types of obstructions: reflective, cusp and elliptic obstructions. In this paper, we give a quantitative estimate of the reflective obstructions for the unitary case. This…
Matrix equations are omnipresent in (numerical) linear algebra and systems theory. Especially in model order reduction (MOR) they play a key role in many balancing based reduction methods for linear dynamical systems. When these systems…
We present a comprehensive framework for structured sparse coding and modeling extending the recent ideas of using learnable fast regressors to approximate exact sparse codes. For this purpose, we develop a novel block-coordinate proximal…
In this paper we study algebras of modular forms on unitary groups of signature $(n,1)$. We give a necessary and sufficient condition for an algebra of unitary modular forms to be free in terms of the modular Jacobian. As a corollary we…
Sparse graphs and their associated matroids play an important role in rigidity theory, where they capture the combinatorics of generically rigid structures. We define a new family called {\bf graded sparse graphs}, arising from generically…