Related papers: On the Curved Patterns Seen in the Graph of PPTs
We study jet schemes of Newton non-degenerate plane curve singularities. We identify a subgraph of the graph of jet components and show that it can be constructed from walks on the lattice points in the first quadrant of the Cartesian…
The conic sections, as well as the solids obtained by revolving these curves, and many of their surprising properties, were already studied by Greek mathematicians since at least the fourth century B.C. Some of these properties come to the…
We introduce the class of rational plane curves parameterizable by conics as an extension of the family of curves parameterizable by lines (also known as monoid curves). We show that they are the image of monoid curves via suitable…
A platypus graph is a non-hamiltonian graph for which every vertex-deleted subgraph is traceable. They are closely related to families of graphs satisfying interesting conditions regarding longest paths and longest cycles, for instance…
The primary objects of study in the ``knot theory of complex plane curves'' are C-links: links (or knots) cut out of a 3-sphere in the complex plane by complex plane transverse and totally tangential. Transverse C-links are naturally…
The general theory of parabolic geometries is applied to the study of the normal Cartan connections for all hyperbolic and elliptic 6-dimensional CR-manifolds of codimension two. The geometric meaning of the individual components of the…
Pairwise Compatibility Graphs (PCGs) form a tree-metric graph class that originated in phylogeny and has since attracted sustained interest in graph theory. Several natural generalizations have been proposed in order to overcome the…
Constructions and exploration of plane algebraic curves has received a new push with the development of automated methods, whose algorithms are continuously improved and implemented in various software packages. We use them to explore the…
The author has been interested in regions surrounded by real algebraic curves of degree $1$ or $2$ in the plane. The author is mainly interested in their shapes and combinatorics. This is a fundamental and natural problem in mathematics…
We consider an infinite graph with the vertex set $\mathbb{Z}^2$ and edges connecting the vertices iff the Euclidean distance between the respective points is an integer, and the points do not lie on the same horizontal or vertical.…
The paper presents a systematic construction of primitive Pythagorean triples. The order of enumeration on the set of primitive Pythagorean triples is defined. The order is based on the representation of a primitive Pythagorean triple by…
Suppose that N is a geometrically finite orientable hyperbolic 3-manifold. Let P(N,C) be the space of all geometrically finite hyperbolic structures on N whose convex core is bent along a set C of simple closed curves. We prove that the map…
This paper presents new properties of Primitive Pythagorean Triples (PPT) that have relevance in applications where events of different probability need to be generated and in cryptography.
The family of Euclidean triangles having some fixed perimeter and area can be identified with a subset of points on a nonsingular cubic plane curve, i.e., an elliptic curve; furthermore, if the perimeter and the square of the area are…
We define the \emph{visual complexity} of a plane graph drawing to be the number of basic geometric objects needed to represent all its edges. In particular, one object may represent multiple edges (e.g., one needs only one line segment to…
Complete complex parabolic geometries (including projective connections and conformal connections) are flat and homogeneous. This is the first global theorem on parabolic geometries.
For each $1\leq n\leq6$ we present formulas for the number of $n-$nodal curves in an $n-$dimensional linear system on a smooth, projective surface. This yields in particular the numbers of rational curves in the system of hyperplane…
In a recent paper published in Nature, Y.I. Sobolev et al. introduced the concept of trajectoids: convex, rigid objects, which roll without slip or spin on a flat plane along a prescribed periodic, unbounded planar path. A geometric…
We study straight-line drawings of planar graphs with few segments and few slopes. Optimal results are obtained for all trees. Tight bounds are obtained for outerplanar graphs, 2-trees, and planar 3-trees. We prove that every 3-connected…
The Newton line and the associated theorems by Newton and Gauss for tetragons and quadrilaterals are closely linked to some other theorems of Euclidean geometry: a theorem by Bocher on the existence of a nine-point conic of a quadrangle, a…