Related papers: Foldable Triangulations of Lattice Polygons
We study lattice points in d-dimensional spheres, and count their number in thin spherical segments. We found an upper bound depending only on the radius of the sphere and opening angle of the segment. To obtain this bound we slice the…
Consider a lattice in a real finite dimensional vector space. Here, we are interested in the lattice polytopes, that is the convex hulls of finite subsets of the lattice. Consider the group $G$ of the affine real transformations which map…
Determining the number of embeddings of Laman graph frameworks is an open problem which corresponds to understanding the solutions of the resulting systems of equations. In this paper we investigate the bounds which can be obtained from the…
This article intends to characterize triangular norms on a finite lattice. We first give a method for generating a triangular norm on an atomistic lattice by the values of atoms. Then we prove that every triangular norm on a non-Boolean…
We show factorization formulas for a class of partition functions of rational six vertex model. First we show factorization formulas for partition functions under triangular boundary. Further, by combining the factorization formulas with…
We study a simple lattice model with local symmetry, whose construction is based on a crossed module of finite groups. Its dynamical degrees of freedom are associated both to links and faces of a four-dimensional lattice. In special limits…
We classify general systems of polynomial equations with a single solution, or, equivalently, collections of lattice polytopes of minimal positive mixed volume. As a byproduct, this classification provides an algorithm to evaluate the…
This paper uses mathematics to analyze the challenges of geometrically noisy environments on triangulation. Given widely accepted algorithmic triangulation methods, such as O (n ln n) or a simpler O (n^3) method, we can mathematically prove…
We examine doing probabilistic descent over manifolds implicitly defined by a set of polynomials with rational coefficients. The system of polynomials is assumed to be triangularized. An application of Whitney's embedding theorem allows us…
We describe a procedure that creates an explicit complex-valued polynomial function of three-dimensional space, whose nodal lines are the three-twist knot $5_2$. The construction generalizes a similar approach for lemniscate knots: a braid…
Following Barany et al., who proved that large random lattice zonotopes converge to a deterministic shape in any dimension after rescaling, we establish a central limit theorem for finite-dimensional marginals of the boundary of the…
The problem of counting the different ways of folding the planar triangular lattice is shown to be equivalent to that of counting the possible 3-colorings of its bonds, a dual version of the 3-coloring problem of the hexagonal lattice…
We prove tight upper bounds for the number of vertices of a simple polygon that is the union or the intersection of two simple polygons with given numbers of convex and concave vertices. The similar question on graphs of the lower (or…
The number of lattice points $\left| tP \cap \mathbb{Z}^d \right|$, as a function of the real variable $t>1$ is studied, where $P \subset \mathbb{R}^d$ belongs to a special class of algebraic cross-polytopes and simplices. It is shown that…
We provide a simplified proof of our operator formula for the number of monotone triangles with prescribed bottom row, which enables us to deduce three generalizations of the formula. One of the generalizations concerns a certain weighted…
Orthogonal polynomials with respect to a weight function defined on a wedge in the plane are studied. A basis of orthogonal polynomials is explicitly constructed for two large class of weight functions and the convergence of Fourier…
We prove an exponential upper bound for the number $f(m,n)$ of all maximal triangulations of the $m\times n$ grid: \[ f(m,n) < 2^{3mn}. \] In particular, this improves a result of S. Yu. Orevkov (1999).
We consider various properties and manifestations of some sign-alternating univariate polynomials borne of right-triangular integer arrays related to certain generalizations of the Fibonacci sequence. Using a theory of the root geometry of…
We show upper and lower bounds for angles in iterations of trisections of certain triangulations.
Tarski's theorem states that every monotone function from a complete lattice to itself has a fixed point. We analyze the query complexity of finding such a fixed point on the $k$-dimensional grid of side length $n$ under the $\leq$…