Related papers: Foldable Triangulations of Lattice Polygons

The connection of orthogonal polynomials on the unit circle (OPUC) to the defocusing Ablowitz-Ladik integrable system involves the definition of a Poisson structure on the space of Verblunsky coefficients. In this paper, we compute the…

We prove that for any knot $K$, there exists a one-vertex triangulation of the $3$-sphere containing an edge forming $K$. The proof is constructive, and based on fully augmented links. We use our method to produce ``complicated'' simplicial…

We show that any two geometric triangulations of a closed hyperbolic, spherical or Euclidean manifold are related by a sequence of Pachner moves and barycentric subdivisions of bounded length. This bound is in terms of the dimension of the…

We discuss methods to construct a polynomial parametrization of some interesting knotted surfaces (knotted spheres, knotted tori and knotted planes) and provide examples.

Given an irreducible root system, the Worpitzky-compatible subsets are defined by a geometric property of the alcoves inside the fundamental parallelepiped of the root system. This concept is motivated and mainly understood through a…

For real polynomials with (sparse) exponents in some fixed set, \[ \Psi(t)=x+y_1t^{k_1}+\ldots +y_L t^{k_L}, \] we analyse the types of root structures that might occur as the coefficients vary. We first establish a stratification of roots…

We give upper bounds on the minimal degree of a model in $\mathbb{P}^2$ and the minimal bidegree of a model in $\mathbb{P}^1 \times \mathbb{P}^1$ of the curve defined by a given Laurent polynomial, in terms of the combinatorics of the…

A theorem of Scott gives an upper bound for the normalized volume of lattice polygons with exactly $i>0$ interior lattice points. We will show that the same bound is true for the normalized volume of lattice polytopes of degree 2 even in…

In this paper we consider arbitrary hexagons on the triangular lattice with three arbitrary bowtie-shaped holes, whose centers form an equilateral triangle. The number of lozenge tilings of such general regions is not expected --- and…

We present a lattice algorithm specifically designed for some classical applications of lattice reduction. The applications are for lattice bases with a generalized knapsack-type structure, where the target vectors are boundably short. For…

We give a short proof of the contractibility of the space of geodesic triangulations with fixed combinatorial type of a convex polygon in the Euclidean plane. Moreover, for any $n>0$, we show that there exists a space of geodesic…

Rectangular standard Young tableaux with 2 or 3 rows are in bijection with $U_q(\mathfrak{sl}_2)$-webs and $U_q(\mathfrak{sl}_3)$-webs respectively. When $W$ is a web with a reflection symmetry, the corresponding tableau $T_W$ has a…

Given a real cubic function $f(x)$ with three roots, take an equilateral triangle $ABC$, the projections of which vertices are the roots of $f(x)$. There is a folklore fact that the vertical lines through the extrema of $f(x)$ are tangent…

The simple cubic lattice defines a set of points at regular distances. The volume of the Voronoi cells around each point may serve as a weight for integration over the entire space. We add interstitial points to this grid according to the…

We give the distribution functions, the expected values, and the moments of linear combinations of lattice polynomials from the uniform distribution. Linear combinations of lattice polynomials, which include weighted sums, linear…

In this paper, we are interested in flat metric structures with conical singularities on surfaces which are obtained by deforming translation surface structures. The moduli space of such flat metric structures can be viewed as some…

A polynomial triangle is an array whose inputs are the coefficients in integral powers of a polynomial. Although polynomial coefficients have appeared in several works, there is no systematic treatise on this topic. In this paper we plan to…

Many polytopes arising in polyhedral combinatorics are linear projections of higher-dimensional polytopes with significantly fewer facets. Such lifts may yield compressed representations of polytopes, which are typically used to construct…

A polymer folding model on the square lattice is constructed with attractive contact interactions of strength 1/c^2, 0<c<1. The corresponding model on a dynamical random lattice, with freely fluctuating co-ordination number at each vertex,…

We study lower bounds for the self-intersection of the canonical divisor of "canonical varieties" (i.e. varieties whose canonical linear system gives a birational map). We give some improvements for the known results in the case of surfaces…