Related papers: Construction of some perfect integral lattices wit…
For lengths up to 47 except 37, we determine the largest minimum Euclidean weight among all Type I Z4-codes of that length. We also give the first example of an optimal odd unimodular lattice in dimension 41 explicitly, which is constructed…
A distributive lattice $L$ with minimum element $0$ is called decomposable lattice if $a$ and $b$ are not comparable elements in $L$ there exist $\overline{a},\overline{b}\in L$ such that $a=\overline{a}\vee(a\wedge b),…
We establish sharp asymptotic estimates for the diameter of primitive zonotopes when their dimension is fixed. We also prove that, for infinitely many integers $k$, the largest possible diameter of a lattice zonotope contained in the…
In this paper, we revisit the theory of perfect unary forms over real quadratic fields. Specifically, we deduce an infinite family of real quadratic fields $\mathbb{Q}(\sqrt{d})$ when $d=2$ or $3$ mod $4$, such that there are three classes…
We characterize factor congruences in semilattices by using generalized notions of order ideal and of direct sum of ideals. When the semilattice has a minimum (maximum) element, these generalized ideals turn into ordinary (dual) ideals.
In this paper we present the first known deterministic algorithm for the construction of multiple rank-1 lattices for the approximation of periodic functions of many variables. The algorithm works by converting a potentially large…
The positive semidefinite (psd) rank of a polytope is the size of the smallest psd cone that admits an affine slice that projects linearly onto the polytope. The psd rank of a d-polytope is at least d+1, and when equality holds we say that…
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…
We present a procedure to improve the lattice definition of $\mathcal N = 4$ supersymmetric Yang--Mills theory. The lattice construction necessarily involves U(1) flat directions, and we show how these can be lifted without violating the…
We analyze the factorization process for lattice maps, searching for integrable cases. The maps were assumed to be at most quadratic in the dependent variables, and we required minimal factorization (one linear factor) after 2 steps of…
We construct four families of Artin-Schelter regular algebras of global dimension four. Under some generic conditions, this is a complete list of Artin-Schelter regular algebras of global dimension four that are generated by two elements of…
For fixed large genus, we construct families of complete immersed minimal surfaces in R3 with four ends and dihedral symmetries. The families exist for all large genus and at an appropriate scale degenerate to the plane.
We study the existence of nontrivial and of representable (dual) weak complementations, along with the lattice congruences that preserve them, in different constructions of bounded lattices, then use this study to determine the finite…
New lattice quantizers with lower normalized second moments than previously reported are constructed in 13 and 14 dimensions and conjectured to be optimal. Our construction combines an initial numerical optimization with a subsequent…
Given a polarization of an even unimodular lattice and integer $k\ge 1$, we define a family of unimodular lattices $L(M,N,k)$. Of special interest are certain $L(M,N,3)$ of rank 72. Their minimum norms lie in $\{4, 6, 8\}$. Norms 4 and 6 do…
The so-called min-sum algorithm has been applied for decoding lattices constructed by Construction D'. We generalize this iterative decoding algorithm to decode lattices constructed by Construction D. An upper bound on the decoding…
For each nonnegative integer m we show that any closed, oriented topological four-manifold with fundamental group Z_{4m+2} and odd intersection form, with possibly seven exceptions, either admits no smooth structure or admits infinitely…
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…
The set of permutations on a finite set can be given the lattice structure known as the weak Bruhat order. This lattice structure is generalized to the set of words on a fixed alphabet $\Sigma$ = {x,y,z,...}, where each letter has a fixed…
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…