相关论文: Densest Lattice Packings of 3-Polytopes
We present a method to derive an upper bound for the entropy density of coupled map lattices with local interactions from local observations. To do this, we use an embedding technique being a combination of time delay and spatial embedding.…
Finite density systems can be explored with Lattice QCD through the calculation of multi-hadron correlation functions. Recently, systems with up to 12 $\pi^+$'s or $K^+$'s have been studied to determine the 3-$\pi^+$ and 3-$K^+$…
Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. Combining the use of our data structure for characterizing feasible packings with our new classes of…
Frequent itemsets form a polytope and can be found and analyzed with Linear Programming.
Three symbolic algorithms for testing the integrability of polynomial systems of partial differential and differential-difference equations are presented. The first algorithm is the well-known Painlev\'e test, which is applicable to…
On the basis of physical considerations we propose a one-dimensional discrete lattice model for the density relaxation of granular materials under tapping. Solving the difference equation numerically, we find a logarithmic time-dependence…
The polytope containment problem is deciding whether a polytope is a contained within another polytope. This problem is rooted in computational convexity, and arises in applications such as verification and control of dynamical systems. The…
We announce results about the structure and arithmeticity of all possible lattice embeddings of a class of countable groups which encompasses all linear groups with simple Zariski closure, all groups with non-vanishing first l2-Betti…
We present a new numerical scheme to study systems of non-convex, irregular, and punctured particles in an efficient manner. We employ this method to analyze regular packings of odd-shaped bodies, not only from a nanoparticle but also both…
We establish estimates for the asymptotic best approximation of the Euclidean unit ball by polytopes under a notion of distance induced by the intrinsic volumes. We also introduce a notion of distance between convex bodies that is induced…
This paper introduces a technique for proving the local optimality of packing configurations. Applying this technique to a general convex polygon, we prove that the construction of the optimal double lattice packing by Kuperberg and…
A classical theorem of Minkowski and Hlawka states that there exists a lattice in R^n with packing density at least 2^{1-n}. Buser and Sarnak proved the analogue of this result in the context of complex abelian varieties. Here we give an…
We present here the systematic development of quantitative lattice simulations of dense polymers through a novel computational technique that allows for an efficient accounting of the chain conformations. Our approach is based on the…
We introduce and study a new optimization problem on digraphs, termed Maximum Weighted Digraph Partition (MWDP) problem. We prove three complexity dichotomies for MWDP: on arbitrary digraphs, on oriented digraphs, and on symmetric digraphs.…
Several conditions are given when a packing of equal disks in a torus is locally maximally dense, where the torus is defined as the quotient of the plane by a two-dimensional lattice. Conjectures are presented that claim that the density of…
This is the fifth in a series of papers giving a proof of the Kepler conjecture, which asserts that the density of a packing of congruent spheres in three dimensions is never greater than $\pi/\sqrt{18}\approx 0.74048...$. This is the…
In 2021, Henk, Schymura and Xue introduced packing minima, associated with a convex body and a lattice, as packing counterparts to the covering minima of Kannan and Lov\'asz. Motivated by conjectures on the volume inequalities for the…
The lattice size of a lattice polytope is a geometric invariant which was formally introduced in the context of simplification of the defining equation of an algebraic curve, but appeared implicitly earlier in geometric combinatorics.…
We study the problem of discrete geometric packing. Here, given weighted regions (say in the plane) and points (with capacities), one has to pick a maximum weight subset of the regions such that no point is covered more than its capacity.…
We consider packings of the plane using discs of radius 1 and r=0.545151... . The value of r admits compact packings in which each hole in the packing is formed by three discs which are tangent to each other. We prove that the largest…