Related papers: A Note on Sequences of Lattices
The notion of unboundedly order converges has been recieved recently a particular attention by several authors. The main result of the present paper shows that the notion is efficient and deserves that care. It states that a vector lattice…
One of the longstanding problems in universal algebra is the question of which finite lattices are isomorphic to the congruence lattices of finite algebras. This question can be phrased as which finite lattices can be represented as…
We study the geometry and complexity of Voronoi cells of lattices with respect to arbitrary norms. On the positive side, we show for strictly convex and smooth norms that the geometry of Voronoi cells of lattices in any dimension is similar…
We consider a category of all finite partial orderings with quotient maps as arrows and construct a Fra\"iss\'e sequence in this category. Then we use commonly known relations between partial orders and lattices to construct a sequence of…
We show that, for a class of locally solid topologies on vector lattices, a topologically convergent net has an embedded sequence that is unbounded order convergent to the same limit. Our result implies, and often improves, many of the…
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…
In a seminal work, Micciancio & Voulgaris (2013) described a deterministic single-exponential time algorithm for the Closest Vector Problem (CVP) on lattices. It is based on the computation of the Voronoi cell of the given lattice and thus…
Properties of several sorts of lattices of convex subsets of R^n are examined. The lattice of convex sets containing the origin turns out, for n>1, to satisfy a set of identities strictly between those of the lattice of all convex subsets…
In this short note we prove a sharp lower bound for the second moment of a lattice Voronoi cell in terms of the respective covering radius. This gives an affirmative answer to a conjecture by Haviv, Lyubashevsky and Regev. We also…
In a totally ordered set the notion of sorting a finite sequence is defined through a suitable permutation of the sequence's indices. In this paper we prove a simple formula that explicitly describes how the elements of a sequence are…
The classic Voronoi cells can be generalized to a higher-order version by considering the cells of points for which a given $k$-element subset of the set of sites consists of the $k$ closest sites. We study the structure of the $k$-order…
The simple cubic lattice defines a set of points at regular distances. The volume of the Voronoi cells around each point may serve as a weight for integration over the entire space. We add interstitial points to this grid according to the…
We consider complete lattices equipped with preorderings indexed by the ordinals less than a given (limit) ordinal subject to certain axioms. These structures, called stratified complete lattices, and weakly monotone functions over them,…
It is shown that the area of Voronoi cells for a generalized Archimedean spiral lattice converges under some scale normalization, if the angle parameter is badly approximable.
In this paper we are concerned with finding the vertices of the Voronoi cell of a Euclidean lattice. Given a basis of a lattice, we prove that computing the number of vertices is a #P-hard problem. On the other hand we describe an algorithm…
Convergence is a fundamental topic in analysis that is most commonly modelled using topology. However, there are many natural convergences that are not given by any topology; e.g., convergence almost everywhere of a sequence of measurable…
We characterize vector lattices in which unbounded order convergence is eventually order bounded. Among other things, the characterization provides a solution to \cite[Probl.23]{Az}.
We study vertex algebras and their modules associated with possibly degenerate even lattices, using an approach somewhat different from others. Several known results are recovered and a number of new results are obtained. We also study…
We study Voronoi cells in the statistical setting by considering preimages of the maximum likelihood estimator that tessellate an open probability simplex. In general, logarithmic Voronoi cells are convex sets. However, for certain…
We study maximal sublattices of finite semidistributive lattices via their complements. We focus on the conjecture that such complements are always intervals, which is known to be true for bounded lattices. Since the class of…