Related papers: Clean Lattice Tetrahedra
In this study, we investigate the lattice angle, which is defined as the angle between two vectors whose components are integers. We focus on the set of angles between a fixed integer vector and other integer vectors. For…
We define noncrossing partitions of a marked surface without punctures (interior marked points). We show that the natural partial order on noncrossing partitions is a graded lattice and describe its rank function topologically. Lower…
A closed, convex set $K$ in $\mathbb{R}^2$ with non-empty interior is called lattice-free if the interior of $K$ is disjoint with $\mathbb{Z}^2$. In this paper we study the relation between the area and the lattice width of a planar…
In 3-dimensional Euclidean space there exist two exceptional polyhedra, the rhombic dodecahedron and the rhombic triacontahedron, the only known polytopes (besides polygons) that are edge-transitive without being vertex-transitive. We show…
We study the folding of the regular triangular lattice in three dimensional embedding space, a model for the crumpling of polymerised membranes. We consider a discrete model, where folds are either planar or form the angles of a regular…
The icosidodecahedron has 30 vertices, one at the center of each edge of a regular icosahedron -- or equivalently, one at the center of each edge of a regular dodecahedron. It is a beautiful, highly symmetrical shape. But it is just a…
Lattice calculations for hadrons are now entering the domain of resonances and scattering, necessitating a better understanding of the observed discrete energy spectrum. This is a reviewing survey about recent lattice QCD results, with some…
A central problem of geometry is the tiling of space with simple structures. The classical solutions, such as triangles, squares, and hexagons in the plane and cubes and other polyhedra in three-dimensional space are built with sharp…
In this paper we give a complete description about normal monohedral tilings of a convex disc with smooth boundary where we have at most three topological discs as tiles. This result is a far-reaching generalization of the results of…
In this paper we construct a three-dimensional (3D) solvable lattice model with non-negative Boltzmann weights. The spin variables in the model are assigned to edges of the 3D cubic lattice and run over an infinite number of discrete…
A Tangle is a smooth simple closed curve formed from arcs (or ``links'') of circles with fixed radius. Most previous study of Tangles has dealt with the case where these arcs are quarter-circles, but Tangles comprised of thirds and sixths…
An edge-unfolding of a polyhedron is produced by cutting along edges and flattening the faces to a *net*, a connected planar piece with no overlaps. A *grid unfolding* allows additional cuts along grid edges induced by coordinate planes…
A ring $R$ is uniquely (strongly) clean provided that for any $a\in R$ there exists a unique idempotent $e\in R \big(\in comm(a)\big)$ such that $a-e\in U(R)$. Let $R$ be a uniquely bleached ring. We prove, in this note, that $R$ is…
We study the lattice width of lattice-free polyhedra given by $\mathbf{A}\mathbf{x}\leq\mathbf{b}$ in terms of $\Delta(\mathbf{A})$, the maximal $n\times n$ minor in absolute value of $\mathbf{A}\in\mathbb{Z}^{m\times n}$. Our main…
Let $\mathcal{B}$ be a compact convex planar domain with smooth boundary of finite type and $\mathcal{B}_\theta$ its rotation by an angle $\theta$. We prove that for almost every $\theta\in[0, 2\pi]$ the remainder…
Lattice-free gradient polyhedra can be used to certify optimality for mixed-integer convex minimization models. We consider how to construct these polyhedra for unconstrained models with two integer variables under the assumption that all…
We investigate a variant of the octahedron recurrence which lives in a 3-dimensional lattice contained in [0,n] x [0,m] x R. Generalizing results of David Speyer math.CO/0402452, we give an explicit non-recursive formula for the values of…
We prove: If a complete connected smooth surface M in euclidean 3-space has general position, intersects some plane along a clean figure-8 (a loop with total curvature zero) and all compact intersections with planes have central symmetry,…
Extending previous results on a characterization of all equilateral triangle in space having vertices with integer coordinates ("in $\mathbb Z^3$"), we look at the problem of characterizing all regular polyhedra (Platonic Solids) with the…
The new concept of a system of hex equations is introduced as an overdetermined system of six five-point face-centered quad equations defined on six vertices of a hexagon. For a consistent system of hex equations, two variables on…