Related papers: On lattice extensions
Given a finite set of lattice points, we compare its sumsets and lattice points in its dilated convex hulls. Both of these are known to grow as polynomials. Generally, the former are subsets of the latter. In this paper, we will see that…
In this article, we prove that finite semidistributive lattices are dismantlable if and only if they are planar. This extends a well-known result by Kelly and Rival that states the same property for finite distributive lattices. Moreover,…
By median we mean a scheme that inputs three element of a lattice, and outputs an element that is an average of the three inputs in a certain sense. The medians of a given finite lattice form a new lattice that is usually larger than the…
In this paper, we show that for each lattice basis, there exists an equivalent basis which we describe as ``strongly reduced''. We show that bases reduced in this manner exhibit rather ``short'' basis vectors, that is, the length of the…
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…
The paper deals with ring extensions $R\subseteq S$ and their lattices $[R,S]$ of subextensions and is mainly devoted to FCP extensions (extensions whose lattices are Artinian and Noetherian). The object of the paper is the introduction and…
We study lattice points in d-dimensional spheres, and count their number in thin spherical segments. We found an upper bound depending only on the radius of the sphere and opening angle of the segment. To obtain this bound we slice the…
This paper explores alternative statements of the axioms for lattice gluing, focusing on lattices that are modular, locally finite, and have finite covers, but may have infinite height. We give a set of "maximal" axioms that maximize what…
A lattice polytope $P$ is called IDP if any lattice point in its $k$th dilate is a sum of $k$ lattice points in $P$. In 1991 Stanley proved a strong inequality in Ehrhart theory for IDP lattice polytopes. We show that his conclusion holds…
It is shown that every scalar linear quadrilateral lattice equation lies within a family of similar equations, members of which are compatible between one another on a higher dimensional lattice. There turn out to be two such families, a…
The ground spaces of a vector space of hermitian matrices, partially ordered by inclusion, form a lattice constructible from top to bottom in terms of intersections of maximal ground spaces. In this paper we characterize the lattice…
Let I be a dense linear order with a left endpoint but no right endpoint. We consider the lattice L(I) of finite unions of closed intervals of I. This lattice arises naturally in the setting of o-minimality, as these are precisely the…
In [Mor], we have introduced a notion of flat laminations on surfaces endowed with a flat structure, similar to geodesic laminations on hyperbolic surfaces. Here is a sequel to this article that aims at defining transversal measures on flat…
Given a euclidean lattice and a curve in the corresponding projective space, our goal is to relate the height of the curve to the successive minima of the lattice. The proof of such a statement in http://hal.archves-ouvertes.vf/hal-00270564…
For a regular coupled cell network, synchrony subspaces are the polydiagonal subspaces that are invariant under the network adjacency matrix. The complete lattice of synchrony subspaces of an $n$-cell regular network can be seen as an…
A detailed combinatorial analysis of planar convex lattice polygonal lines is presented. This makes it possible to answer an open question of Vershik regarding the existence of a limit shape when the number of vertices is constrained.
The purpose of this paper is to address a manifold-based version of Whitney's extension problem: Given a compact set $E\subset\mathbb{R}^n$, how can we tell if there exists a $d$-dimensional, $C^m$-smooth manifold $\mathcal{M}\supset E$? We…
The concept of representing a polytope that is associated with some combinatorial optimization problem as a linear projection of a higher-dimensional polyhedron has recently received increasing attention. In this paper (written for the…
For a slim, planar, semimodular lattice, G. Cz\'edli and E.\,T. Schmidt introduced the fork extension in 2012. In this note we prove that the fork extension has the Congruence Extension Property. This paper has been merged with Part II,…
We describe a polynomial time algorithm for, given an undirected graph G, finding the minimum dimension d such that G may be isometrically embedded into the d-dimensional integer lattice Z^d.