Schubert puzzles and integrability I: invariant trilinear forms

The puzzle rules for computing Schubert calculus on $d$-step flag manifolds, proven in [Knutson Tao 2003] for $1$-step, in [Buch Kresch Purbhoo Tamvakis 2016] for $2$-step, and conjectured in [Coskun Vakil 2009] for $3$-step, lead to vector configurations (one vector for each puzzle edge label) that we recognize as the weights of some minuscule representations. The $R$-matrices of those representations (which, for $2$-step flag manifolds, involve triality of $D_4$) degenerate to give us puzzle formulae for two previously unsolved Schubert calculus problems: $K_T(2$-step flag manifolds$)$ and $K(3$-step flag manifolds$)$. The $K(3$-step flag manifolds$)$ formula, which involves 151 new puzzle pieces, implies Buch's correction to the first author's 1999 conjecture for $H^*(3$-step flag manifolds$)$.Comment: v5: misleading sentence in the statement of theorem 2 and missing pictures in the statement of theorem 3 fixed. no results or proofs changed. v6: left vs right coset issues fixe

Algebraic Bethe Ansatz for the FPL^2 model

An exact solution of the model of fully packed loops of two colors on a square lattice has recently been proposed by Dei Cont and Nienhuis using the coordinate Bethe Ansatz approach. We point out here a simpler alternative, in which the transfer matrix is directly identified as a product of R-matrices; this allows to apply the (nested) algebraic Bethe Ansatz, which leads to the same Bethe equations. We comment on some of the applications of this result

A transfer matrix approach to the enumeration of colored links

We propose a transfer matrix algorithm for the enumeration of alternating link diagrams with external legs, giving a weight $n$ to each connected component. Considering more general tetravalent diagrams with self-intersections and tangencies allows us to treat topological (flype) equivalences. This is done by means of a finite renormalization scheme for an associated matrix model. We give results, expressed as polynomials in $n$, for the various generating functions up to order 19 (link diagrams), 15 (prime alternating tangles) and 11 (6-legged links) intersections. The limit $n\to\infty$ is solved explicitly. We then analyze the large-order asymptotics of the generating functions. For $0\le n \le 2$ good agreement is found with a conjecture for the critical exponent, based on the KPZ relation.Comment: 35 page

Monochromatic path crossing exponents and graph connectivity in 2D percolation

We consider the fractal dimensions d_k of the k-connected part of percolation clusters in two dimensions, generalizing the cluster (k=1) and backbone (k=2) dimensions. The codimensions X_k = 2-d_k describe the asymptotic decay of the probabilities P(r,R) ~ (r/R)^{X_k} that an annulus of radii r>1 is traversed by k disjoint paths, all living on the percolation clusters. Using a transfer matrix approach, we obtain numerical results for X_k, k<=6. They are well fitted by the Ansatz X_k = 1/12 k^2 + 1/48 k + (1-k)C, with C = 0.0181+-0.0006.Comment: 3 pages, 2 eps-figure