Related papers: Amicable Triangle and Rectangles on the Integer La…
It is known that, adding the number of lattice points lying on the boundary of a reflexive polygon and the number of lattice points lying on the boundary of its polar, always yields 12. Generalising appropriately the notion of reflexivity,…
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…
We give a rational form of a generic two-dimensional "quad" map, containing the so-called $Q_4$ case, but whose coefficients are free. Its integrability is proved using the calculation of algebraic entropy.
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…
Recent work by Forsg{\aa}rd indicates that not every convex lattice polygon arises as the characteristic polygon of an affine dimer or, equivalently, an admissible oriented line arrangement on the torus in general position. We begin the…
A rational triangle is a triangle with sides of rational lengths. In this short note, we prove that there exists a unique pair of a rational right triangle and a rational isosceles triangle which have the same perimeter and the same area.…
In the monomer-polymer model, a linear rigid polymer covers $k$ adjacent lattice sites, with no lattice site occupied by more than one polymer. The polymers are called $k$-mers, and those unoccupied lattice sites are called monomers. The…
In this paper we give a classification of tilings of the sphere by congruent quadrilaterals with exactly two equal edges. The tilings are the earth map tilings, $(p,q)$-earth map tilings and their flip modifications, and quadrilateral…
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,…
We study ideal lattices in $\mathbb{R}^2$ coming from real quadratic fields, and give an explicit method for computing all well-rounded twists of any such ideal lattice. We apply this to ideal lattices coming from Markoff numbers to…
Robustness problems due to the substitution of the exact computation on real numbers by the rounded floating point arithmetic are often an obstacle to obtain practical implementation of geometric algorithms. If the adoption of the --exact…
We provide a remarkably simple algorithm to compute all (at most four) common tangents of two disjoint simple polygons. Given each polygon as a read-only array of its corners in cyclic order, the algorithm runs in linear time and constant…
A Tangle is a smooth simple closed curve formed from arcs (or ``links'') of circles with fixed radius. Most previous study of Tangles has dealt with the case where these arcs are quarter-circles, but Tangles comprised of thirds and sixths…
We present algorithms for classifying rational polygons with fixed denominator and number of interior lattice points. Our approach is to first describe maximal polygons and then compute all subpolygons, where we eliminate redundancy by a…
A lattice in the Euclidean space is standard if it has a basis consisting vectors whose norms equal to the length in its successive minima. In this paper, it is shown that with the $L^2$ norm all lattices of dimension $n$ are standard if…
A certain real number, depending on two neighbouring sides of a quadrilateral and the diagonal meeting these two sides at their common point, is shown to be invariant under affinity. As an application we demonstrate a nice formula for the…
A graph $G$ is cordial if there exists a function $f$ from the vertices of $G$ to $\{0,1\}$ such that the number of vertices labelled $0$ and the number of vertices labelled $1$ differ by at most $1$, and if we assign to each edge $xy$ the…
A polymer repelled by unfavorable interactions with a uniform flat surface may still be pinned to attractive edges and corners. This is demonstrated by considering adsorption of a two-dimensional ideal polymer to an attractive corner of a…
Let $\mathbf{F}=\left\langle F,R\right\rangle $ be a finite Kripke frame. A congruence of $\mathbf{F}$ is a bisimulation of $\mathbf{F}$ that is also an equivalence relation on F. The set of all congruences of $\mathbf{F}$ is a lattice…
Let $L$ be a slim, planar, semimodular lattice (slim means that it does not contain an ${\mathsf M}_3$-sublattice). We call the interval $I = [o, i]$ of $L$ \emph{rectangular}, if there are complementary $a, b \in I$ such that $a$ is to the…