Related papers: Une Famille De 5-Tissus Plans Exceptionnels
Given a web (multi-foliation) and a linear system on a projective surface we construct divisors cutting out the locus where some element of the linear system has abnormal contact with the leaf of the web. We apply these ideas to reobtain a…
In the previous paper by Pereira and the author, it was proved that any pencil of plane curves of degree greater than one with irreducible generic fiber can have at most five completely reducible fibers although no examples with five such…
In a previous paper, we studied the web by conics $\boldsymbol{\mathcal W}_{{\rm dP}_4}$ on a del Pezzo quartic surface ${\rm dP}_4$ and proved that it enjoys suitable versions of most of the remarkable properties satisfied by Bol's web…
A graph is IC-planar if it admits a drawing in the plane with at most one crossing per edge and such that two pairs of crossing edges share no common end vertex. IC-planarity specializes both NIC-planarity, which allows a pair of crossing…
We prove that immersions of planar domains are uniquely specified by their Jacobian determinant, curl function, and boundary values. This settles the two-dimensional version of an outstanding conjecture related to a particular grid…
We consider models for genus one curves of degree 5, which arise in explicit 5-descent on elliptic curves. We prove a theorem on the existence of minimal models with the same invariants as the minimal model of the Jacobian elliptic curve…
We show that every tropical totally positive matrix can be uniquely represented as the transfer matrix of a canonical totally connected weighted planar network. We deduce a uniqueness theorem for the factorization of a tropical totally…
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.
We introduce and motivate a conjecture about the existence of complete, 1-dimensional families of covers of an elliptic curve. If the conjecture holds, then it would imply a uniform lower bound of 5 for slope of the moduli space of curves.…
Many real life networks present an average path length logarithmic with the number of nodes and a degree distribution which follows a power law. Often these networks have also a modular and self-similar structure and, in some cases -…
Exceptional Belyi covering is a connected Belyi covering uniquely determined by its ramification scheme or the respective dessin d'enfant. We focus on rational exceptional Belyi coverings of compact Riemann surfaces of genus 0. Well known…
In the present paper we study geometric structures associated with webs of hypersurfaces. We prove that with any geodesic (n+2)-web on an n-dimensional manifold there is naturally associated a unique projective structure and, provided that…
We classify all rational functions whose branching pattern above {0, 1, infinity} satisfy a certain regularity condition with precisely d=5 exceptions. This work is motivated by solving second order linear differential equations, with d=5…
We give the classification of subfactor planar algebras at index exactly 5. All the examples arise as standard invariants of subgroup subfactors. Some of the requisite uniqueness results come from work of Izumi in preparation. The…
A binary extended 1-perfect code $\mathcal C$ folds over its kernel via the Steiner quadruple systems associated with its codewords. The resulting folding, proposed as a graph invariant for $\mathcal C$, distinguishes among the 361…
We show that every graph with two crossings is 5-choosable. We also prove that every graph which can be made planar by removing one edge is 5-choosable.
In this article we consider the action of affine group and time rescaling on planar quadratic differential systems. We construct a system of representatives of the orbits of systems with at least five invariant lines, including the line at…
This paper proves that the Alon-Tarsi number of any planar graph is at most $5$, which gives an alternate proof of the $5$-choosability as well as the $5$-paintability of planar graphs.
We derive a one-parameter deformation of the refined topological vertex that, when used to compute non-periodic web diagrams, reproduces the six-dimensional topological string partition functions that are computed using the refined vertex…
We study linear systems cut out by cones of fixed degree on a smooth complex curve $C\subset\mathbb{P}^{3}$. We develop a systematic study of the families of such systems, considering their limits, their infinitesimal behaviour and some…