English
Related papers

Related papers: Non-spanning lattice 3-polytopes

200 papers

It is conjectured since long that each smooth convex body $\mathbf{P}\subset \mathbb{R}^n$ has a point in its interior which belongs to at least $2n$ normals from different points on the boundary of $\mathbf{P}$. The conjecture is proven…

Metric Geometry · Mathematics 2025-09-11 Ivan Nasonov , Gaiane Panina

In this article we introduce the study of the number of pairs of non-comparable elements in a distributive lattice $\L$. We give several tight lower and upper bounds for the number and give as an application the lattices precisely for which…

Combinatorics · Mathematics 2014-05-06 Himadri Mukherjee

We present new examples of topologically convex edge-ununfoldable polyhedra, i.e., polyhedra that are combinatorially equivalent to convex polyhedra, yet cannot be cut along their edges and unfolded into one planar piece without overlap.…

Computational Geometry · Computer Science 2020-07-30 Erik D. Demaine , Martin L. Demaine , David Eppstein

The Minkowski length of a lattice polytope $P$ is a natural generalization of the lattice diameter of $P$. It can be defined as the largest number of lattice segments whose Minkowski sum is contained in $P$. The famous Ehrhart theorem…

Combinatorics · Mathematics 2020-12-22 Ivan Soprunov , Jenya Soprunova

Fix two lattice paths $P$ and $Q$ from $(0,0)$ to $(m,r)$ that use East and North steps with $P $ never going above $Q$. Bonin et al. show that the lattice paths that go from $(0,0)$ to $(m,r)$ and remain bounded by $P$ and $Q$ can be…

Combinatorics · Mathematics 2012-12-27 Hoda Bidkhori

Motivated by questions of Mulmuley and Stanley we investigate quasi-polynomials arising in formulas for plethysm. We demonstrate, on the examples of $S^3(S^k)$ and $S^k(S^3)$, that these need not be counting functions of inhomogeneous…

Representation Theory · Mathematics 2018-02-12 Thomas Kahle , Mateusz Michalek

The invariants of finite-dimensional representations of simple Lie algebras, such as even-degree indices and anomaly numbers, are considered in the context of the non-crystallographic finite reflection groups $H_2$, $H_3$ and $H_4$. Using a…

Mathematical Physics · Physics 2021-01-28 Mariia Myronova , Jiri Patera , Marzena Szajewska

We construct small (50 and 26 points, respectively) point sets in dimension 5 whose graphs of triangulations are not connected. These examples improve our construction in J. Amer. Math. Soc., 13:3 (2000), 611--637 not only in size, but also…

Combinatorics · Mathematics 2007-05-23 Francisco Santos

An equidistant polytope is a special equidistant set in the space $\mathbb{R}^n$ all of whose boundary points have equal distances from two finite systems of points. Since one of the finite systems of the given points is required to be in…

Metric Geometry · Mathematics 2021-12-16 Csaba Vincze , Márk Oláh , Letícia Lengyel

This paper extends the recently obtained complete and continuous map of the Lattice Isometry Space (LISP) to the practical case of dimension 3. A periodic 3-dimensional lattice is an infinite set of all integer linear combinations of basis…

Computational Geometry · Computer Science 2021-09-24 Matthew Bright , Andrew I Cooper , Vitaliy Kurlin

Blind and Mani, and later Kalai, showed that the face lattice of a simple polytope is determined by its graph, namely its $1$-skeleton. Call a vertex of a $d$-polytope \emph{nonsimple} if the number of edges incident to it is more than $d$.…

Combinatorics · Mathematics 2018-03-16 Joseph Doolittle , Eran Nevo , Guillermo Pineda-Villavicencio , Julien Ugon , David Yost

A clean lattice tetrahedron is a non-degenerate tetrahedron with the property that the only lattice points on its boundary are its vertices. We present some new proofs of old results and some new results on clean lattice tetrahedra, with an…

Combinatorics · Mathematics 2007-05-23 Bruce Reznick

In 1997 Oda conjectured that every smooth lattice polytope has the integer decomposition property. We prove Oda's conjecture for centrally symmetric $3$-dimensional polytopes, by showing they are covered by lattice parallelepipeds and…

The h^*-polynomial of a lattice polytope is the numerator of the generating function of the Ehrhart polynomial. Let P be a lattice polytope with h^*-polynomial of degree d and with linear coefficient h^*_1. We show that P has to be a…

Combinatorics · Mathematics 2008-09-29 Benjamin Nill

Let $\mathcal{P} \subset \mathbb{R}^d$ be a lattice polytope of dimension $d$. Let $b(\mathcal{P})$ denote the number of lattice points belonging to the boundary of $\mathcal{P}$ and $c(\mathcal{P})$ that to the interior of $\mathcal{P}$.…

Combinatorics · Mathematics 2024-11-12 Ginji Hamano , Ichiro Sainose , Takayuki Hibi

In this article we consider an open conjecture about coherently labelling a polyhedron in three dimensions. We exhibit all the forty eight possible coherent labellings of a tetrahedron. We also exhibit that some simplicial polyhedra like…

Combinatorics · Mathematics 2022-11-28 C. P. Anil Kumar

We define an invariant of triple-point-free immersions of $2$-spheres into Euclidean $3$-space, taking values in $l^1(\mathbb{Z})$. It remains unchanged under regular homotopies through such immersions. An explicit description of its image…

Geometric Topology · Mathematics 2025-07-02 Jona Seidel

K3 polytopes appear in complements of tropical quartic surfaces. They are dual to regular unimodular central triangulations of reflexive polytopes in the fourth dilation of the standard tetrahedron. Exploring these combinatorial objects, we…

Algebraic Geometry · Mathematics 2019-07-17 Gabriele Balletti , Marta Panizzut , Bernd Sturmfels

Skeletal polyhedra and polygonal complexes in ordinary Euclidean 3-space are finite or infinite 3-periodic structures with interesting geometric, combinatorial, and algebraic properties. They can be viewed as finite or infinite 3-periodic…

Metric Geometry · Mathematics 2014-03-04 Egon Schulte

Each finite configuration of points in the plane determines a corresponding lattice of noncrossing partitions. When these points form the vertex set of a convex polygon, the associated lattice is the classical noncrossing partition lattice…

Combinatorics · Mathematics 2026-04-17 Michael Dougherty , Gina Root
‹ Prev 1 3 4 5 6 7 10 Next ›