Related papers: Connection points on double regular polygons

The conjugacy class of a generic unimodular 2 by 2 complex matrix is determined by its trace, which may be an arbitrary complex number. In the nineteenth century, it was known that a generic pair (X,Y) of such pairs is determined up to…

We explicitly compute the limiting gap distribution for slopes of saddle connections on the flat surface associated to the regular octagon with opposite sides identified. This is the first such computation where the Veech group of the…

A space is `n-arc connected' (n-ac) if any family of no more than n-points are contained in an arc. For graphs the following are equivalent: (i) 7-ac, (ii) n-ac for all n, (iii) continuous injective image of a closed sub-interval of the…

We confirm the following conjecture of Fekete and Woeginger from 1997: for any sufficiently large even number $n$, every set of $n$ points in the plane can be connected by a spanning tour (Hamiltonian cycle) consisting of straight-line…

Consider 2n points on the unit circle and a reference dissection D of the convex hull of the odd points. The accordion complex of D is the simplicial complex of subsets of pairwise noncrossing diagonals with even endpoints that cross a…

Whitehead doubles provide a plethora of examples of knots that are topologically slice but not smoothly slice. We discuss the problem of the Whitehead double of the Figure 8 knot and survey commonly used techniques to obstructing sliceness.…

We study combinatorial configurations with the associated point and line graphs being strongly regular. Examples not belonging to known classes such as partial geometries and their generalizations or elliptic semiplanes are constructed.…

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…

By the famous ADE classification rational double points are simple. Rational triple points are also simple. We conjecture that the simple normal surface singularities are exactly those rational singularities, whose resolution graph can be…

We construct some canonically defined central extensions of groups of symplectomorphisms. We show that this central extension is nontrivial in the case of a torus of dimension $\ge 6$ and in the case of a two-dimensional surface of genus…

In this paper we classify non-symplectic automorphisms of order 8 on complex K3 surfaces in case that the fourth power of the automorphism has only rational curves in its fixed locus. We show that the fixed locus is the disjoint union of a…

Consider two regions in the plane, bounded by an $n$-gon and an $m$-gon, respectively. At most how many connected components can there be in their intersection? This question was asked by Croft. We answer this asymptotically, proving the…

In this work, we solve the problem of finding non-intersecting paths between points on a plane with a new approach by borrowing ideas from geometric topology, in particular, from the study of polygonal schema in mathematics. We use a…

We show that every 2nd order ODE defines a 4-parameter family of projective connections on its 2-dimensional solution space. In a special case of ODEs, for which a certain point transformation invariant vanishes, we find that this family of…

Except for the Hermitian buildings $\mathcal{H}(4,q^2)$, up to a combination of duality, translation duality or Payne integration, every known finite building of type $\mathbb{B}_2$ satisfies a set of general synthetic properties, usually…

For a given finite subset P of points of the lattice Z^2, a friendly path is a monotone (uphill or downhill) lattice path which splits points in half; points lying on the path itself are discarded. The purpose of this paper (and its sequel)…

We consider connectivity properties of certain i.i.d. random environments on $\Z^d$, where at each location some steps may not be available. Site percolation and oriented percolation can be viewed as special cases of the models we consider.…

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…

A set P of points in R^2 is n-universal, if every planar graph on n vertices admits a plane straight-line embedding on P. Answering a question by Kobourov, we show that there is no n-universal point set of size n, for any n>=15. Conversely,…

In this paper we study quadratic points on the non-split Cartan modular curves $X_{ns}(p)$, for $p = 7, 11,$ and $13$. Recently, Siksek proved that all quadratic points on $X_{ns}(7)$ arise as pullbacks of rational points on $X_{ns}^+(7)$.…