Related papers: Lattice Reduced and Complete Convex Bodies
Let $C\subset {\mathbb R}^n$ be a convex body. We introduce two notions of convexity associated to C. A set $K$ is $C$-ball convex if it is the intersection of translates of $C$, or it is either $\emptyset$, or ${\mathbb R}^n$. The $C$-ball…
In this paper, extending the work of Gal'perin (Comm. Math. Phys. 154: 63-84, 1993), we investigate generalizations of the concepts of centroids and static equilibrium points of a convex body in spherical, hyperbolic and normed spaces. In…
We study properties of programs with monotone and convex constraints. We extend to these formalisms concepts and results from normal logic programming. They include the notions of strong and uniform equivalence with their characterizations,…
We study several examples of kinetically constrained lattice models using dynamically accessible volume as an order parameter. Thereby we identify two distinct regimes exhibiting dynamical slowing, with a sharp threshold between them. These…
Following G. Gr\"atzer and E. Knapp (2007), a slim semimodular lattice, SPS lattice for short, is a finite planar semimodular lattice having no $M_3$ as a sublattice. An SPS lattice is a slim rectangular lattice if it has exactly two doubly…
This paper addresses the overwhelming computational resources needed with standard numerical approaches to simulate architected materials. Those multiscale heterogeneous lattice structures gain intensive interest in conjunction with the…
The lattice cohomology of a plumbed 3--manifold $M$ associated with a connected negative definite plumbing graph is an important tool in the study of topological properties of $M$, and in the comparison of the topological properties with…
Given any polytope $P$ and any generic linear functional ${\bf c} $, one obtains a directed graph $G(P,{\bf c})$ from the 1-skeleton of $P$ by orienting each edge $e(u,v)$ from $u$ to $v$ for ${\bf c} (u) < {\bf c} ( v)$. For $P$ a simple…
In this paper, we obtain the best possible value of the absolute constant $C$ such that for every isotropic convex body $K \subseteq \mathbb{R}^n$ the following inequality (which was proved by Klartag and reduces the hyperplane conjecture…
We show that up to unimodular equivalence there are only finitely many d-dimensional lattice polytopes without interior lattice points that do not admit a lattice projection onto a (d-1)-dimensional lattice polytope without interior lattice…
Lattice reduction is a combinatorial optimization problem aimed at finding the most orthogonal basis in a given lattice. The Lenstra-Lenstra-Lov\'asz (LLL) algorithm is the best algorithm in the literature for solving this problem. In light…
A two-dimensional bistable lattice is a periodic triangular network of non-linear bi-stable rods. The energy of each rod is piecewise quadratic and has two minima. Consequently, a rod undergoes a reversible phase transition when its…
Recently, a class of mechanical lattices with reconfigurable, zero-stiffness structures has been proposed, called Totimorphic lattices. In this work, we introduce a computational framework that enables continuous reprogramming of a…
We show by a direct construction that there are at least $\exp\{cV^{(d-1)/(d+1)}\}$ convex lattice polytopes in $\mathbb{R}^d$ of volume $V$ that are different in the sense that none of them can be carried to an other one by a lattice…
Lattice-free sets (convex subsets of $\mathbb{R}^d$ without interior integer points) and their applications for cutting-plane methods in mixed-integer optimization have been studied in recent literature. Notably, the family of all integral…
Deciding whether the union of two convex polyhedra is itself a convex polyhedron is a basic problem in polyhedral computations; having important applications in the field of constrained control and in the synthesis, analysis, verification…
The Fine interior $F(P)$ of a $d$-dimensional lattice polytope $P \subset {\Bbb R}^d$ is the set of all points $y \in P$ having integral distance at least $1$ to any integral supporting hyperplane of $P$. We call a lattice polytope…
The reduction of covering decision systems is an important problem in data mining, and covering-based rough sets serve as an efficient technique to process the problem. Geometric lattices have been widely used in many fields, especially…
We discuss how well a given convex body B in a real d-dimensional vector space V can be approximated by a set X for which the membership question: ``given an x in V, does x belong to X?'' can be answered efficiently (in time polynomial in…
Let $S$ be a set of $n$ points in $\mathbb{R}^d$. A Steiner convex partition is a tiling of ${\rm conv}(S)$ with empty convex bodies. For every integer $d$, we show that $S$ admits a Steiner convex partition with at most $\lceil…