The following pages link to Ira M. Gessel (Q189445):
Displaying 50 items.
- Enumeration of bipartite graphs and bipartite blocks (Q405245) (← links)
- A bijection between words and multisets of necklaces (Q444410) (← links)
- Jacobi-Stirling polynomials and \(P\)-partitions (Q449225) (← links)
- Counting permutations by alternating descents (Q470946) (← links)
- Hypergraphs and a functional equation of Bouwkamp and de Bruijn (Q556860) (← links)
- Enumeration of point-determining graphs (Q618313) (← links)
- Symmetrically constrained compositions (Q618862) (← links)
- (Q696852) (redirect page) (← links)
- The specification of 2-trees (Q696853) (← links)
- A note on 2-distant noncrossing partitions and weighted Motzkin paths (Q712276) (← links)
- Depth-first search as a combinatorial correspondence (Q754887) (← links)
- Some generalized Durfee square identities (Q798659) (← links)
- Short proofs of Saalschütz's and Dixon's theorems (Q802560) (← links)
- A refinement of Cayley's formula for trees (Q813443) (← links)
- Symmetric inclusion-exclusion (Q817942) (← links)
- Symmetric functions and P-recursiveness (Q916659) (← links)
- A major index for matchings and set partitions (Q941320) (← links)
- A unified elementary approach to the Dyson, Morris, Aomoto, and Forrester constant term identities (Q958748) (← links)
- Multilinear generating functions for Charlier polynomials (Q972827) (← links)
- Note on enumeration of partitions contained in a given shape (Q1044552) (← links)
- Binomial determinants, paths, and hook length formulae (Q1066901) (← links)
- A probabilistic method for lattice path enumeration (Q1081604) (← links)
- Another family of q-Lagrange inversion formulas (Q1088823) (← links)
- A combinatorial proof of the multivariable Lagrange inversion formula (Q1106219) (← links)
- Counting acyclic digraphs by sources and sinks (Q1126301) (← links)
- Permutation statistics and partitions (Q1137999) (← links)
- Some congruences for Apery numbers (Q1162538) (← links)
- A \(q\)-analog of the exponential formula (Q1164047) (← links)
- Super ballot numbers (Q1199816) (← links)
- Counting paths in Young's lattice (Q1209644) (← links)
- Stirling polynomials (Q1246426) (← links)
- Enumeration of tilings of diamonds and hexagons with defects (Q1277784) (← links)
- Counting permutations with given cycle structure and descent set (Q1318366) (← links)
- Talmudic lattice path counting (Q1336450) (← links)
- Generating functions and generalized Dedekind sums. (Q1378530) (← links)
- Lattice walks in \({\mathbf Z}^ d\) and permutations with no long ascending subsequences (Q1379124) (← links)
- Shuffle-compatible permutation statistics (Q1639637) (← links)
- Schur positivity and labeled binary trees (Q1745176) (← links)
- Signed Mahonians (Q1763871) (← links)
- On Miki's identity for Bernoulli numbers (Q1767657) (← links)
- Enumerative applications of a decomposition for graphs and digraphs (Q1893989) (← links)
- Lagrange inversion for species (Q1899063) (← links)
- Counting pairs of lattice paths by intersections (Q1914007) (← links)
- Finding identities with the WZ method (Q1918478) (← links)
- Counting forests by descents and leaves (Q1918883) (← links)
- The Tutte polynomial of a graph, depth-first search, and simplicial complex partitions (Q1918884) (← links)
- Even and odd pairs of lattice paths with multiple intersections (Q1924223) (← links)
- Counting tanglegrams with species (Q2049441) (← links)
- An application of the Goulden-Jackson cluster theorem (Q2109221) (← links)
- Counting acyclic and strong digraphs by descents (Q2198383) (← links)
