Related papers: Le rang des tissus de Nakai
Two new classes of networks are introduced that resemble small-world properties. These networks are recursively constructed but retain a fixed, regular degree. They consist of a one-dimensional lattice backbone overlayed by a hierarchical…
In this work all the dessins d'enfant with no more than 4 edges are listed and their Belyi pairs are computed. In order to enumerate all dessins the technique of matrix model computations was used. The total number of dessins is 134; among…
References to the works of Iliev-Ranestad and Kuznetsov added. ----- In a first part we detail the construction, on a general Fano 4-fold of genus 9, of a canonical set of four stable vector bundles of rank 2, and prove that they are rigid.…
At the time of writing, the general problem of finding the maximal Waring rank for homogeneous polynomials of fixed degree and number of variables (or, equivalently, the maximal symmetric rank for symmetric tensors of fixed order and in…
We give a simple analytic criterion which characterizes linearizable 1-codimensional webs. Then we give an invariant geometrical interpretation of it, in term of projective connection. We explain then how our approach allows to study…
In this paper, we study 2-port networks and introduce new concepts of voltage drop and $\Pi$-equivalence. The main result is that each planar network is $\Pi$-equivalent to a network with no more than 5 edges. This implies that if an…
Let A be an integer (d x n) matrix, and assume that the convex hull conv(A) of its columns is a simplex of dimension d-1. Write \NA for the semigroup generated by the columns of A. It was proved by M. Saito [math.AG/0012257] that the…
An instanton homology is constructed for webs and foams, using gauge theory with structure group SU(3), adapting previous work of the authors for the SO(3) case. Skein exact triangles are established, and using an eigenspace decomposition…
We consider two varieties associated to a web of quadrics W in the projective space of dimension 7. One is the base locus and the second one is the double cover of the three dimensional projective space branched along the determinant…
For certain real quadratic number fields, we prove density results concerning 4-ranks of tame kernels. We also discuss a relationship between 4-ranks of tame kernels and 4-class ranks of narrow ideal class groups. Additionally, we give a…
The rank problem in succinct data structures asks to preprocess an array A[1..n] of bits into a data structure using as close to n bits as possible, and answer queries of the form rank(k) = Sum_{i=1}^k A[i]. The problem has been intensely…
We find three characterizations for a multidimensional (n+1)-web W possessing a reduct reducible subweb: its closed form equations, the integrability of an invariant distribution associated with W, and the relations between the components…
A long-standing Conjecture of S. Negami states that a connected graph has a finite planar cover if and only if it embeds in the projective plane. It is known that the Conjecture is equivalent to the fact that \emph{the graph $K_{1,2, 2, 2}$…
We show that if a homogeneous polynomial $f$ in $n$ variables has Waring rank $n+1$, then the corresponding projective hypersurface $f=0$ has at most isolated singularities, and the type of these singularities is completely determined by…
An octilinear drawing of a planar graph is one in which each edge is drawn as a sequence of horizontal, vertical and diagonal at 45 degrees line-segments. For such drawings to be readable, special care is needed in order to keep the number…
We show that every non-trivial tame knot or link in R^3 has a quadrisecant, i.e. four collinear points. The quadrisecant must be topologically non-trivial in a precise sense. As an application, we show that a nonsingular, algebraic surface…
We propose the Legendrian web in a contact three manifold as a second order generalization of the planar web. An Abelian relation for a Legendrian web is analogously defined as an additive equation among the first integrals of its…
It is shown that any finite, rank-connected, dismantlable lattice is lexicographically shellable (hence Cohen-Macaulay). A ranked, interval-connected lattice is shown to be rank-connected, but a rank-connected lattice need not be…
We classify webs of minimal degree rational curves on surfaces and give a criterion for webs being hexagonal. In addition, we classify Neron-Severi lattices of real weak del Pezzo surfaces. These two classifications are related to root…
We investigate the graphs formed from the vertices and creases of an origami pattern that can be folded flat along all of its creases. As we show, this is possible for a tree if and only if the internal vertices of the tree all have even…