Related papers: Samuelson's Webs
For any d-web by curves in an ambiant n-dimensional manifold, we define a tautological connection on some associated bundle, whose curvature vanishes iff the web has a maximal (n-1)-rank. As an application we recover, with the help of a…
For any $n\geq 6$ we construct almost strongly minimal geometries of type $\bullet \overset{n}{-} \bullet \overset{n}{-}\bullet$ which are $2$-ample but not $3$-ample.
The rank of a semigroup is the cardinality of a smallest generating set. In this paper we compute the rank of the endomorphism monoid of a non-trivial uniform partition of a finite set, that is, the semigroup of those transformations of a…
Complex networks in natural, social, and technological systems generically exhibit an abundance of rich information. Extracting meaningful structural features from data is one of the most challenging tasks in network theory. Many methods…
In [3] is was shown that for any group $G$ whose rank (i.e., minimal number of generators) is at most 3, and any finite index subgroup $H\leq G$ with index $[G:H]\geq rank(G)$, one can always find a left-right transversal of $H$ which…
Let $\lambda(G)$ be the maximum number of subgroups in an irredundant covering of the finite group $G$. We prove that if $G$ is a group with $\lambda(G) \leqslant 6$, then $G$ is supersolvable. We also describe the structure of the groups…
We generalize to webs of any codimension results already known in codimension one. Given a holomorphic $d$-web $\cal W$ of codimension $q$ $(q\leq n-1)$ in an ambiant $n$-dimensional holomorphic manifold $U$, we define for any integer $p$…
We study an upper bound of ranks of $n$-tensors with size $2\times\cdots\times2$ over the complex and real number field. We characterize a $2\times 2\times 2$ tensor with rank 3 by using the Cayley's hyperdeterminant and some function. Then…
We prove that under mild hypothesis rational maps on a surface preserving webs are of Latt\`es type. We classify endomorphisms of P^2 preserving webs, extending former results of Dabija-Jonsson.
We study limits of the largest connected components (viewed as metric spaces) obtained by critical percolation on uniformly chosen graphs and configuration models with heavy-tailed degrees. For rank-one inhomogeneous random graphs, such…
We are interested by holomorphic $d$-webs $W$ of codimension one in a complex $n$-dimensional manifold $M$. If they are ordinary, i.e. if they satisfy to some condition of genericity (whose precise definition is recalled), we proved in [CL]…
We give some bounds on the numbers of rational points on abelian varieties and jacobians varieties over finite fields. The main result is that we determine the maximum and minimum number of rational points on jacobians varieties of…
A ranking is an ordered sequence of items, in which an item with higher ranking score is more preferred than the items with lower ranking scores. In many information systems, rankings are widely used to represent the preferences over a set…
A certain number of lists of small Salem numbers, some of which are certified as complete, are available online. Notably, the website of M. J. Mossinghoff features a list of 47 Salem numbers smaller than 1.3, as well as complete lists of…
In translation surfaces of finite area (corresponding to holomorphic differentials), directions of saddle connections are dense in the unit circle. On the contrary, saddle connections are fewer in translation surfaces with poles…
Inspired by recent work of Kopparty-Moshkovitz-Zuiddam and motivated by problems in combinatorics and hypergraphs, we introduce the notion of the symmetric geometric rank of a symmetric tensor. This quantity is equal to the codimension of…
In many interesting situations the size of epsilon-nets depends only on $\epsilon$ together with different complexity measures. The aim of this paper is to give a systematic treatment of such complexity measures arising in Discrete and…
Due the success of emerging Web 2.0, and different social network Web sites such as Amazon and movie lens, recommender systems are creating unprecedented opportunities to help people browsing the web when looking for relevant information,…
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…
To determine whether an $n\times n$-matrix has rank at most $r$ it suffices to check that the $(r+1)\times (r+1)$-minors have rank at most $r$. In other words, to describe the set of $n\times n$-matrices with the property of having rank at…