Related papers: Planar $3$-webs and the boundary measurement matri…

For a planar bipartite graph $\mathcal G$ equipped with a $\mathrm{SL}_n$-local system, we show that the determinant of the associated Kasteleyn matrix counts "$n$-multiwebs" (generalizations of $n$-webs) in $\mathcal G$, weighted by their…

We apply the Grassmannian representation of the dimer model, an equivalent approach to Kasteleyn's solution to the close-packed dimer problem, to calculate the connection probabilities for the double-dimer model with wired/free/wired/free…

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…

We formulate a higher-rank version of the boundary measurement map for weighted planar bipartite networks in the disk. It sends a network to a linear combination of SL$_r$-webs, and is built upon the r-fold dimer model on the network. When…

We study the dimer model for a planar bipartite graph N embedded in a disk, with boundary vertices on the boundary of the disk. Counting dimer configurations with specified boundary conditions gives a point in the totally nonnegative…

In this paper we study the linearizability problem for 3-webs on a 2-dimensional manifold. With an explicit computation based on the theory developed in the paper "On the linearizability of 3-webs" (Nonlinear analysis 47, (2001) pp.…

We study tensor networks as a model of arithmetic computation for evaluating multilinear maps. These capture any algorithm based on low border rank tensor decompositions, such as $O(n^{\omega+\epsilon})$ time matrix multiplication, and in…

We develop a new technique for constructing sparse graphs that allow us to prove near-linear lower bounds on the round complexity of computing distances in the CONGEST model. Specifically, we show an $\widetilde{\Omega}(n)$ lower bound for…

For a graph G, let p_i(G), i=0,...,3 be the probability that three distinct random vertices span exactly i edges. We call (p_0(G),...,p_3(G)) the 3-local profile of G. We investigate the set ${\cal S}_3 \subset \mathbb R^4$ of all vectors…

On a finite weighted graph, the dimer model is a probability measure on its dimer covers, that assigns to any cover a probability proportional to the product of the weights of its edges. For planar bipartite graphs, dimer correlations are…

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…

The web trace theorem of Douglas, Kenyon, Shi expands the twisted Kasteleyn determinant in terms of traces of webs. We generalize this theorem to higher genus surfaces and expand the twisted Kasteleyn matrices corresponding to spin…

We study the distribution of interior faces in uniformly random reduced $\mathfrak s \mathfrak l_3$ webs. Using Tymoczko's bijection between $3\times n$ standard Young tableaux and reduced webs, this problem can be reformulated in terms of…

We suggest a new random model for links based on meander diagrams and graphs. We then prove that trivial links appear with vanishing probability in this model, no link $L$ is obtained with probability 1, and there is a lower bound for the…

Let $G$ be a bipartite planar graph with edges directed from black to white. For each vertex $v$ let $n_v$ be a positive integer. A multiweb in $G$ is a multigraph with multiplicity $n_v$ at vertex $v$. A connection is a choice of linear…

Gronwall conjecture states that a planar 3-web which admits more than one distinct linearization is locally equivalent to an algebraic web. We give a partial answer to the conjecture in the affirmative for the class of planar 3-webs with…

We study non-flat planar 3-webs with infinitesimal symmetries. Using multi-dimensional Schwarzian derivative we give a criterion for linearization of such webs and present a projective classification thereof. Using this classification we…

We find relative differential invariants of orders eight and nine for a planar nonparallelizable 3-web such that their vanishing is necessary and sufficient for a 3-web to be linearizable. This solves the Blaschke conjecture for 3-webs. As…

We show that the isomorphism of 3-connected planar graphs can be decided in deterministic log-space. This improves the previously known bound UL$\cap$coUL of Thierauf and Wagner.

We present the first parallel fixed-parameter algorithm for subgraph isomorphism in planar graphs, bounded-genus graphs, and, more generally, all minor-closed graphs of locally bounded treewidth. Our randomized low depth algorithm has a…