Related papers: Lattice angles of lattice polygons
We introduce here a general framework for studying continued fraction expansions for complex numbers and establish some results on the convergence of the corresponding sequence of convergents. For continued fraction expansions with partial…
A lattice point in $\mathbb{R}^2$ is a point $(x,y)$ with $x,y\in\mathbb{Z}$, and a lattice triangle is a triangle whose three vertices are all lattice points. We investigate the integers $k$ with the property that if $T$ is a lattice…
We examine a class of geometric theorems on cyclic 2n-gons. We prove that if we take n disjoint pairs of sides, each pair separated by an even number of polygon sides, then there is a linear combination of the angles between those sides…
We introduce and study arithmetic polygons. We show that these arithmetic polygons are connected to triples of square pyramidal numbers. For every odd $N\geq3$, we prove that there is at least one arithmetic polygon with $N$ sides. We also…
In this note we classify all triples (a,b,i) such that there is a convex lattice polygon P with area a, and b respectively i lattice points on the boundary respectively in the interior. The crucial lemma for the classification is the…
These are notes from the lectures I gave at the Oberwolfach seminar `Tensor Triangular Geometry and Interactions' which was held in October 2025. The aim of these notes is to give an introduction to tensor triangular geometry, for both…
In this paper, we prove new upper bounds for sums of reciprocals of fractional parts over general aligned boxes, thus extending a previous result of the author concerning bounds for sums of reciprocals over symmetric boxes. These new upper…
We generalize Ehrhart's idea of counting lattice points in dilated rational polytopes: Given a rational simplex, that is, an n-dimensional polytope with n+1 rational vertices, we use its description as the intersection of n+1 halfspaces,…
In this small paper we bring together various open problems on geometric multidimensional continued fractions.
A periodic lattice in Euclidean 3-space is the infinite set of all integer linear combinations of basis vectors. Any lattice can be generated by infinitely many different bases. This ambiguity was only partially resolved, but standard…
We study geometric consistency relations between angles on 3-dimensional (3D) circular quadrilateral lattices -- lattices whose faces are planar quadrilaterals inscribable into a circle. We show that these relations generate canonical…
We describe a simple method that produces automatically closed forms for the coefficients of continued fractions expansions of a large number of special functions. The function is specified by a non-linear differential equation and initial…
Finite fields form an important chapter in abstract algebra, and mathematics in general. We aim to provide a geometric and intuitive model for finite fields, involving algebraic numbers, in order to make them accessible and interesting to a…
In Lett. Math. Phys. 114, 54 (2024) and 115, 70 (2025), the author introduces what is presented as a novel method for determining whether a sequence of orthogonal polynomials is "classical", based solely on its initial recurrence…
We use the residue theorem to derive an expression for the number of lattice oints in a dilated n-dimensional tetrahedron with vertices at lattice points on each coordinate axis and the origin. This expression is known as the Ehrhart…
Some particular examples of classical and quantum systems on the lattice are solved with the help of orthogonal polynomials and its connection to continuous models are explored.
Our goal is to finally settle the persistent problem in Diophantine Approximation of finding best linear approximates. Classical results from the theory of continued fractions provide the solution for the special homogeneous case in the…
This paper treats triangles in the plane whose vertices lie on the integer lattice, i.e., the vertices have integer coordinates. It shows that apart from trivial examples, the circumcenter, centroid and orthocenter of such triangles never…
The interior hull of a lattice polygon is the convex closure of the lattice points in the interior of the polygon. In this paper we give a concrete description of the interior hull of a clean lattice parallelogram. A clean parallelogram in…
The evaluation of the interaction between objects arranged on a lattice requires the computation of lattice sums. A scenario frequently encountered are systems governed by the Helmholtz equation in the context of electromagnetic scattering…