Related papers: Confocal conics and 4-webs of maximal rank
We classify nets of conics in Desarguesian projective planes over finite fields of odd order, namely, two-dimensional linear systems of conics containing a repeated line. Our proof is geometric in the sense that we solve the equivalent…
We consider families of confocal conics and two pencils of Apollonian circles having the same foci. We will show that these families of curves generate trivial 3-webs and find the exact formulas describing them.
If one erects regular hexagons upon the sides of a triangle $T$, several surprising properties emerge, including: (i) the triangles which flank said hexagons have an isodynamic point common with $T$, (ii) the construction can be extended…
We consider congruences of straight lines in a plane with the combinatorics of the square grid, with all elementary quadrilaterals possessing an incircle. It is shown that all the vertices of such nets (we call them incircular or IC-nets)…
Canonical parametrisations of classical confocal coordinate systems are introduced and exploited to construct non-planar analogues of incircular (IC) nets on individual quadrics and systems of confocal quadrics. Intimate connections with…
We find an invariant characterization of planar webs of maximum rank. For 4-webs, we prove that a planar 4-web is of maximum rank three if and only if it is linearizable and its curvature vanishes. This result leads to the direct…
According to Alain H\'enaut, a planar 4-web is called Nakai's web if the cross-ratio of the tangents to the four foliations at each point is constant and if it has no hexagonal 3-subweb. We prove that Nakai's webs have rank 0 or 1. We give…
In the projective plane, we consider congruences of straight lines with the combinatorics of the square grid and with all elementary quadrilaterals possessing touching inscribed conics. The inscribed conics of two combinatorially…
We show that 4-connected plane triangulations can be redrawn such that edges are represented by straight segments and the vertices are covered by a set of at most $\sqrt{2n}$ lines each of them horizontal or vertical. The same holds for all…
We prove that any planar 4-web defines a unique projective structure in the plane in such a way that the leaves of the foliations are geodesics of this projective structure. We also find conditions for the projective structure mentioned…
Supercyclides are surfaces with a characteristic conjugate parametrization consisting of two families of conics. Patches of supercyclides can be adapted to a Q-net (a discrete quadrilateral net with planar faces) such that neighboring…
Codimension one webs are configurations of finitely many codimension one foliations in general position. Much of the classical theory evolved around the concept of abelian relation: a functional relation among the first integrals of the…
We revisit constructions based on triads of conics with foci at pairs of vertices of a reference triangle. We find that their 6 vertices lie on well-known conics, whose type we analyze. We give conditions for these to be circles and/or…
The problem of classifying linear systems of conics in projective planes dates back at least to Jordan, who classified pencils (one-dimensional systems) of conics over $\mathbb{C}$ and $\mathbb{R}$ in 1906--1907. The analogous problem for…
We compute the fundamental groups of the complements of the family of real conic-line arrangements with up to two conics which are tangent to each other at two points, with an arbitrary number of tangent lines to both conics. All the…
Two parameter families of plane conics are called nets of conics. There is a natural group action on the vector space of nets of conics, namely the product of the group reparametrizing the underlying plane, and the group reparametrizing the…
A classification and examples of four-dimensional isoclinic three-webs of codimension two are given. The examples considered prove the existence theorem for many classes of webs for which the general existence theorems are not proved yet.
A classic result of Brooks, Smith, Stone and Tutte associates to any finite planar network with distinguished source and sink vertices, a tiling of a rectangle by smaller subrectangles whose aspect ratios are given by the conductances of…
In a planar confluent orthogonal drawing (PCOD) of a directed graph (digraph) vertices are drawn as points in the plane and edges as orthogonal polylines starting with a vertical segment and ending with a horizontal segment. Edges may…
The simplest way to generate a lattice of convex sets is to consider an initial set of points and draw segments, triangles, and any convex hull from it, then intersect them to obtain new points, and so forth. The result is an infinite…