Related papers: Elliptic enumeration of nonintersecting lattice pa…
This thesis deals with the enumerative study of combinatorial maps, and its application to the enumeration of other combinatorial objects. Combinatorial maps, or simply maps, form a rich combinatorial model. They have an intuitive and…
Bouttier, Di Francesco and Guitter introduced a method for solving certain classes of algebraic recurrence relations arising the context of embedded trees and map enumeration. The aim of this note is to apply this method to three problems.…
We provide elliptic extensions of elementary identities such as the sum of the first $n$ odd or even numbers, the geometric sum and the sum of the first $n$ cubes. Many such identities, and their $q$-analogues, are indefinite sums, and can…
This paper presents an algebraic construction of Euler-Maclaurin formulas for polytopes. The formulas obtained generalize and unite the previous lattice point formulas of Morelli and Pommersheim-Thomas, and the Euler-Maclaurin formulas of…
We address the six vertex model on a random lattice, which in combinatorial terms corresponds to the enumeration of weighted 4-valent planar maps equipped with an Eulerian orientation. This problem was exactly, albeit non-rigorously solved…
Given a gene tree topology and a species tree topology, a coalescent history represents a possible mapping of the list of gene tree coalescences to associated branches of a species tree on which those coalescences take place. Enumerative…
For $0\leq k \leq n$, the number $C(n,k)$ represents the number of all lattice paths in the plane from the point $(0,0)$ to the point $(n,k)$, using steps $(1,0)$ and $(0,1)$, that never rise above the main diagonal $y=x$. The Fuss-Catalan…
A lattice path inside the $m\times n$ table $T$ is a sequence $\nu_1,\ldots,\nu_k$ of cells such that $\nu_{j+1}-\nu_j\in\{(1,-1),(1,0),(1,1)\}$ for all $j=1,\ldots,k-1$. The number of lattice paths in $T$ from the first column to the…
The enumeration of planar maps equipped with an Eulerian orientation has attracted attention in both combinatorics and theoretical physics since at least 2000. The case of 4-valent maps is particularly interesting: these orientations are in…
Fix an elliptic curve $E_0$ without CM and a non-isotrivial elliptic scheme over a smooth irreducible curve, both defined over the algebraic numbers. Consider the union of all images of a fixed finite-rank subgroup (of arbitrary rank) of…
Gessel walks are lattice paths confined to the quarter plane that start at the origin and consist of unit steps going either West, East, South-West or North-East. In 2001, Ira Gessel conjectured a nice closed-form expression for the number…
In the past decade, a lot of attention has been devoted to the enumera-tion of walks with prescribed steps confined to a convex cone. In two dimensions, this means counting walks in the first quadrant of the plane (possibly after a linear…
We give closed form evaluations for many families of integrals, whose integrands contain algebraic functions of the complete elliptic integrals $K$ and $E$. Our methods exploit the rich structures connecting complete elliptic integrals,…
We study existence and Lorentz regularity of distributional solutions to elliptic equations with either a convection or a drift first order term. The presence of such a term makes the problem not coercive. The main tools are pointwise…
Bordered and framed Toeplitz/Hankel determinants have the same structure as Toeplitz/Hankel determinants except in small number of matrix rows and/or columns. We review these structured determinants and their connections to orthogonal…
A circular Pascal array is a periodization of the familiar Pascal's triangle. Using simple operators defined on periodic sequences, we find a direct relationship between the ranges of the circular Pascal arrays and numbers of certain…
We find the exponential generating function for permutations with all valleys even and all peaks odd, and use it to determine the asymptotics for its coefficients, answering a question posed by Liviu Nicolaescu. The generating function can…
We prove analogues for elliptic interpolation functions of Macdonald's version of the Littlewood identity for (skew) Macdonald polynomials, in the process developing an interpretation of general elliptic "hypergeometric" sums as skew…
The Young--Fibonacci graph is the Hasse diagram of one of the two (along with the Young lattice) 1-differential graded modular lattices. This explains the interest to path enumeration problems in this graph. We obtain a formula for the…
The purpose of these notes is to introduce some of the problems the enumeration of lattice walks is dedicated to and familiarize with some of the arguments they can be addressed with. We discuss the enumeration of lattice walks, their…