Related papers: Well-Rounded Lattices via Polynomials

The global structure of the unbounded derived category of a truncated polynomial ring on countably many generators is investigated, via its Bousfield lattice. The Bousfield lattice is shown to have cardinality larger than that of the real…

A marked lattice is a $d$-dimensional Euclidean lattice, where each lattice point is assigned a mark via a given random field on ${\mathbb Z}^d$. We prove that, if the field is strongly mixing with a faster-than-logarithmic rate, then for…

For a left vector space V over a totally ordered division ring F, let Co(V) denote the lattice of convex subsets of V. We prove that every lattice L can be embedded into Co(V) for some left F-vector space V. Furthermore, if L is finite…

The coefficients of the chain polynomial of a finite poset enumerate chains in the poset by their number of elements. The chain polynomials of the partition lattices and their standard type $B$ analogues are shown to have only real roots.…

A graph G is well-covered if all its maximal independent sets are of the same cardinality. Assume that a weight function w is defined on its vertices. Then G is w-well-covered if all maximal independent sets are of the same weight. For…

In this note we give a simple proof of the classical fact that the hexagonal lattice gives the highest density circle packing among all lattices in $R^2$. With the benefit of hindsight, we show that the problem can be restricted to the…

In this paper we give the generalization of lifted codes over any finite chain ring. This has been done by using the construction of finite chain rings from $p$-adic fields. Further we propose a lattice construction from linear codes over…

For large ranks, there is no good algorithm that decides whether a given lattice has an orthonormal basis. But when the lattice is given with enough symmetry, we can construct a provably deterministic polynomial-time algorithm to accomplish…

A lattice $\Lambda$ is said to be an extension of a sublattice $L$ of smaller rank if $L$ is equal to the intersection of $\Lambda$ with the subspace spanned by $L$. The goal of this paper is to initiate a systematic study of the geometry…

We initiate a systematic study of lattices of thick subcategories for arbitrary essentially small triangulated categories. To this end we give several examples illustrating the various properties these lattices may, or may not, have and…

We present a riemannian structure on the disk that has a remarkably rich structure. Geodesics are hypocycloids and the (negative of the) laplacian has integer spectrum with multiplicity the Dirichlet divisor function. Eigenfunctions of the…

We consider some distinguished classes of elements of a multiplicative lattice endowed with coarse lower topologies, and call them lower spaces. The primary objective of this paper is to study the topological properties of these lower…

We study some properties of the lattices defined as the kernel of the map $(a_1,\ldots, a_{q-1}) \mapsto \prod (1-c_ix)^{a_i} \in (\mathbb{F}_q[x]/(x^e))^*$, where $\mathbb{F}_q^* = \{c_1,\ldots,c_{q-1}\}$.

Cyclic lattices are sublattices of $\mathbb Z^N$ that are preserved under the rotational shift operator. Cyclic lattices were introduced by D.~Micciancio and their properties were studied in the recent years by several authors due to their…

We show a new framework for constructing good distance lattices from high dimensional expanders. For error-correcting codes, which have a similar flavor as lattices, there is a known framework that yields good codes from expanders. However,…

The range of a trigonometric polynomial with complex coefficients can be interpreted as the image of the unit circle under a Laurent polynomial. We show that this range is contained in a real algebraic subset of the complex plane. Although…

Univariate polynomials are called stable with respect to a domain $D$ if all of their roots lie in $D$. We study linear slices of the space of stable univariate polynomials with respect to a half-plane. We show that a linear slice always…

We study classes of graphs with bounded clique-width that are well-quasi-ordered by the induced subgraph relation, in the presence of labels on the vertices. We prove that, given a finite presentation of a class of graphs, one can decide…

In this short note we use the polynomial partitioning lemma to strengthen a recent result of Dvir and Gopi about the number of rich lines in high dimensional Euclidean spaces. Our result shows that if there are sufficiently many rich lines…

Let $\Lambda$ be any integral lattice in Euclidean space. It has been shown that for every integer $n>0$, there is a hypersphere that passes through exactly $n$ points of $\Lambda$. Using this result, we introduce new lattice invariants and…