Related papers: Geometric lattice structure of covering-based roug…
We propose a relax-and-round approach combined with a greedy search strategy for performing complex lattice basis reduction. Taking an optimization perspective, we introduce a relaxed version of the problem that, while still nonconvex, has…
A generic method for combinatorial constructions of intrinsic geometrical spaces is presented. It is based on the well known inverse sequences of finite graphs that determine (in the limit) topological spaces. If a pattern of the…
In this review, we count and classify certain sublattices of a given lattice, as motivated by crystallography. We use methods from algebra and algebraic number theory to find and enumerate the sublattices according to their index. In…
We prove an identity for five arguments, valid in the lattice of natural numbers with gcd and lcm as lattice operations. More generally, this identity characterizes arbitrary distributive lattices. Fixing three of the five arguments, we…
The theory of matroids or combinatorial geometries originated in linear algebra and graph theory, and has deep connections with many other areas, including field theory, matching theory, submodular optimization, Lie combinatorics, and total…
In his seminal 1983 paper, Jim Lawrence introduced lopsided sets and featured them as asymmetric counterparts of oriented matroids, both sharing the key property of strong elimination. Moreover, symmetry of faces holds in both structures as…
The notion of multidimensional quadrilateral lattice is introduced. It is shown that such a lattice is characterized by a system of integrable discrete nonlinear equations. Different useful formulations of the system are given. The…
Lattice structures have been widely used in various applications of additive manufacturing due to its superior physical properties. If modeled by triangular meshes, a lattice structure with huge number of struts would consume massive…
We propose a novel type of planar-to-spatial deployable structures that we call elastic geodesic grids. Our approach aims at the approximation of freeform surfaces with spatial grids of bent lamellas which can be deployed from a planar…
Architected materials possessing physico-chemical properties adaptable to disparate environmental conditions embody a disruptive new domain of materials science. Fueled by advances in digital design and fabrication, materials shaped into…
Geometric modeling by constraints, whose applications are of interest to communities from various fields such as mechanical engineering, computer aided design, symbolic computation or molecular chemistry, is now integrated into standard…
Using the combinatorics of two interpenetrating face centered cubic lattices together with the part of calculus naturally encoded in combinatorial topology, we construct from first principles a lattice model of 3D incompressible…
The use of multigrid and related preconditioners with the finite element method is often limited by the difficulty of applying the algorithm effectively to a problem, especially when the domain has a complex shape or adaptive refinement. We…
Geometric lattices are characterized in this paper as those finite, atomic lattices such that every atom ordering induces a lexicographic shelling given by an edge labeling known as a minimal labeling. Equivalently, geometric lattices are…
Topological defects play a fundamental role in the investigation of symmetries in quantum field theories. For conformal field theories in two space-time dimensions, it is possible to construct these defects using lattice models allowing…
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 $d$-dimensional (bar-and-joint) framework $(G,p)$ consists of a graph $G=(V,E)$ and a realisation $p:V\to \mathbb{R}^d$. It is rigid if every continuous motion of the vertices which preserves the lengths of the edges is induced by an…
The practical application of a new class of coprime arrays based on the Chinese remainder theorem (CRT) over quadratic fields is presented in this paper. The proposed CRT arrays are constructed by ideal lattices embedded from coprime…
We propose a recursive lattice reduction framework for finding short non-zero vectors or dense sublattices of a lattice. The framework works by recursively searching for dense sublattices of dense sublattices (or their duals) with…
In this paper, we study two classic optimization problems: minimum geometric dominating set and set cover. In the dominating-set problem, for a given set of objects in {the} plane as input, the objective is to choose a minimum number of…