相关论文: Families of Equiangular Lines and Lattices
Approximate lattices of Euclidean spaces, also known as Meyer sets, are aperiodic subsets with fascinating properties. In general, approximate lattices are defined as approximate subgroups of locally compact groups that are discrete and…
We study periodic tessellations of the Euclidean space with unequal cells arising from the minimization of perimeter functionals. Existence results and qualitative properties of minimizers are discussed for different classes of problems,…
We introduce and motivate a conjecture about the existence of complete, 1-dimensional families of covers of an elliptic curve. If the conjecture holds, then it would imply a uniform lower bound of 5 for slope of the moduli space of curves.…
A lattice of integers is the collection of all linear combinations of a set of vectors for which all entries of the vectors are integers and all coefficients in the linear combinations are also integers. Lattice reduction refers to the…
Piecewise Euclidean structures (identified solid Euclidean polyhedra) on topological 3-dimensional manifolds and pseudo-manifolds are constructed so that they admit pseudo-foliations, a generalized type of foliation. The construction of…
We show that every tiling of a convex set in the Euclidean plane $\mathbb{R}^2$ by equilateral triangles of mutually different sizes contains arbitrarily small tiles. The proof is purely elementary up to the discussion of one family of…
Using Legendrian immersions and, in particular, Legendre curves in odd dimensional spheres and anti De Sitter spaces, we provide a method of construction of new examples of Hamiltonian-minimal Lagrangian submanifolds in complex projective…
This paper gives various methods for constructing vector bundles over elliptic curves and more generally over families of elliptic curves. We construct universal families over generalized elliptic curves via spectral cover methods and also…
For an even lattice L , the form v --> (v.v)/2 induces a quadratic form q on the (Z/2)-vector space L/2L . For the lattices associated to some particular root systems, we show that reduction mod. 2 induces a bijection between the roots of L…
Linear codes with a few weights have many nice applications including combinatorial design, distributed storage system, secret sharing schemes and so on. In this paper, we construct two families of linear codes with a few weights based on…
We study the problem of finding a function $f$ with ``small support'' that simultaneously tiles with finitely many lattices $\Lambda_1, \ldots, \Lambda_N$ in $d$-dimensional Euclidean spaces. We prove several results, both upper bounds…
New families of matroids are constructed in this note. These new fami- lies are derived from the concept of linearly independent set family (LISF) introduced by Eicker and Ewald [Linear Algebra and its Applications 388 (2004) 173-191]. The…
We give a simple description of rectangular matrices that can be implemented by a post-selected stabilizer circuit. Given a matrix with entries in dyadic cyclotomic number fields $\mathbb{Q}(\exp(i\frac{2\pi}{2^m}))$, we show that it can be…
We define the Euclidean hull of a linear code $C$ as the intersection of $C$ and its Euclidean dual $C^\perp$. The hull with low dimensions gets much interest due to its crucial role in determining the complexity of algorithms for computing…
We introduce a new representation concept for lattices by boolean matrices, and utilize it to prove that any matroid is boolean representable. We show that such a representation can be easily extracted from a representation of the…
A lattice in Euclidean $d$-space is called well-rounded if it contains $d$ linearly independent vectors of minimal length. This class of lattices is important for various questions, including sphere packing or homology computations. The…
A set of vectors of equal norm in $\mathbb{C}^d$ represents equiangular lines if the magnitudes of the Hermitian inner product of every pair of distinct vectors in the set are equal. The maximum size of such a set is $d^2$, and it is…
We consider the problem of finding lower bounds on the number of unlabeled $n$-element lattices in some lattice family. We show that if the family is closed under vertical sum, exponential lower bounds can be obtained from vertical sums of…
We propose an algebraic and a geometric classification of euclidean isodual lattices of fixed rank. First, we prove that these lattices are distribued according to a finite number of algebraic types. Second, we show that they are…
We review a lattice construction arising from quaternion algebras over number fields and use it to obtain some known extremal and densest lattices in dimensions 8 and 16. The benefit of using quaternion algebras over number fields is that…