English
Related papers

Related papers: Le rang des tissus de Nakai

200 papers

Let $G$ be a digraph and $r(G)$ be its rank. Many interesting results on the rank of an undirected graph appear in the literature, but not much information about the rank of a digraph is available. In this article, we study the rank of a…

Discrete Mathematics · Computer Science 2018-10-10 Ranveer Singh , Swarup Kumar Panda , Naomi Shaked-Monderer , Abraham Berman

We establish a connection between properties of partially symmetric tensors (i.e. tensors associated to linear systems of quadric hypersurfaces) and the geometry of some related loci, generalization of the Weddle loci introduced in…

Algebraic Geometry · Mathematics 2025-12-15 Luca Chiantini , Filippo Fagioli

We prove that a completely symmetric and trace-free rank-4 tensor is, up to sign, a Bel-Robinson type tensor, i.e., the superenergy tensor of a tensor with the same algebraic symmetries as the Weyl tensor, if and only if it satisfies a…

General Relativity and Quantum Cosmology · Physics 2009-11-10 G. Bergqvist , P. Lankinen

Let $\cac$ be a smooth projective curve defined over a number field $k$, $A/k(\cac)$ an abelian variety and $(\tau,B)$ the $k(\cac)/k$-trace of $A$. We estimate how the rank of $A(k(\cac))/\tau B(k)$ varies when we take a finite cover…

Number Theory · Mathematics 2007-05-23 Amilcar Pacheco

Higher-order networks are efficient representations of sequential data. Unlike the classic first-order network approach, they capture indirect dependencies between items composing the input sequences by the use of \textit{memory-nodes}. We…

Physics and Society · Physics 2021-09-08 Célestin Coquidé , Julie Queiros , François Queyroi

We consider the topology of real no $k$-equal spaces via the theory of cellular spanning trees. Our main theorem proves that the rank of the $(k-2)$-dimensional homology of the no $k$-equal subspace of $\mathbb{R}$ is equal to the number of…

Combinatorics · Mathematics 2017-08-02 Yuliy Baryshnikov , Caroline Klivans , Nicholas Kosar

We prove the rank-4 case of the conjecture of Ha-Hai-Nghia for the invariant subspace of the truncated polynomial ring $\mathcal{Q}_m(n)=\mathbb{F}_q[x_1,\dots,x_n]/(x_1^{q^m},\dots,x_n^{q^m}),$ under a new, explicit technical hypothesis.…

Commutative Algebra · Mathematics 2025-10-30 Dang Vo Phuc

We study the rank of the random $n\times m$ 0/1 matrix ${\bf A}_{n,m;k}$ where each column is chosen independently from the set $\Omega_{n,k}$ of 0/1 vectors with exactly $k$ 1's. Here 0/1 are the elements of the field $GF_2$. We obtain an…

Combinatorics · Mathematics 2018-11-16 C. Cooper , A. M. Frieze , W. Pegden

By the planarity rank of a semigroup variety we mean the largest number of generators of a free semigroup of a variety with respect to which the semigroup admits a planar Cayley graph. Since the time when L.M.Martynov formulated the problem…

Rings and Algebras · Mathematics 2025-01-23 Solomatin Denis Vladimirovich

The square root rank of a nonnegative matrix $A$ is the minimum rank of a matrix $B$ such that $A=B \circ B$, where $\circ$ denotes entrywise product. We show that the square root rank of the slack matrix of the correlation polytope is…

Computational Complexity · Computer Science 2014-11-26 Troy Lee , Zhaohui Wei

The aim of this note is to exhibit explicit sufficient criteria ensuring bigness of globally generated, rank-$r$ vector bundles, $r \geqslant 2$, on smooth, projective varieties of even dimension $d \leqslant 4$. We also discuss connections…

Algebraic Geometry · Mathematics 2019-11-05 Gilberto Bini , Flaminio Flamini

In a graph whose vertices are assigned integer ranks, a path is well-ranked if the endpoints have distinct ranks or some interior point has a higher rank than the endpoints. A ranking is an assignment of ranks such that all nontrivial paths…

Combinatorics · Mathematics 2016-07-26 Jordan Almeter , Samet Demircan , Andrew Kallmeyer , Kevin G. Milans , Robert Winslow

Webs yield an especially important realization of certain Specht modules, irreducible representations of symmetric groups, as they provide a pictorial basis with a convenient diagrammatic calculus. In recent work, the last three authors…

Combinatorics · Mathematics 2025-10-01 Chris Fraser , Rebecca Patrias , Oliver Pechenik , Jessica Striker

We investigate finite 3-nets embedded in a projective plane over a (finite or infinite) field of any characteristic p. Such an embedding is regular when each of the three classes of the 3-net comprises concurrent lines, and irregular…

Combinatorics · Mathematics 2009-11-23 Aart Blokhuis , Gábor Korchmáros , Francesco Mazzocca

Consider a log canonical pair $(X,B)$ such that there is a Cartier divisor $D$ for which $T_X(-\log B) \otimes \mathcal O(D)$ is locally free and globally generated. Let $\mathcal F$ be a log canonical foliation of rank 1 on $X$. We prove…

Algebraic Geometry · Mathematics 2026-04-10 Calum Spicer , Luca Tasin

We present a projectively invariant description of planar linear 3-webs. For a non-hexagonal 3-web, we introduce family of projective torsion-free Cartan connections, the web leaves being geodesics for each member of the family, and give a…

Differential Geometry · Mathematics 2019-03-05 Sergey I. Agafonov

Mukai proved that most prime Fano fourfolds of degree 10 and index 2 are contained in a Grassmannian G(2,5). They are all unirational and some are rational, as remarked by Roth in 1949. We show that their middle cohomology is of K3 type and…

Algebraic Geometry · Mathematics 2014-02-26 Olivier Debarre , Atanas Iliev , Laurent Manivel

A planar orthogonal drawing of a planar 4-graph G (i.e., a planar graph with vertex-degree at most four) is a crossing-free drawing that maps each vertex of G to a distinct point of the plane and each edge of $G$ to a sequence of horizontal…

Computational Geometry · Computer Science 2022-05-17 Walter Didimo , Michael Kaufmann , Giuseppe Liotta , Giacomo Ortali

A graph $G$ is $k$-degenerate if it can be transformed into an empty graph by subsequent removals of vertices of degree $k$ or less. We prove that every connected planar graph with average degree $d \ge 2$ has a 4-degenerate induced…

Combinatorics · Mathematics 2013-10-07 Robert Lukoťka , Ján Mazák , Xuding Zhu

We consider $4$-uniform hypergraphs with the maximum number of hyperedges subject to the condition that every set of $5$ vertices spans either $0$ or exactly $2$ hyperedges and give a construction, using quadratic residues, for an infinite…

Combinatorics · Mathematics 2016-11-08 Karen Gunderson , Jason Semeraro