Related papers: On lattices over Fermat function fields
We study the size of the largest rectangle containing no point of a given point set in the two-dimensional torus, the dispersion of the point set. A known lower bound for the dispersion of any point set of cardinality $n\ge 2$ in this…
We investigate a family of lattice models with manifest N=2 supersymmetry. The models describe fermions on a 1D lattice, subject to the constraint that no more than k consecutive lattice sites may be occupied. We discuss the special…
Let $(M,g)$ be a compact manifold and let $-\Delta \phi_k = \lambda_k \phi_k$ be the sequence of Laplacian eigenfunctions. We present a curious new phenomenon which, so far, we only managed to understand in a few highly specialized cases:…
We generalize the Borici-Creutz action in such a way that the position of the second zero and the direction which breaks the hypercubic symmetry can be arbitrarily chosen, and the action has still the correct continuum limit. Minimal…
We investigate the connection between Tamari lattices and the Thompson group F, summarized in the fact that F is a group of fractions for a certain monoid F+sym whose Cayley graph includes all Tamari lattices. Under this correspondence, the…
The lattice $A_n^*$ is an important lattice because of its covering properties in low dimensions. Clarkson \cite{Clarkson1999:Anstar} described an algorithm to compute the nearest lattice point in $A_n^*$ that requires $O(n\log{n})$…
Let $\Lb$ be a lattice in a Euclidean space $E$, with kissing number $s$ and perfection rank $r$, that is, the rank in $\End^{\text{sym}}(E)$ of the set of orthogonal projections to minimal vectors of $\Lb$. This defines a space of…
It was proved by Nill that for any lattice simplex of dimension $d$ with degree $s$ which is not a lattice pyramid, the inequality $d+1 \leq 4s-1$ holds. In this paper, we give a complete characterization of lattice simplices satisfying the…
We demonstrate a probe for nearest-neighbor correlations of fermionic quantum gases in optical lattices. It gives access to spin and density configurations of adjacent sites and relies on creating additional doubly occupied sites by…
A Lattice is a partially ordered set where both least upper bound and greatest lower bound of any pair of elements are unique and exist within the set. K\"{o}tter and Kschischang proved that codes in the linear lattice can be used for error…
Supersymmetry, like Poincare symmetry, is softly broken at finite lattice spacing provided the gaugino mass term is strongly suppressed. Domain wall fermions provide the mechanism for suppressing this term by approximately imposing chiral…
The Shortest Lattice Vector (SLV) problem is in general hard to solve, except for special cases (such as root lattices and lattices for which an obtuse superbase is known). In this paper, we present a new class of SLV problems that can be…
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$.
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 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…
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…
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…
The minimum rank of a simple graph $G$ is the smallest possible rank over all symmetric real matrices $A$ whose nonzero off-diagonal entries correspond to the edges of $G$. Using the zero forcing number, we prove that the minimum rank of…
There has been a recent surge of interest on distributions of shapes of unit lattices in number fields, due to both their applications to number theory and the lack of known results. In this work we focus on $D_4$-quartic fields with…
In this paper, we obtain lower bounds for the domination numbers of connected graphs with girth at least $7$. We show that the domination number of a connected graph with girth at least $7$ is either $1$ or at least…