Related papers: Abelian Equations and Rank Problems for Planar Web…
We compare two natural bases for the invariant space of a tensor product of irreducible representations of A_2, or sl(3). One basis is the web basis, defined from a skein theory called the combinatorial A_2 spider. The other basis is the…
The importance of a node in a directed graph can be measured by its PageRank. The PageRank of a node is used in a number of application contexts - including ranking websites - and can be interpreted as the average portion of time spent at…
We provide new examples of integrable rational maps in four dimensions with two rational invariants, which have unexpected geometric properties, as for example orbits confined to non algebraic varieties, and fall outside classes studied by…
Refining a classical proof of Whitney, we show that any $4$-connected planar triangulation can be decomposed into a Hamiltonian path and two trees. Therefore, every $4$-connected planar graph decomposes into three forests, one having…
In this article we will look at the PageRank algorithm used as part of the ranking process of different Internet pages in search engines by for example Google. This article has its main focus in the understanding of the behavior of PageRank…
Higher rank Brill-Noether theory is completely known for curves of genus $\leq 3$. In this paper, we investigate the theory for curves of genus 4. Some of our results apply to curves of arbitrary genus.
We develop a new technique for studying ranks of multiplication maps for linear series via limit linear series and degenerations to chains of genus-1 curves. We use this approach to prove a purely elementary criterion for proving cases of…
We discuss brane webs preserving eight supercharges and derive geometries produced by them. Consistency conditions of supergravity are shown to impose certain requirements on the locations of the sources, and these restrictions are found to…
Listed as No. 53 among the one hundred famous unsolved problems in [J. A. Bondy, U. S. R. Murty, Graph Theory, Springer, Berlin, 2008] is Steinberg's conjecture, which states that every planar graph without 4- and 5-cycles is 3-colorable.…
Let $L$ be an $n$-element finite lattice. We prove that if $L$ has strictly more than $2^{n-5}$ congruences, then $L$ is planar. This result is sharp, since for each natural number $n\geq 8$, there exists a non-planar lattice with exactly…
We classify all cubic systems possessing the maximum number of invariant straight lines (real or complex) taking into account their multiplicities. We prove that there are exactly 23 topological different classes of such systems. For every…
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…
This paper proves that a plactic monoid of any finite rank will have decidable first order theory. This resolves other open decidability problems about the finite rank plactic monoids, such as the Diophantine problem and identity checking.…
We present a MAPLE program for the explicit computation of the curvature of calibrated ordinary webs in codimension one in any dimension (recall that all planar webs are calibrated and ordinary). The vanishing of this curvature means the…
Ranks of subspaces of vector spaces satisfy all linear inequalities satisfied by entropies (including the standard Shannon inequalities) and an additional inequality due to Ingleton. It is known that the Shannon and Ingleton inequalities…
We study the growth of the rank of elliptic curves and, more generally, Abelian varieties upon extensions of number fields. First, we show that if $L/K$ is a finite Galois extension of number fields such that $\Gal(L/K)$ does not have an…
Rank invariants are a parametrized version of Betti numbers of a space multi-filtered by a continuous vector-valued function. In this note we give a sufficient condition for their finiteness. This condition is sharp for spaces embeddable in…
Finding whether a linear-constraint loop has a linear ranking function is an important key to understanding the loop behavior, proving its termination and establishing iteration bounds. If no preconditions are provided, the decision problem…
We present a complete description of a class of linearizable planar geodesic webs which contain a parallelizable 3-subweb.
We strengthen a result by Laskar and Lyle (Discrete Appl. Math. (2009), 330-338) by proving that it is NP-complete to decide whether a bipartite planar graph can be partitioned into three independent dominating sets. In contrast, we show…