Related papers: Une Famille De 5-Tissus Plans Exceptionnels

This survey article is dedicated to some families of fractals that were introduced and studied during the last decade, more precisely, families of Sierpi\'nski carpets: limit net sets, generalised Sierpi\'nski carpets and labyrinth…

Foliations in the complex projective plane are uniquely determined by their singular locus, which is in correspondence with a zero-dimensional ideal. However, this correspondence is not surjective. We give conditions to determine whether an…

We define some Schnyder-type combinatorial structures on a class of planar triangulations of the pentagon which are closely related to 5-connected triangulations. The combinatorial structures have three incarnations defined in terms of…

Let $C$ be a curve of genus 2 and $\psi_1:C \lar E_1$ a map of degree $n$, from $C$ to an elliptic curve $E_1$, both curves defined over $\bC$. This map induces a degree $n$ map $\phi_1:\bP^1 \lar \bP^1$ which we call a Frey-Kani covering.…

We study completely reducible fibers of pencils of hypersurfaces on $\mathbb P^n$ and associated codimension one foliations of $\mathbb P^n$. Using methods from theory of foliations we obtain certain upper bounds for the number of these…

We show that every $n$-vertex $5$-connected planar triangulation has at most $9n-50$ many cycles of length $5$ for all $n\ge 20$ and this upper bound is tight. We also show that for every $k\geq 6$, there exists some constant $C(k)$ such…

We consider families of cyclic covers of the projective line, where we fix the covering group and the local monodromies and we vary the branch points. We prove that there are precisely twenty such families that give rise to a special…

A graph is pseudo-outerplanar if each of its blocks has an embedding in the plane so that the vertices lie on a fixed circle and the edges lie inside the disk of this circle with each of them crossing at most one another. It is proved that…

In this paper we study various difference equations related to Jacobi-type pencils. By a Jacobi-type pencil one means the following pencil: $J_5 - \lambda J_3$, where $J_3$ is a Jacobi matrix and $J_5$ is a semi-infinite real symmetric…

We show how for every integer n one can explicitly construct n distinct plane quartics and one hyperelliptic curve over the complex numbers all of whose Jacobians are isomorphic to one another as abelian varieties without polarization. When…

As a generalization of a quasi-elliptic surface, there is a quasi-hyperelliptic surface, a nonsingular projective surface which has a fibration structure whose general fiber is a quasi-hyperelliptic curve ($=$ singular hyperelliptic curve…

We investigate the construction of exponential families from statistical manifolds, a central problem in information geometry. We prove that every compact statistical manifold admits a singular foliation whose leaves are Hessian manifolds.…

We provide a short proof that a 5-connected nonplanar apex graph contains a subdivided $K_{_5}$ or a $K^-_{_4}$ (= $K_{_4}$ with a single edge removed) as a subgraph. Together with a recent result of Ma and Yu that {\sl every nonplanar…

Planar functions over finite fields give rise to finite projective planes. They were also used in the constructions of DES-like iterated ciphers, error-correcting codes, and codebooks. They were originally defined only in finite fields with…

Let $f:X \to \mathbb{P}^1$ be a non-isotrivial family of semi-stable curves of genus $g\geq 1$ defined over an algebraically closed field $k$ with $s_{nc}$ singular fibers whose Jacobians are non-compact. We prove that $s_{nc}\geq 5$ if…

The Fano models of Enriques surfaces produce a family of tens of mutually intersecting planes in $\mathbf P^5$ with a $10$-dimensional moduli space. The latter is linked to several 10-dimensional moduli spaces parametrizing other types of…

We construct exponentially large collections of pairwise distinct equisingular deformation families of irreducible plane curves sharing the same sets of singularities. The fundamental groups of all curves constructed are abelian.

A drawing of a graph is 1-planar if each edge participates in at most one crossing and adjacent edges do not cross. Up to symmetry, each crossing in a 1-planar drawing belongs to one out of six possible crossing types, where a type…

In this paper, we define, from a finite set E of functions, a family of holomorphic webs ${\cal W}(n;E)$ of codimension one in any dimension $ n $. We prove that it is sufficient to check a finite number of conditions for these webs to be…

A graph is $k$-planar if it can be drawn in the plane such that no edge is crossed more than $k$ times. While for $k=1$, optimal $1$-planar graphs, i.e., those with $n$ vertices and exactly $4n-8$ edges, have been completely characterized,…