相关论文: Lattice polygons and the number 2i+7
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}$.…
If $\mathcal{B}\subset \mathbb{R}^d$ ($d\geqslant 2$) is a compact convex domain with a smooth boundary of finite type, we prove that for almost every rotation $\theta\in SO(d)$ the remainder of the lattice point problem, $P_{\theta…
We find tight estimates for the minimum number of proper subspaces needed to cover all lattice points in an n-dimensional convex body symmetric about the origin. We also find the order of magnitude of the number of (n-1)-dimensional…
We develop a procedure for the complete computational enumeration of lattice $3$-polytopes of width larger than one, up to any given number of lattice points. We also implement an algorithm for doing this and enumerate those with at most…
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,…
In 1980, V. I. Arnold studied the classification problem for convex lattice polygons of a given area. Since then, this problem and its analogues have been studied by many authors, including B\'ar\'any, Lagarias, Pach, Santos, Ziegler and…
We introduce the property of convex normality of rational polytopes and give a dimensionally uniform lower bound for the edge lattice lengths, guaranteeing the property. As an application, we show that if every edge of a lattice d-polytope…
A self-avoiding polygon is a lattice polygon consisting of a closed self-avoiding walk on a square lattice. Surprisingly little is known rigorously about the enumeration of self-avoiding polygons, although there are numerous conjectures…
A well-known conjecture states that the Whitney numbers of the second kind of a geometric lattice (simple matroid) are logarithmically concave. We show this conjecture to be equivalent to proving an upper bound on the number of new copoints…
We consider two sequences of orthogonal polynomials $(P_n)_{n\geq 0}$ and $(Q_n)_{n\geq 0}$ such that $$ \sum_{j=1} ^{M} a_{j,n}\mathrm{S}_x\mathrm{D}_x ^k P_{k+n-j} (z)=\sum_{j=1} ^{N} b_{j,n}\mathrm{D}_x ^{m} Q_{m+n-j} (z)\;, $$ with…
We present a method of general applicability for finding exact or accurate approximations to bond percolation thresholds for a wide class of lattices. To every lattice we sytematically associate a polynomial, the root of which in $[0,1]$ is…
The parametric lattice-point counting problem is as follows: Given an integer matrix $A \in Z^{m \times n}$, compute an explicit formula parameterized by $b \in R^m$ that determines the number of integer points in the polyhedron $\{x \in…
We give a new combinatorial proof for the number of convex polyominoes whose minimum enclosing rectangle has given dimensions. We also count the subclass of these polyominoes that contain the lower left corner of the enclosing rectangle…
Pick's theorem is used to prove that if $P$ is a lattice polygon (that is, the convex hull of a finite set of lattice points in the plane), then every lattice point in the $h$-fold sumset $hP$ is the sum of $h$ lattice points in $P$.
We provide a complete classification up to isomorphism of all smooth convex lattice 3-polytopes with at most 16 lattice points. There exist in total 103 different polytopes meeting these criteria. Of these, 99 are strict Cayley polytopes…
The lattice size of a lattice polytope $P$ was defined and studied by Schicho, and Castryck and Cools. They provided an "onion skins" algorithm for computing the lattice size of a lattice polygon $P$ in $\mathbb{R}^2$ based on passing…
This paper is concerned with configurations of points in a plane lattice which determine angles that are rational multiples of $\pi$. We shall study how many such angles may appear in a given lattice and in which positions, allowing the…
Two polygons are amicable if the perimeter of one is equal to the area of the other and vice versa. A polygon is a lattice polygon if its vertices are on the integer lattice $\Z^2$. We show that there is one pair of amicable lattice…
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…
Let $\Pi$ be a convex decomposition of a set $P$ of $n\geq 3$ points in general position in the plane. If $\Pi$ consists of more than one polygon, then either $\Pi$ contains a deletable edge or $\Pi$ contains a contractible edge.