相关论文: Families of Equiangular Lines and Lattices
We provide new families of minimal codes in any characteristic. Also, an inductive construction of minimal codes is presented.
It is shown that lattices of a family of split solvable subgroups of PSL(N + 1, C) are complex Kleinian using techniques of Lie groups and dynamical systems, also that there exists a minimal limit set for the action of these lattices on the…
We use representation theory to construct spaces of matrices of constant rank. These spaces are parametrized by the natural representation of the general linear group or the symplectic group. We present variants of this idea, with more…
Materials science and the study of the electronic properties of solids are a major field of interest in both physics and engineering. The starting point for all such calculations is single-electron, or non-interacting, band structure…
In this paper, we continue the recent work of Fukshansky and Maharaj on lattices from elliptic curves over finite fields. We show that there exist bases formed by minimal vectors for these lattices except only one case. We also compute…
We show that a family of extremely thin sets satisfy the Erd\H{o}s similarity conjecture. These examples lie outside the range covered by recent work of Shmerkin and Yavicoli \cite{ShmerkinYavicoli2025}. As we shall see, they have small…
We introduce a concept of multiplicity lattices of 2-multiarrangements, determine the combinatorics and geometry of that lattice, and give a criterion and method to construct a basis for derivation modules effectively.
We introduce two classes of discrete polynomials and construct discrete equations admitting a Lax representation in terms of these polynomials. Also we give an approach which allows to construct lattice integrable hierarchies in its…
In this paper, we give a method for constructing linear codes with small hulls by generalizing the method in \cite{LCD-T-matric}. As a result, we obtain many optimal Euclidean LCD codes and Hermitian LCD codes, which improve the previously…
We study surfaces in Euclidean space ${\mathbb R}^3$ that are minimal for a log-linear density $\phi(x,y,z)=\alpha x+\beta y+\gamma y$, where $\alpha,\beta,\gamma$ are real numbers not all zero. We prove that if a surface is $\phi$-minimal…
Lattices and partially ordered sets have played an increasingly important role in coding theory, providing combinatorial frameworks for studying structural and algebraic properties of error-correcting codes. Motivated by recent works…
Weakly orthomodular and dually weakly orthomodular lattices were introduced by the authors in a recent paper. Similarly as for orthomodular lattices we try to introduce an implication in these lattices which can be easily axiomatized and…
First we solve the problem of finding minimal degree families on toric surfaces by reducing it to lattice geometry. Then we describe how to find minimal degree families on, more generally, rational complex projective surfaces.
A set of vectors of equal norm in $\mathbb{C}^d$ represents equiangular lines if the magnitudes of the 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 conjectured that…
We introduce a new method to construct a large family of Lagrangian surfaces in complex Euclidean plane by means of two planar curves making use of their usual product as complex functions and integrating the Hermitian product of their…
We give a new existence proof for the rank 2^d even lattices usually called the Barnes-Wall lattices, and establish new results on uniqueness, structure and transitivity of the automorphism group on certain kinds of sublattices. Our proofs…
We introduce the notion of a polyptych lattice, which encodes a collection of lattices related by piecewise linear bijections. We initiate a study of the new theory of convex geometry and polytopes associated to polyptych lattices. In…
We give an elementary proof of low rank cases of the conjecture that the tensor product of two semistable Euclidean lattices is again semistable.
We investigate a connection between two important classes of Euclidean lattices: well-rounded and ideal lattices. A lattice of full rank in a Euclidean space is called well-rounded if its set of minimal vectors spans the whole space. We…
We construct several families of perfect sublattices with minimum $4$ of $\mathbb Z^d$. In particular, the number of $d-$dimensional perfect integral lattices with minimum $4$ grows faster than $d^k$ for every exponent $k$.