Related papers: Le rang des tissus de Nakai

Let $L$ be a distributive lattice and $R[L]$ the associated Hibi ring. We show that if $L$ is planar, then any bounded Hibi subring of $R[L]$ has a quadratic Gr\"obner basis. We characterize all planar distributive lattices $L$ for which…

To a Seifert matrix of a knot K one can associate a matrix w(K) with entries in the rational function field, Q(t). The Murasugi, Milnor, and Levine-Tristram knot signatures, all of which provide bounds on the 4-genus of a knot, are…

We determine the Waring ranks of all sextic binary forms with complex coefficients using a Geometric Invariant Theory approach. Using the five basic invariants for sextic binary forms, our results give a rapid method to determine the Waring…

Webs give a diagrammatic calculus for spaces of tensor invariants. We introduce hourglass plabic graphs as a new avatar of webs, and use these to give the first rotation-invariant $U_q(\mathfrak{sl}_4)$-web basis, a long-sought object. The…

We define $2n$-multiwebs on planar graphs and discuss their relation with $\mathrm{Sp}(2n)$-webs. On a planar graph with a symplectic local system we define a matrix whose Pfaffian is the sum of traces of $2n$-multiwebs. As application we…

Multiple network alignment is the problem of identifying similar and related regions in a given set of networks. While there are a large number of effective techniques for pairwise problems with two networks that scale in terms of edges,…

The PageRank algorithm enables to rank the nodes of a network through a specific eigenvector of the Google matrix, using a damping parameter $\alpha \in ]0,1[$. Using extensive numerical simulations of large web networks, with a special…

We classify quasilinear systems in Riemann invariants whose characteristic webs are linearizable on every solution. Although the linearizability of an individual web is a rather nontrivial differential constraint, the requirement of…

A rooted phylogenetic network is a directed acyclic graph with a single root, whose sinks correspond to a set of species. As such networks are useful for representing the evolution of species that have undergone reticulate evolution, there…

We study special linear systems of surfaces of $\mathbb{P}^3$ interpolating nine points in general position having a quadric as fixed component. By performing degenerations in the blown-up space, we interpret the quadric obstruction in…

For over twenty years, the term 'cosmic web' has guided our understanding of the large-scale arrangement of matter in the cosmos, accurately evoking the concept of a network of galaxies linked by filaments. But the physical correspondence…

A drawing of a graph $G$ is radial if the vertices of $G$ are placed on concentric circles $C_1, \ldots, C_k$ with common center $c$, and edges are drawn radially: every edge intersects every circle centered at $c$ at most once. $G$ is…

An n-dimensional submanifold X of a projective space P^N (C) is called tangentially degenerate if the rank of its Gauss mapping \gamma: X ---> G (n, N) satisfies 0 < rank \gamma < n. The authors systematically study the geometry of…

We introduce a new way to tabulate knots by representing knot diagrams using a pair of planar trees. This pair of trees have their edges labeled by integers, they have no valence 2 vertices, and they have the same number of valence 1…

We show that the difference between the genus and the stable topological 4-genus of alternating knots is either zero or at least 1/3.

We find a graph of genus $5$ and its drawing on the orientable surface of genus $4$ with every pair of independent edges crossing an even number of times. This shows that the strong Hanani-Tutte theorem cannot be extended to the orientable…

We give an upper-bound for the $X$-rank of points with respect to a non-degenerate irreducible variety $X$ in the case that sub-generic $X$-rank points generate a hypersurface. We give examples where this bound is sharp and it improves the…

We introduce and study three different notions of tropical rank for symmetric and dissimilarity matrices in terms of minimal decompositions into rank 1 symmetric matrices, star tree matrices, and tree matrices. Our results provide a close…

Two highly successful approaches to constructing 5d SCFTs are geometric engineering using M-theory on a Calabi-Yau 3-fold and the use of 5-brane webs suspended from 7-branes in Type IIB string theory. In the brane web realization, the…

The transversal rank of a hypergraph is the maximum size of its minimal hitting sets. Deciding, for an $n$-vertex, $m$-edge hypergraph and an integer $k$, whether the transversal rank is at least $k$ takes time $O(m^{k+1} n)$ with an…