Related papers: Connection points on double regular polygons

We prove that the saddle connection graph associated to any half-translation surface is 4-hyperbolic and uniformly quasi-isometric to the regular countably infinite-valent tree. Consequently, the saddle connection graph is not…

We consider the problem of finding an optimal piecewise linear path (polygonal line) connecting two given points with the possibility of making n turns at some points (the absolute value of each turn angle does not exceed a prescribed…

Let $X\subseteq \mathbb{P}^3$ be a smooth projective surface of degree $d\ge 4$ defined over a number field $K$, and let $N_{X^{\prime}}(B)$ be the number of rational points of $X$ of height at most $B$ that do not lie on lines contained in…

We study the quadratic integral points-that is, (S-)integral points defined over any extension of degree two of the base field-on a curve defined in P_3 by a system of two Pell equations. Such points belong to three families explicitly…

We consider area preserving maps of surfaces and extend Mather's result on the equality of the closure of the four branches of saddles. He assumed elliptic fixed points to be Moser stable, while we require only that the derivative at this…

A simple topological graph is a topological graph in which any two edges have at most one common point, which is either their common endpoint or a proper crossing. More generally, in a k-simple topological graph, every pair of edges has at…

The numbers of $\mathbb{F}_q$-points of nonsingular hypersurfaces of a fixed degree in an odd-dimensional projective space are investigated, and an upper bound for them is given. Also we give the complete list of nonsingular hypersurfaces…

Connecting curves have been shown to organize the rotational structure of strange attractors in three-dimensional dynamical systems. We extend the description of connecting curves and their properties to higher dimensions within the special…

New condition is found for the set of points in the plane, for which the locus is a circle. It is proved: the locus of points, such that the sum of the $(2m)$-th powers $S_n^{(2m)}$}of the distances to the vertexes of fixed regular…

For a set $P$ of $n$ points in the plane in general position, a non-crossing spanning tree is a spanning tree of the points where every edge is a straight-line segment between a pair of points and no two edges intersect except at a common…

This note is devoted to a trick which yields almost trivial proofs that certain complexes associated to topological surfaces are connected or simply connected. Applications include new proofs that the complexes of curves, separating curves,…

Every smooth cubic plane curve has 9 inflection points, 27 sextatic points, and 72 ``points of type nine". Motivated by these classical algebro-geometric constructions, we study the following topological question: Is it possible to…

We investigate the projective normality of smooth, linearly normal surfaces of degree 9. All non projectively normal surfaces which are not scrolls over a curve are classified. Results on the projective normality of surface scrolls are also…

For every $n\in \mathbb{N}$, we present a set $S_n$ of $O(n^{3/2}\log n)$ points in the plane such that every planar 3-tree with $n$ vertices has a straight-line embedding in the plane in which the vertices are mapped to a subset of $S_n$.…

The notion of forbidden-transition graphs allows for a robust generalization of walks in graphs. In a forbidden-transition graph, every pair of edges incident to a common vertex is permitted or forbidden; a walk is compatible if all pairs…

In this paper we prove a duality between $k$-noncrossing partitions over $[n]=\{1,...,n\}$ and $k$-noncrossing braids over $[n-1]$. This duality is derived directly via (generalized) vacillating tableaux which are in correspondence to…

In this paper we compute upper bounds for the number of ordinary triple points on a hypersurface in $P^3$ and give a complete classification for degree six (degree four or less is trivial, and five is elementary). But the real purpose is to…

The center, median and the security center are three central parts defined for any connected graph whereas the characteristic set, subtree core and core vertices are three central parts defined for trees only. We extend the concept of the…

Translation surfaces can be defined in an elementary way via polygons, and arise naturally in in the study of various basic dynamical systems. They can also be defined as Abelian differentials on Riemann surfaces, and have moduli spaces…

We introduce a new technique that is used to show that the complex projective plane blown up at 6, 7, or 8 points has infinitely many distinct smooth structures. None of these smooth structures admit smoothly embedded spheres with…