A grammar of Dumont and a theorem of Diaconis-Evans-Graham

DOI10.1016/J.AAM.2024.102743MaRDI QIDQ6614406

Amy M. Fu, William Y. C. Chen

Publication date: 7 October 2024

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

fixed pointscontext-free grammarsincreasing binary treessuccessionsthe Diaconis-Evans-Graham theorem

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Permutations, words, matrices (05A05) Theory of computing (68Qxx)

Cites Work

• Title not available (Why is that?)
• The \(q\)-tangent and \(q\)-secant numbers via continued fractions
• The skew, relative, and classical derangements
• William Chen grammars and derivations in trees and arborescences
• A context-free grammar for the \(e\)-positivity of the trivariate second-order Eulerian polynomials
• Unseparated pairs and fixed points in random permutations
• Théorie géométrique des polynômes eulériens
• Unimodal Polynomials Arising from Symmetric Functions
• Permutations by Number of Rises and Successions
• On the joint distributions of succession and Eulerian statistics

This page was built for publication: A grammar of Dumont and a theorem of Diaconis-Evans-Graham

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6614406)