Related papers: Connection points on double regular polygons

We explicitly compute the limiting slope gap distribution for saddle connections on any 2n-gon. Our calculations show that the slope gap distribution for a translation surface is not always unimodal, answering a question of Athreya. We also…

Using the transfer principle, we classify the periodic points on the regular $n$-gon and double $n$-gon translation surfaces and deduce consequences for the finite blocking problem on rational triangles that unfold to these surfaces.

An oblivious point on a translation surface is a point with no closed geodesic passing through it. Nguyen, Pan, and Su (2017) showed that there are at most finitely many oblivious points on any given translation surface and constructed a…

We define an infinite series of translation coverings of Veech's double-n-gon for odd n greater or equal to 5 which share the same Veech group. Additionally we give an infinite series of translation coverings with constant Veech group of a…

A translation surface is a surface formed by identifying edges of a collection of polygons in the complex plane that are parallel and of equal length using only translations. We determined that the same circle packing can be realized on…

We study flat metrics arising from right regular $n$-prisms by viewing them as $n$-differentials and analyzing their associated unfoldings. We show that the unfolding of a right regular $n$-prism is never a lattice surface unless $n=4$, in…

Translation surfaces with poles correspond to meromorphic differentials on compact Riemann surfaces. They appear in compactifications of strata of the moduli space of Abelian differentials and in the study of stability conditions. Such…

In the paper ``Lower bounds on the number of crossing-free subgraphs of $K_N$'' (Computational Geometry 16 (2000), 211-221), it is shown that a double chain of $n$ points in the plane admits at least $\Omega(4.642126305^n)$ polygonizations,…

We consider saddle connections on a translation surface in a hyperelliptic connected component of a stratum that do not intersect the interior of a distinguished saddle connection. For this restricted set of saddle connections, we show that…

A translation surface is given by polygons in the plane, with sides identified by translations to create a closed Riemann surface with a flat structure away from finitely many singular points. Understanding geodesic flow on a surface…

We consider the following problem: Given a set $S$ of $n$ distinct points in the plane, how many edge-disjoint plane straight-line spanning paths can be drawn on $S$? Each spanning path must be crossing-free, but edges from different paths…

Let P be a set of n points in the plane, not all on a line. We show that if n is large then there are at least n/2 ordinary lines, that is to say lines passing through exactly two points of P. This confirms, for large n, a conjecture of…

Flip graphs of non-crossing configurations in the plane are widely studied objects, e.g., flip graph of triangulations, spanning trees, Hamiltonian cycles, and perfect matchings. Typically, it is an easy exercise to prove connectivity of a…

Given a finite set $ S $ of points, we consider the following reconfiguration graph. The vertices are the plane spanning paths of $ S $ and there is an edge between two vertices if the two corresponding paths differ by two edges (one…

Given a regular $n$-gon on the plane, it is evident that from any point on the plane, taken as a center, one can draw $n$ concentric circles such that each circle passes through one of the vertices of the polygon. Naturally, this raises the…

Flat surfaces that correspond to $k$-differentials on compact Riemann surfaces are of finite area provided there is no pole of order $k$ or higher. We denote by \textit{flat surfaces with poles of higher order} those surfaces with flat…

Given a surface with boundary and some points on its boundary, a polygon diagram is a way to connect those points as vertices of non-overlapping polygons on the surface. Such polygon diagrams represent non-crossing permutations on a surface…

We study supersolvable line arrangements in ${\mathbb P}^2$ over the reals and over the complex numbers, as the first step toward a combinatorial classification. Our main results show that a nontrivial (i.e., not a pencil or near pencil)…

We explore under what conditions one can obtain a nontrivial knot, given a collection of $n$ vectors. First, we show how to get a crossing from any 3 vectors equal in magnitude, by arbitrarily picking 2 vectors and identifying the…

We study noncrossing geometric graphs and their disjoint compatible geometric matchings. Given a cycle (a polygon) P we want to draw a set of pairwise disjoint straight-line edges with endpoints on the vertices of P such that these new…