相关论文: A Note on Optimal Unimodular Lattices
The methods to classify extremal unimodular lattices with given automorphisms are extended to the situation of modular lattices. A slightly more general notion than the type from the PhD thesis of Michael Juergens is the det-type. The…
This paper studies a problem of Erd\"{o}s concerning lattice cubes. Given an $N \times N \times N$ lattice cube, we want to find the maximum number of vertices one can select so that no eight corners of a rectangular box are chosen…
The theta series of a lattice is a power series that characterizes the number of lattice vectors at certain norms. It is closely related to a critical quantity widely used in physical layer security and cryptography, known as the flatness…
For many classical moduli spaces of orthogonal type there are results about the Kodaira dimension. But nothing is known in the case of dimension greater than 19. In this paper we obtain the first results in this direction. In particular the…
A root lattice is a finite rank $\mathbb{Z}$-lattice generated by elements $x$ satisfying $x\cdot x=2$. It is well-known that the root lattices have an $ADE$ classification and they play a prominent role in the study of even unimodular…
The moduli space of rank-n commutative algebras equipped with an ordered basis is an affine scheme B_n of finite type over Z, with geometrically connected fibers. It is smooth if and only if n <= 3. It is reducible if n >= 8 (and the…
A chief problem in phylogenetics and database theory is the computation of a maximum consistent tree from a set of rooted or unrooted trees. A standard input are triplets, rooted binary trees on three leaves, or quartets, unrooted binary…
All codes with minimum distance 8 and codimension up to 14 and all codes with minimum distance 10 and codimension up to 18 are classified. Nonexistence of codes with parameters [33,18,8] and [33,14,10] is proved. This leads to 8 new exact…
Self-dual codes have been studied actively because they are connected with mathematical structures including block designs and lattices and have practical applications in quantum error-correcting codes and secret sharing schemes.…
By median we mean a scheme that inputs three element of a lattice, and outputs an element that is an average of the three inputs in a certain sense. The medians of a given finite lattice form a new lattice that is usually larger than the…
We find upper bounds for the essential dimension of various moduli stacks of $\sln$-bundles over a curve. When $n$ is a prime power, our calculation computes the essential dimension of the stack of stable bundles exactly and the essential…
Motivated by the problem of bounding the number of rays of plane tropical curves we study the following question: Given $n\in\mathbb{N}$ and a unimodular $2$-simplex $\Delta$ what is the maximal number of vertices a lattice polytope…
Let $R$ be an affine algebra over an algebraically closed field of characteristic $0$ with dim$(R)=n$. Let $P$ be a projective $A=R[T_1,\cdots,T_k]$-module of rank $n$ with determinant $L$. Suppose $I$ is an ideal of $A$ of height $n$ such…
It is known that a graded lattice of rank n is supersolvable if and only if it has an EL-labelling where the labels along any maximal chain are exactly the numbers 1,2,...,n without repetition. These labellings are called S_n EL-labellings,…
We prove a sharp upper bound on the number of distinct columns of a totally unimodular matrix with column sums $1$ improving upon Heller's classical bound. The proof uses Seymour's decomposition theorem. Such matrices are closely related to…
Let Lambda be a set of three integers and let C_Lambda be the space of 2pi-periodic functions with spectrum in Lambda endowed with the maximum modulus norm. We isolate the maximum modulus points x of trigonometric trinomials T in C_Lambda…
A periodic lattice in Euclidean space is the infinite set of all integer linear combinations of basis vectors. Any lattice can be generated by infinitely many different bases. This ambiguity was only partially resolved, but standard…
A convex set with nonempty interior is maximal lattice-free if it is inclusion-maximal with respect to the property of not containing integer points in its interior. Maximal lattice-free convex sets are known to be polyhedra. The precision…
A polytope in a finite-dimensional normed space is subequilateral if the length in the norm of each of its edges equals its diameter. Subequilateral polytopes occur in the study of two unrelated subjects: surface energy minimizing cones and…
The set of badly approximable $m \times n $ matrices is known to have Hausdorff dimension $mn $. Each such matrix comes with its own approximation constant $c$, and one can ask for the dimension of the set of badly approximable matrices…