The inversion enumerator for labeled trees
From MaRDI portal
Publication:5652684
DOI10.1090/S0002-9904-1968-11888-9zbMATH Open0242.05004OpenAlexW2090682229WikidataQ56805756 ScholiaQ56805756MaRDI QIDQ5652684FDOQ5652684
Colin L. Mallows, John Riordan
Publication date: 1968
Published in: Bulletin of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/s0002-9904-1968-11888-9
Cited In (37)
- Inversions in split trees and conditional Galton--Watson trees
- The enumeration of connected graphs and linked diagrams
- Cayley compositions, partitions, polytopes, and geometric bijections
- The metric space of limit laws for $q$-hook formulas
- Inversions in Split Trees and Conditional Galton–Watson Trees
- Triangulations of Cayley and Tutte polytopes
- Conjectures on the quotient ring by diagonal invariants
- Generalized parking functions, tree inversions, and multicolored graphs
- Trees, parking functions and factorizations of full cycles
- Parking functions and tree inversions revisited
- Sorting index and Mahonian-Stirling pairs for labeled forests
- Parking functions, valet functions and priority queues
- Zeros of the deformed exponential function
- Quasirandom Graphs and the Pantograph Equation
- Depth-first search as a combinatorial correspondence
- q-hook length formulas for forests
- Moments and properties of multiplicatively constrained bivariate lognormal distributions with applications to futures hedging
- Parking functions: from combinatorics to probability
- A new proof of Cayley's formula for counting labeled trees
- Gončarov polynomials and parking functions
- Mahonian statistics on labeled forests
- Generalized tree inversions and \(k\)-parking functions
- Une famille de polynômes ayant plusieurs propriétés enumeratives
- Title not available (Why is that?)
- Persistence for a class of order-one autoregressive processes and Mallows-Riordan polynomials
- \(k\)-factorizations of the full cycle and generalized Mahonian statistics on \(k\)-forests
- Pattern restricted quasi-Stirling permutations
- Enumerative applications of a decomposition for graphs and digraphs
- Airy distribution function: from the area under a Brownian excursion to the maximal height of fluctuating interfaces
- Embedding small digraphs and permutations in binary trees and split trees
- Limiting distributions for the number of inversions in labelled tree families
- A simple bijection for the regions of the Shi arrangement of hyperplanes
- Rooted forests that avoid sets of permutations
- A class of labeled posets and the Shi arrangement of hyperplanes
- Combinatorics of the Delta conjecture at \(q=-1\)
- Nombres d'Euler et inversions dans les arbres
- Weighted-inversion statistics and their symmetry groups
This page was built for publication: The inversion enumerator for labeled trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5652684)