Related papers: Samuelson's Webs

We study the maximal rank in affine subspaces of symmetric or alternating matrices, in terms of the matching numbers of certain associated graphs. Applications include simple proofs of upper bounds on the dimension of such subspaces in…

In this paper we study the real rank of monomials and we give an upper bound for the real rank of all monomials. We show that the real and the complex ranks of a monomial coincide if and only if the least exponent is equal to one.

We present old and recent results on rank problems and linearizability of geodesic planar webs.

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…

The study of networks has grown into a substantial interdisciplinary endeavour that encompasses myriad disciplines in the natural, social, and information sciences. Here we introduce a framework for constructing taxonomies of networks based…

The rank of a finite semigroup is the smallest number of elements required to generate the semigroup. A formula is given for the rank of an arbitrary (non necessarily regular) Rees matrix semigroup over a group. The formula is expressed in…

Nous donnons un procede explicite de determination du rang d'un d-tissu non singulier du plan quelconque a l'aide de sa connexion associee. Une etude de quelques invariants du tissu est egalement proposee. We give an explicit process of…

Recently, fundamental conditions on the sampling patterns have been obtained for finite completability of low-rank matrices or tensors given the corresponding ranks. In this paper, we consider the scenario where the rank is not given and we…

The rank of a graph is defined to be the rank of its adjacency matrix. A graph is called reduced if it has no isolated vertices and no two vertices with the same set of neighbors. A reduced graph $G$ is said to be maximal if any reduced…

A vertex ranking of a graph is an assignment of ranks (or colors) to the vertices of the graph, in such a way that any simple path connecting two vertices of equal rank, must contain a vertex of a higher rank. In this paper we study a…

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 new differential proof of our result on the maximal rank of generic unions of points of multiplicity two in projective space in degrees greater than five. This simplifies somewhat our proof of the Waring conjecture.

We show that the fast escaping set $A(f)$ of a transcendental entire function $f$ has a structure known as a spider's web whenever the maximum modulus of $f$ grows below a certain rate. We give examples of entire functions for which the…

We establish lower bounds on the rank of matrices in which all but the diagonal entries lie in a multiplicative group of small rank. Applying these bounds we show that the distance sets of finite pointsets in $\mathbb{R}^d$ generate high…

A partial matrix is a matrix where only some of the entries are given. We determine the maximum rank of the symmetric completions of a symmetric partial matrix where only the diagonal blocks are given and the minimum rank and the maximum…

Networks offer a powerful approach to modeling complex systems by representing the underlying set of pairwise interactions. Link prediction is the task that predicts links of a network that are not directly visible, with profound…

Webs of domain walls are constructed as 1/4 BPS states in d=4, N=2 supersymmetric U(Nc) gauge theories with Nf hypermultiplets in the fundamental representation. Web of walls can contain any numbers of external legs and loops like (p,q)…

In this paper, we find an upper bound for the CP-rank of a matrix over a tropical semiring, according to the vertex clique cover of the graph prescribed by the pattern of the matrix. We study the graphs that beget the patterns of matrices…

We show that a web of codimension at least two and of maximal rank is isomorphic to an algebraic web. This solves a problem first consdered by Chern and Griffiths.

According to Alain H\'enaut, a planar 4-web is called Nakai's web if the cross-ratio of the tangents to the four foliations at each point is constant and if it has no hexagonal 3-subweb. We prove that Nakai's webs have rank 0 or 1. We give…