Related papers: Foldable Triangulations of Lattice Polygons

Regular triangulations of products of lattice polytopes are constructed with the additional property that the dual graphs of the triangulations are bipartite. The (weighted) size difference of this bipartition is a lower bound for the…

In this paper, we prove that the set of triangulations of a polygon can be equipped with an order to become a lattice. First, we define this order. In [HN99], authors defined the flip operator and then prove some properties of the graph of…

We obtain exact, simple and very compact expressions for the linearization coefficients of the products of orthogonal polynomials; both the conventional Clebsch-Gordan-type and the modified version. The expressions are general depending…

We study certain generic systems of real polynomial equations associated with triangulations of convex polytopes and investigate their number of real solutions. Our main focus is set on pairs of plane algebraic curves which form a so-called…

We enumerate rooted triangulations of a sphere with multiple holes by the total number of edges and the length of each boundary component. The proof relies on a combinatorial identity due to W.T. Tutte.

In this paper we establish bounds on the number of vertices for a few classes of convex sublattice-free lattice polygons. The bounds are essential for proving the formula for the critical number of vertices of a lattice polygon that ensures…

The paper concerns lattice triangulations, that is, triangulations of the integer points in a polygon in $\mathbb{R}^2$ whose vertices are also integer points. Lattice triangulations have been studied extensively both as geometric objects…

In this paper we study properties of lattice trigonometric functions of lattice angles in lattice geometry. We introduce the definition of sums of lattice angles and establish a necessary and sufficient condition for three angles to be the…

We answer a question of Vorobets by showing that the lattice property for flat surfaces is equivalent to the existence of a positive lower bound for the areas of affine triangles. We show that the set of affine equivalence classes of…

In this paper we prove new lower bounds for the minimum distance of a toric surface code defined by a convex lattice polygon P. The bounds involve a geometric invariant L(P), called the full Minkowski length of P which can be easily…

In this survey on combinatorial properties of triangulated manifolds we discuss various lower bounds on the number of vertices of simplicial and combinatorial manifolds. Moreover, we give a list of all known examples of vertex-minimal…

Given a combinatorial triangulation of an $n$-gon, we study (a) the space of all possible drawings in the plane such the edges are straight line segments and the boundary has a fixed shape, and (b) the algebraic variety of possibilities for…

Let $f(m,n)$ be the number of primitive lattice triangulations of $m\times n$ rectangle. We compute the limits $\lim_n f(m,n)^{1/n}$ for $m=2$ and $3$. For $m=2$ we obtain the exact value of the limit which is equal to $(611+\sqrt{73})/36$.…

We give a formula for the number of symmetric tilings of hexagons on the triangular lattice with unit triangles removed from arbitrary positions along two non-adjacent non-opposite sides. We show that for certain families of such regions,…

We express Wronskian Hermite polynomials in the Hermite basis and obtain an explicit formula for the coefficients. From this we deduce an upper bound for the modulus of the roots in the case of partitions of length 2. We also derive a…

For a d-dimensional convex lattice polytope P, a formula for the boundary volume is derived in terms of the number of boundary lattice points on the first $\floor{d/2}$ dilations of P. As an application we give a necessary and sufficient…

This paper is dedicated to a lattice analog to the classical ``sum of interior angles of a polygon theorem''. In 2008, the first formula expressing conditions on the geometric continued fractions for lattice angles of triangles was derived,…

Products of simplices, called simplotopes, and their triangulations arise naturally in algorithmic applications in game theory and optimization. We develop techniques to derive lower bounds for the size of simplicial covers and…

We provide the twisted Alexander polynomials of finite abelian covers over three-dimensional manifolds whose boundary is a finite union of tori. This is a generalization of a well-known formula for the usual Alexander polynomial of knots in…

We consider random lattice triangulations of $n\times k$ rectangular regions with weight $\lambda^{|\sigma|}$ where $\lambda>0$ is a parameter and $|\sigma|$ denotes the total edge length of the triangulation. When $\lambda\in(0,1)$ and $k$…