Let $F(t,u)\equiv F(u)$ be a formal power series in $t$ with polynomial coefficients in $u$. Let $F\_1, ..., F\_k$ be $k$ formal power series in $t$, independent of $u$. Assume all these series are characterized by a polynomial equation $$ P(F(u), F\_1, ..., F\_k, t, u)=0. $$ We prove that, under a mild hypothesis on the form of this equation, these $(k+1)$ series are algebraic, and we give a strategy to compute a polynomial equation for each of them. This strategy generalizes the so-called kernel method, and quadratic method, which apply respectively to equations that are linear and quadratic in $F(u)$. Applications include the solution of numerous map enumeration problems, among which the hard-particle model on general planar maps.
Functional equations with one catalytic appear in several combinatorial applications, most notably in the enumeration of lattice paths and in the enumeration of planar maps. The main purpose of this paper is to show that under certain positivity assumptions the dominant singularity of the solutions have a universal behavior. We have to distinguish between linear catalytic equations, where a dominating square root singularity appears, and non-linear catalytic equations, where we - usually - have a singularity of type 3/2.
Catalytic equations appear in several combinatorial applications, most notably in the numeration of lattice path and in the enumeration of planar maps. The main purpose of this paper is to show that the asymptotic estimate for the coefficients of the solutions of (so-called) positive catalytic equations has a universal asymptotic behavior. In particular, this provides a rationale why the number of maps of size $n$ in various planar map classes grows asymptotically like $c\cdot n^{-5/2} γ^n$, for suitable positive constants $c$ and $γ$. Essentially we have to distinguish between linear catalyti…
We use catalytic variables to derive generating functions for the permutation classes $Av(\textbf{4123},\textbf{1324})$, $Av(\textbf{4123},\textbf{1243})$, and $Av(\textbf{4123},\textbf{1342})$. Each generating function is algebraic of degree two, and the growth rates of the classes are 4, 5, and $α$, respectively, where $α\approx 4.17035$. As a consequence of our analysis, we see that a typical large permutation in $Av(\textbf{4123},\textbf{1324})$ is likely to also avoid $\textbf{3124}$, and is even more likely to avoid $\textbf{31524}$. Large permutations which avoid $\textbf{4123}$ and $\t…
In this survey we discuss some of the significant contributions of Ian Goulden and David Jackson in the areas of classical enumeration, symmetric functions, factorizations of permutations, and algebraic foundations of quantum field theory. Through their groundbreaking textbook, {\em Combinatorial Enumeration}, and their numerous research papers, both together and with their many students, they have had an influence in areas of bioinformatics, mathematical chemistry, algorithmic computer science, and theoretical physics. Here we review and set in context highlights of their 40 years of collabor…
We study systems of $n \geq 1$ discrete differential equations of order $k\geq1$ in one catalytic variable and provide a constructive and elementary proof of algebraicity of their solutions. This yields effective bounds and a systematic method for computing the minimal polynomials. Our approach is a generalization of the pioneering work by Bousquet-Mélou and Jehanne (2006).
This paper completes a project to enumerate permutations avoiding a triple T of 4-letter patterns, in the sense of classical pattern avoidance, for every T. There are 317 symmetry classes of such triples T and previous papers have enumerated avoiders for all but 14 of them. One of these 14 is conjectured not to have an algebraic generating function. Here, we find the generating function for each of the remaining 13, and it is algebraic in each case.
This paper is one of a series whose goal is to enumerate the avoiders, in the sense of classical pattern avoidance, for each triple of 4-letter patterns. There are 317 symmetry classes of triples of 4-letter patterns, avoiders of 267 of which have already been enumerated. Here we enumerate avoiders for all small Wilf classes that have a representative triple containing the pattern 1342, giving 40 new enumerations and leaving only 13 classes still to be enumerated. In all but one case, we obtain an explicit algebraic generating function that is rational or of degree 2. The remaining one is show…
The weighted spanning tree enumerator of a graph $G$ with weighted edges is the sum of the products of edge weights over all the spanning trees in $G$. In the special case that all of the edge weights equal $1$, the weighted spanning tree enumerator counts the number of spanning trees in $G$. The Weighted Matrix-Tree Theorem asserts that the weighted spanning tree enumerator can be calculated from the determinant of a reduced weighted Laplacian matrix of $G$. That determinant, however, is not always easy to compute. In this paper, we show how two well-known results from linear algebra, the Mat…
We shall present a ``linear algebraic'' proof (involving some calculations in the algebra of linear operators on a vector space of polynomials and some manipulations of determinants) of the formula for the enumeration of symmetric Gelfand--Tsetlin patterns with fixed bottom row, which was proved by Tri Lai in the context of enumerating symmetric lozenge tilings of a ``halved'' hexagon with ``dents''.
The number of topologically different plane real algebraic curves of a given degree $d$ has the form $\exp(C d^2 + o(d^2))$. We determine the best available upper bound for the constant $C$. This bound follows from Arnold inequalities on the number of empty ovals. To evaluate its rate we show its equivalence with the rate of growth of the number of trees half of whose vertices are leaves and evaluate the latter rate.
Kirchhoff's Matrix-Tree Theorem asserts that the number of spanning trees in a finite graph can be computed from the determinant of any of its reduced Laplacian matrices. In many cases, even for well-studied families of graphs, this can be computationally or algebraically taxing. We show how two well-known results from linear algebra, the Matrix Determinant Lemma and the Schur complement, can be used to elegantly count the spanning trees in several significant families of graphs.
A well-known problem in Algebraic Combinatorics, is the enumeration of circulant graphs. The failure of Adam's Conjecture for such graphs with order containing a repeated prime, led researchers to investigate the problem using two different methods, namely the multiplier method and the structural method. The former makes use of isomorphism theorems whereas the latter involves Schur rings. Both these methods have already been used to count the number of non-isomorphic circulants of order $p^2$. This research focuses on the extension of these two methods to enumerate circulants of order $p^3$, i…
We show that, given a suitable combinatorial specification for a permutation class $\mathcal{C}$, one can obtain a specification for the juxtaposition (on either side) of $\mathcal{C}$ with Av(21) or Av(12), and that if the enumeration for $\mathcal{C}$ is given by a rational or algebraic generating function, so is the enumeration for the juxtaposition. Furthermore this process can be iterated, thereby providing an effective method to enumerate any 'skinny' $k\times 1$ grid class in which at most one cell is non-monotone, with a guarantee on the nature of the enumeration given the nature of th…
We study the enumeration of closed walks of given length and algebraic area on the honeycomb lattice. Using an irreducible operator realization of honeycomb lattice moves, we map the problem to a Hofstadter-like Hamiltonian and show that the generating function of closed walks maps to the grand partition function of a system of particles with exclusion statistics of order $g=2$ and an appropriate spectrum, along the lines of a connection previously established by two of the authors. Reinterpreting the results in terms of the standard Hofstadter spectrum calls for a mixture of $g=1$ (fermion) a…
Enumeration of general planar hypermaps with an alternating boundary
Université Paris-Saclay（巴黎萨克雷大学）；CNRS（法国国家科学研究中心）；CEA（法国原子能和替代能源委员会）；Institut de physique théorique（理论物理研究所）；Institut de Mathématiques d’Orsay（奥赛数学研究所）；Fakultät für Mathematik, Universität Wien（维也纳大学数学系）；CRM, Centre de recherches mathématiques de Montréal（蒙特利尔数学研究中心）
Lecture notes for the proceedings of the workshop "Algebraic Combinatorics related to Young diagram and statistical physics", Aug. 6-10 2012, I.I.A.S., Nara, Japan.
Enumeration problems related to words avoiding patterns as well as permutations that contain the pattern $123$ exactly once have been studied in great detail. However, the problem of enumerating words that contain the pattern $123$ exactly once is new and will be the focus of this paper. Previously, Doron Zeilberger provided a shortened version of Alexander Burstein's combinatorial proof of John Noonan's theorem that the number of permutations with exactly one $321$ pattern is equal to $\frac{3}{n} \binom{2n}{n+3}$. Surprisingly, a similar method can be directly adapted to words. We are able t…
We propose a formula for the enumeration of closed lattice random walks of length $n$ enclosing a given algebraic area. The information is contained in the Kreft coefficients which encode, in the commensurate case, the Hofstadter secular equation for a quantum particle hopping on a lattice coupled to a perpendicular magnetic field. The algebraic area enumeration is possible because it is split in $2^{n/2-1}$ pieces, each tractable in terms of explicit combinatorial expressions.
Recently, Bill Chen, together with his disciples Alvin Dai and Robin Zhou, discovered, and very elegantly proved, an algebraic equation satisfied by the generating function enumerating 123-avoiding words with two occurrences of each of 1, ..., n. Inspired by this result, we present an algorithm for finding such an algebraic equation for the ordinary generating function enumerating 123-avoiding words with exactly r occurrences of each of 1, ... n for any positive integer r, thereby proving that they are algebraic and not merely D-finite (a fact that is promised by WZ theory). Our algorithm cons…
Let k be an algebraically closed field of characteristic 0. Musson and vandenBergh classified primitive ideals for rings of torus invariant differential operators. This classification applies in particular to subquotients of localized extended Weyl algebras where it can be made explicit in terms of convex geometry. We recall these result and then turn to the corresponding primitive quotients and study their Goldie ranks. We prove that the primitive quotients fall into finitely many families whose Goldie ranks are given by a common quasi-polynomial and then realize these quasi-polynomials as Eh…
Let $γ_n$ be the permutation on $n$ symbols defined by $γ_n = (1\ 2\...\ n)$. We are interested in an enumerative problem on colored permutations, that is permutations $β$ of $n$ in which the numbers from 1 to $n$ are colored with $p$ colors such that two elements in a same cycle have the same color. We show that the proportion of colored permutations such that $γ_n β^{-1}$ is a long cycle is given by the very simple ratio $\frac{1}{n- p+1}$. Our proof is bijective and uses combinatorial objects such as partitioned hypermaps and thorn trees. This formula is actually equivalent to the proportio…
A map is a connected topological graph $Γ$ cellularly embedded in a surface. In this paper, applying Tutte's algebraic representation of map, new ideas for enumerating non-equivalent orientable or non-orientable maps of graph are presented. By determining automorphisms of maps of Cayley graph $Γ={\rm Cay}(G:S)$ with ${\rm Aut} Γ\cong G\times H$ on locally, orientable and non-orientable surfaces, formulae for the number of non-equivalent maps of $Γ$ on surfaces (orientable, non-orientable or locally orientable) are obtained . Meanwhile, using reseults on GRR graph for finite groups, we enumerat…
We generalize a formula due to Macdonald that relates the singular Betti numbers of $X^{n}/G$ to those of $X$, where $X$ is a compact manifold and $G$ is any subgroup of the symmetric group $S_{n}$ acting on $X^{n}$ by permuting coordinates. Our result is completely axiomatic: in a general setting, given an endomorphism on the cohomology $H^{\bullet}(X)$, it explains how we can explicitly relate the Lefschetz series of the induced endomorphism on $H^{\bullet}(X^{n})^{G}$ to that of the given endomorphism on $H^{\bullet}(X)$ in the presence of the Künneth formula with respect to a cup product. …
Let $Ω$ be an algebraic closure of ${\mathbb Q}_p$ and let $F$ be a finite extension of ${\mathbb Q}_p$ contained in $Ω$. Given positive integers $f$ and $e$, the number of extensions $K/F$ contained in $Ω$ with residue degree $f$ and ramification index $e$ was computed by Krasner. This paper is concerned with the number ${\mathfrak I}(F,f,e)$ of $F$-isomorphism classes of such extensions. We determine ${\mathfrak I}(F,f,e)$ completely when $p^2\nmid e$ and get partial results when $p^2\parallel e$. When $s$ is large, ${\mathfrak I}({\mathbb Q}_p,f,e)$ is equal to the number of isomorphism cla…
Area-weighted Dyck-paths are a two-dimensional model for vesicles attached to a wall. We model the mechanical response of a vesicle to a pulling force by extending this model. We obtain an exact solution using two different approaches, leading to a q-deformation of an algebraic functional equation, and a q-deformation of a linear functional equation with a catalytic variable, respectively. While the non-deformed linear functional equation is solved by substitution of special values of the catalytic variable (the so-called "kernel method"), the q-deformed case is solved by iterative substitutio…
This short tribute to the guru of Enumerative and Algebraic Combinatorics started out when one the authors(DZ) attended the Stanely@70 conference, that took place at the same time as the preliminary stage of the 2014 World Cup. It states a surprising application of an analog of Richard Stanley's famous theorem about the enumeration of magic squares to the enumeration of possible outcomes in a World Cup Group.
One of the most challenging problems in enumerative combinatorics is to count Wilf classes, where you are given a pattern, or set of patterns, and you are asked to find a "formula", or at least an efficient algorithm, that inputs a positive integer n and outputs the number of permutations avoiding that pattern. In 1996, John Noonan and Doron Zeilberger initiated the counting of permutations that have a prescribed, r, say, occurrences of a given pattern. They gave an ingenious method to generate Functional Equations, alas, with an unbounded number of "catalytic variables", but then described a …
We address the enumeration of coprime polynomial pairs over $\F_2$ where both polynomials have a nonzero constant term, motivated by the construction of orthogonal Latin squares via cellular automata. To this end, we leverage on Benjamin and Bennett's bijection between coprime and non-coprime pairs, which is based on the sequences of quotients visited by dilcuE's algorithm (i.e. Euclid's algorithm ran backward). This allows us to break our analysis of the quotients in three parts, namely the enumeration and count of: (1) sequences of constant terms, (2) sequences of degrees, and (3) sequences …
Classical Gončarov polynomials arose in numerical analysis as a basis for the solutions of the Gončarov interpolation problem. These polynomials provide a natural algebraic tool in the enumerative theory of parking functions. By replacing the differentiation operator with a delta operator and using the theory of finite operator calculus, Lorentz, Tringali and Yan introduced the sequence of generalized Gončarov polynomials associated to a pair $(Δ, Z)$ of a delta operator $Δ$ and an interpolation grid $Z$. Generalized Gončarov polynomials share many nice algebraic properties and have a connecti…
The paper establishes a formula for enumeration of curves of arbitrary genus in toric surfaces. It turns out that such curves can be counted by means of certain lattice paths in the Newton polygon. The formula was announced earlier in http://arxiv.org/abs/math.AG/0209253. The result is established with the help of the so-called tropical algebraic geometry. This geometry allows one to replace complex toric varieties with the Euclidean n-space and holomorphic curves with certain piecewise-linear graphs there.
This thesis provides an extension of the work of Dirk Kreimer and Alain Connes on the Hopf algebra structure of Feynman graphs and renormalization to general graphs. Additionally, an algebraic structure of the asymptotics of formal power series with factorial growth, which is compatible with the Hopf algebraic structure, is introduced. The Hopf algebraic structure on graphs permits the explicit enumeration of graphs with constraints for the allowed subgraphs. In the case of Feynman diagrams a lattice structure, which will be introduced, exposes additional unique properties for physical quantum…
