A Combinatorial Interpretation of the Free Fermion Condition of the Six-Vertex Model

The free fermion condition of the six-vertex model provides a 5 parameter sub-manifold on which the Bethe Ansatz equations for the wavenumbers that enter into the eigenfunctions of the transfer matrices of the model decouple, hence allowing explicit solutions. Such conditions arose originally in early field-theoretic S-matrix approaches. Here we provide a combinatorial explanation for the condition in terms of a generalised Gessel-Viennot involution. By doing so we extend the use of the Gessel-Viennot theorem, originally devised for non-intersecting walks only, to a special weighted type of \emph{intersecting} walk, and hence express the partition function of $N$ such walks starting and finishing at fixed endpoints in terms of the single walk partition functions

Three osculating walkers

We consider three directed walkers on the square lattice, which move simultaneously at each tick of a clock and never cross. Their trajectories form a non-crossing configuration of walks. This configuration is said to be osculating if the walkers never share an edge, and vicious (or: non-intersecting) if they never meet. We give a closed form expression for the generating function of osculating configurations starting from prescribed points. This generating function turns out to be algebraic. We also relate the enumeration of osculating configurations with prescribed starting and ending points to the (better understood) enumeration of non-intersecting configurations. Our method is based on a step by step decomposition of osculating configurations, and on the solution of the functional equation provided by this decomposition

A refined Razumov-Stroganov conjecture

We extend the Razumov-Stroganov conjecture relating the groundstate of the O(1) spin chain to alternating sign matrices, by relating the groundstate of the monodromy matrix of the O(1) model to the so-called refined alternating sign matrices, i.e. with prescribed configuration of their first row, as well as to refined fully-packed loop configurations on a square grid, keeping track both of the loop connectivity and of the configuration of their top row. We also conjecture a direct relation between this groundstate and refined totally symmetric self-complementary plane partitions, namely, in their formulation as sets of non-intersecting lattice paths, with prescribed last steps of all paths.Comment: 20 pages, 4 figures, uses epsf and harvmac macros a few typos correcte

On the functions counting walks with small steps in the quarter plane

Models of spatially homogeneous walks in the quarter plane ${\bf Z}_+^{2}$ with steps taken from a subset $\mathcal{S}$ of the set of jumps to the eight nearest neighbors are considered. The generating function $(x,y,z)\mapsto Q(x,y;z)$ of the numbers $q(i,j;n)$ of such walks starting at the origin and ending at $(i,j) \in {\bf Z}_+^{2}$ after $n$ steps is studied. For all non-singular models of walks, the functions $x \mapsto Q(x,0;z)$ and $y\mapsto Q(0,y;z)$ are continued as multi-valued functions on ${\bf C}$ having infinitely many meromorphic branches, of which the set of poles is identified. The nature of these functions is derived from this result: namely, for all the 51 walks which admit a certain infinite group of birational transformations of ${\bf C}^2$, the interval $]0,1/|\mathcal{S}|[$ of variation of $z$ splits into two dense subsets such that the functions $x \mapsto Q(x,0;z)$ and $y\mapsto Q(0,y;z)$ are shown to be holonomic for any $z$ from the one of them and non-holonomic for any $z$ from the other. This entails the non-holonomy of $(x,y,z)\mapsto Q(x,y;z)$, and therefore proves a conjecture of Bousquet-M\'elou and Mishna.Comment: 40 pages, 17 figure

Enumeration of simple random walks and tridiagonal matrices

We present some old and new results in the enumeration of random walks in one dimension, mostly developed in works of enumerative combinatorics. The relation between the trace of the $n$-th power of a tridiagonal matrix and the enumeration of weighted paths of $n$ steps allows an easier combinatorial enumeration of the paths. It also seems promising for the theory of tridiagonal random matrices .Comment: several ref.and comments added, misprints correcte

Summation and transformation formulas for elliptic hypergeometric series

Using matrix inversion and determinant evaluation techniques we prove several summation and transformation formulas for terminating, balanced, very-well-poised, elliptic hypergeometric series.Comment: 21 pages, AMS-LaTe

Multivariate Lagrange inversion formula and the cycle lemma

International audienceWe give a multitype extension of the cycle lemma of (Dvoretzky and Motzkin 1947). This allows us to obtain a combinatorial proof of the multivariate Lagrange inversion formula that generalizes the celebrated proof of (Raney 1963) in the univariate case, and its extension in (Chottin 1981) to the two variable case. Until now, only the alternative approach of (Joyal 1981) and (Labelle 1981) via labelled arborescences and endofunctions had been successfully extended to the multivariate case in (Gessel 1983), (Goulden and Kulkarni 1996), (Bousquet et al. 2003), and the extension of the cycle lemma to more than 2 variables was elusive. The cycle lemma has found a lot of applications in combinatorics, so we expect our multivariate extension to be quite fruitful: as a first application we mention economical linear time exact random sampling for multispecies trees

A Physicist's Proof of the Lagrange-Good Multivariable Inversion Formula

We provide yet another proof of the classical Lagrange-Good multivariable inversion formula using techniques of quantum field theory.Comment: 9 pages, 3 diagram

Central factorials under the Kontorovich-Lebedev transform of polynomials

We show that slight modifications of the Kontorovich-Lebedev transform lead to an automorphism of the vector space of polynomials. This circumstance along with the Mellin transformation property of the modified Bessel functions perform the passage of monomials to central factorial polynomials. A special attention is driven to the polynomial sequences whose KL-transform is the canonical sequence, which will be fully characterized. Finally, new identities between the central factorials and the Euler polynomials are found.Comment: also available at http://cmup.fc.up.pt/cmup/ since the 2nd August 201

A new approach to deformation equations of noncommutative KP hierarchies

Partly inspired by Sato's theory of the Kadomtsev-Petviashvili (KP) hierarchy, we start with a quite general hierarchy of linear ordinary differential equations in a space of matrices and derive from it a matrix Riccati hierarchy. The latter is then shown to exhibit an underlying 'weakly nonassociative' (WNA) algebra structure, from which we can conclude, refering to previous work, that any solution of the Riccati system also solves the potential KP hierarchy (in the corresponding matrix algebra). We then turn to the case where the components of the matrices are multiplied using a (generalized) star product. Associated with the deformation parameters, there are additional symmetries (flow equations) which enlarge the respective KP hierarchy. They have a compact formulation in terms of the WNA structure. We also present a formulation of the KP hierarchy equations themselves as deformation flow equations.Comment: 25 page