Related papers: Le rang des tissus de Nakai

A graph drawn on the plane is called $1$-plane if each edge is crossed at most once by another edge. In this paper, we show that every $4$-connected $1$-plane graph has a connected spanning plane subgraph. We also show that there exist…

Given a simple algebraic group $G$, a web is a directed trivalent graph with edges labelled by dominant minuscule weights. There is a natural surjection of webs onto the invariant space of tensor products of minuscule representations.…

We give the complete classification of Mukai pairs of dimension $4$ and rank $2$ with Picard number one, that is, pairs $(X,E)$ where $X$ is a Fano $4$-fold with Picard number one, and $E$ is an ample vector bundle of rank two on $X$ with…

A net is a special configuration of lines and points in the projective plane. There are certain restrictions on the number of its lines and points. We proved that there cannot be any (4,4) nets in $\mathbb{C}P^2$. In order to show this, we…

We find d - 2 relative differential invariants for a d-web, d \geq 4, on a two-dimensional manifold and prove that their vanishing is necessary and sufficient for a d-web to be linearizable. If one writes the above invariants in terms of…

In many cases (e.g. for many Segre or Segre embeddings of multiprojective spaces) we prove that a hypersurface of the $b$-secant variety of $X\subset \mathbb {P}^r$ has $X$-rank $>b$. We prove it proving that the $X$-rank of a general point…

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…

Webs are a kind of planar, directed, edge-labeled graph that encode invariant vectors for quantum representations of $\mathfrak{sl}_n$. The theory of webs developed organically for $\mathfrak{sl}_2$, where they are also known as noncrossing…

In this paper, we consider the problem of determining in polynomial time whether a given planar point set $P$ of $n$ points admits 4-connected triangulation. We propose a necessary and sufficient condition for recognizing $P$, and present…

Transversal structures (also known as regular edge labelings) are combinatorial structures defined over 4-connected plane triangulations with quadrangular outer-face. They have been intensively studied and used for many applications…

Motivated by questions arising in signal processing, computational complexity, and other areas, we study the ranks and border ranks of symmetric tensors using geometric methods. We provide improved lower bounds for the rank of a symmetric…

Over a scheme with 2 invertible, we show that a vector bundle of rank four has a sub or quotient line bundle if and only if the canonical symmetric bilinear form on its exterior square has a lagrangian subspace. For this, we exploit a…

There are close relations between tripartite tensors with bounded geometric ranks and linear determinantal varieties with bounded codimensions. We study linear determinantal varieties with bounded codimensions, and prove upper bounds of the…

Let X be a K3 surface of degree 8 in P^5 with hyperplane section H. We associate to it another K3 surface M which is a double cover of P^2 ramified on a sextic curve C. In the generic case when X is smooth and a complete intersection of…

We study the symmetrised rank-one convex hull of monoclinic-I martensite (a twelve-variant material) in the context of geometrically-linear elasticity. We construct sets of T3s, which are (non-trivial) symmetrised rank-one convex hulls of…

A matrix is said to have factor width at most $k$ if it can be written as a sum of positive semidefinite matrices that are non-zero only in a single $k \times k$ principal submatrix. We explore the ``factor-width-$k$ rank'' of a matrix,…

We constructs a new network by superposition of hexahedron , which are scale-free, highly sparse,disassortative ,and maximal planar graphs. The network degree distribution, agglomeration coefficient and degree of correlation are computed…

The web trace theorem of Douglas, Kenyon, Shi expands the twisted Kasteleyn determinant in terms of traces of webs. We generalize this theorem to higher genus surfaces and expand the twisted Kasteleyn matrices corresponding to spin…

We classify 3-braid knots whose topological 4-genus coincides with their Seifert genus, using McCoy's twisting method and the Xu normal form. In addition, we give upper bounds for the topological 4-genus of positive and strongly…

A $k$-ranking of a graph $G$ is a labeling of its vertices from $\{1,\ldots,k\}$ such that any nontrivial path whose endpoints have the same label contains a larger label. The least $k$ for which $G$ has a $k$-ranking is the ranking number…