Related papers: Lattices with exponentially large kissing numbers …

We conjecture recurrence relations satisfied by the degrees of some linearizable lattice equations. This helps to prove linear growth of these equations. We then use these recurrences to search for lattice equations that have linear growth…

We map certain highly correlated electron systems on lattices with geometrical frustration in the motion of added particles or holes to the spatial defect-defect correlations of dimer models in different geometries. These models are studied…

In this article we introduce the study of the number of pairs of non-comparable elements in a distributive lattice $\L$. We give several tight lower and upper bounds for the number and give as an application the lattices precisely for which…

We show that the number $p\_d$ of non-similar perfect $d$-dimensional lattices satisfies eventually the inequalities$e^{d^{1-\epsilon}}<p\_d<e^{d^{3+\epsilon}}$ for arbitrary smallstrictly positive $\epsilon$.

We consider a class of stochastic growth models on the integer lattice which includes various interesting examples such as the number of open paths in oriented percolation and the binary contact path process. Under some mild assumptions, we…

We prove an exponential approximation for the law of approximate occurrence of typical patterns for a class of Gibssian sources on the lattice $\mathbb{Z}^d$, $d\ge2$. From this result, we deduce a law of large numbers and a large deviation…

We prove the existence of lattice isomorphic line arrangements having $\pi_1$-equivalent or homotopy-equivalent complements and non homeomorphic embeddings in the complex projective plane. We also provide two explicit examples, one is…

We show that the lattice Hadwiger number of superballs is exponential in the dimension. The same is true for some more general convex bodies.

A new upper bound $\kappa_T(K_n)\leq 2.9162^{(1+o(1))n}$ for the translative kissing number of the $n$-dimensional cross-polytope $K_n$ is proved, improving on Hadwiger's bound $\kappa_T(K_n)\leq 3^n-1$ from 1957. Furthermore, it is shown…

We find sharp absolute constants $C_1$ and $C_2$ with the following property: every well-rounded lattice of rank 3 in a Euclidean space has a minimal basis so that the solid angle spanned by these basis vectors lies in the interval…

In this paper, we characterize the congruences of an arbitrary i--lattice, investigate the structure of the lattice they form and how it relates to the structure of the lattice of lattice congruences, then, for an arbitrary non--zero…

By a twenty year old result of Ralph Freese, an $n$-element lattice $L$ has at most $2^{n-1}$ congruences. We prove that if $L$ has less than $2^{n-1}$ congruences, then it has at most $2^{n-2}$ congruences. Also, we describe the…

I discuss the usefulness of lattice supersymmetry in relation to string phenomenology. I suggest how lattice results might be incorporated into string phenomenology. I outline difficulties and describe some constructions that contain an…

We investigate the following question: how close can two disjoint lattice polytopes contained in a fixed hypercube be? This question stems from various contexts where the minimal distance between such polytopes appears in complexity bounds…

We show that real tight frames that generate lattices must be rational, and use this observation to describe a construction of lattices from vertex transitive graphs. In the case of irreducible group frames, we show that the corresponding…

We provide a simple proof of the Lieb-Robinson bound and use it to prove the existence of the dynamics for interactions with polynomial decay. We then use our results to demonstrate that there is an upper bound on the rate at which…

We consider a variation of Construction A of lattices from linear codes based on two classes of number fields, totally real and CM Galois number fields. We propose a generic construction with explicit generator and Gram matrices, then focus…

In the first part of the paper, we consider the relation between kissing number and the secrecy gain. We show that on an $n=24m+8k$-dimensional even unimodular lattice, if the shortest vector length is $\geq 2m$, then as the number of…

This note presents an interesting counterexample to a basic covering problem.

We show that on an $n=24m+8k$-dimensional even unimodular lattice, if the shortest vector length is $\geq 2m$, then as the number of vectors of length $2m$ decreases, the secrecy gain increases. We will also prove a similar result on…