pith. sign in

arxiv: 2604.23959 · v1 · submitted 2026-04-27 · 🧮 math.CO

q-Derivative Grammar

Guo-Niu Han , Kathy Q. Ji , Huan Xiong This is my paper

Pith reviewed 2026-05-08 02:49 UTC · model grok-4.3

classification 🧮 math.CO
keywords q-derivative grammarq-analoguecontext-free grammarq-Eulerian polynomialsgenerating functionscombinatorial enumerationq-calculus
0
0 comments X

The pith

Defining q-derivative grammars extends context-free methods to derive generating functions and recurrences for q-Eulerian, q-Roselle, and q-André polynomials.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper introduces a q-analogue of context-free grammars, called the q-derivative grammar, that incorporates q-derivatives into production rules. It develops a q-grammar calculus that converts these rules into equations for q-exponential generating functions. Concrete grammars are built for the q-Eulerian, q-Roselle, and q-André polynomials to recover their known generating functions and to obtain recurrences. The work carries the grammatical approach into the q-setting for systematic enumeration of q-analogues.

Core claim

The central discovery is the q-derivative grammar, obtained by replacing ordinary derivatives in classical grammar rules with q-derivatives. This grammar directly produces functional equations whose solutions are the q-exponential generating functions of the target polynomials, and the same rules yield explicit recurrences for the polynomials themselves.

What carries the argument

The q-derivative grammar, a collection of labeled production rules that use q-derivatives to encode combinatorial operations and generate q-exponential generating functions.

Load-bearing premise

The q-derivative rules chosen for the grammars must reproduce the standard algebraic properties of known q-analogues without extra adjustments.

What would settle it

Construct the q-grammar for the q-Eulerian polynomials, solve the resulting equation for the generating function, and check whether it equals the established q-analogue formula for those polynomials.

Figures

Figures reproduced from arXiv: 2604.23959 by Guo-Niu Han, Huan Xiong, Kathy Q. Ji.

Figure 1
Figure 1. Figure 1: An inductive definition of T be pointed out that this inversion statistic on increasing binary trees is dif￾ferent from the notion of inversion in rooted labeled trees (see, e.g., Mallows and Riordan [49] and Gessel [33]). Definition 6.2. Let T be an increasing binary trees on the set [n]. An inversion in T is a pair of vertices (i, j) where i > j, and either: (1) j lies to the right of the path from the r… view at source ↗
Figure 2
Figure 2. Figure 2: Two Andr´e trees on [4] It is easy to see that Andr´e I trees can be derived from 0-1-2-increasing trees by requiring the maxima of the two sibling subtrees to be in increasing order, whereas Andr´e II trees can be derived from 0-1-2-increasing trees by requiring the minima of the two sibling subtrees to be in decreasing order. With the conventions that the maximum of an empty tree is 0 and the minimum of … view at source ↗
Figure 3
Figure 3. Figure 3: An Andr´e I trees T on [18]. The remainder of this section is structured as follows. Subsection 6.1 presents the q-grammar for the q-Andr´e I polynomials (6.4) (see Theo￾rem 6.5); Subsection 6.2 is devoted to the q-grammar for the q-Andr´e II polynomials (6.5) (see Theorem 6.12). We remark that this construction extends naturally to yield the q-grammar for q-analogues of k-Andr´e trees. These q-analogues a… view at source ↗
Figure 4
Figure 4. Figure 4: Subtrees rooted at the right children of 4, 5, 6. From view at source ↗
Figure 5
Figure 5. Figure 5: The bijection ϕ6, where M(L6) = {17, 16}. 1 3 8 10 2 9 4 5 6 12 13 14 15 17 7 11 16 18 1 3 8 10 2 9 4 5 6 12 17 13 14 15 18 7 11 16 19 view at source ↗
Figure 6
Figure 6. Figure 6: The bijection ϕ6, where M(L6) = {18, 17, 12}. yields an Andr´e I tree Te := ϕ I v (T). It can be readily seen that the insertion algorithm is reversible. From the construction of the insertion algorithm, it is not difficult to show the following proposition. Proposition 6.7. Let T be an Andr´e I tree on [n] and let v be a vertex in T with at most one child. Suppose that Te = ϕv(T). Then inv(Te) − inv(T) = … view at source ↗
Figure 7
Figure 7. Figure 7: The labeling of an Andr´e I trees T on [18]. and for 1 ≤ i ≤ k − 1, ∆Te I (ai) = ∆T I (ai+1), (d) If v is a leaf of T, then ∆Te I (v) = ∆T I (v) + 1. We are ready to prove Theorem 6.5 by using the grammatical labeling. Let T be the Andr´e I trees on [n]. For 1 ≤ i ≤ n, we label the vertex i in T as follows: • If i is a leaf and ∆I (i) = k, then label it by xk; • If i has only one child and ∆I (i) = k, then… view at source ↗
Figure 8
Figure 8. Figure 8: The labeling of an Andr´e II tree T on [18]. We are ready to prove Theorem 6.12 by using the grammatical labeling. Let T be the Andr´e II trees on [n]. For 1 ≤ i ≤ n, we label the vertex i in T as follows: • If i is a leaf and ∆T II (i) = k, then label it by xk; • If i has only one child and ∆T II (i) = k, then label it by yk−1; • If i has two children, then it is left unlabeled view at source ↗
read the original abstract

The concept of context-free grammar in Combinatorics was first introduced by Chen in 1993. In 1996, Dumont significantly extended the theory of context-free grammars to a variety of other combinatorial models. Substantial progress in this direction has been achieved over the last decade. In this paper, we introduce a $q$-analogue of context-free grammars, which we call the $q$-derivative grammar. We establish the basic framework of $q$-grammars and develop the $q$-grammar calculus for computing $q$-exponential generating functions associated with $q$-grammars. Concrete $q$-grammars are constructed to study $q$-Eulerian, $q$-Roselle and $q$-Andr\'e polynomials, including their generating functions and recurrences. This work extends the grammatical method to the $q$-setting and opens up new research directions.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 1 minor

Summary. The paper introduces a q-analogue of context-free grammars, termed q-derivative grammars. It establishes the basic framework of q-grammars, develops a q-grammar calculus for computing associated q-exponential generating functions, and constructs concrete q-grammars for the q-Eulerian, q-Roselle, and q-André polynomials to obtain their generating functions and recurrences.

Significance. If the q-derivative replacement rules are defined consistently and the calculus reproduces the standard q-analogues in the literature, the work extends Chen's and Dumont's grammatical method to the q-setting. This could provide combinatorial tools for q-enumeration and new recurrences for q-polynomials, with potential for broader applications in q-series combinatorics.

major comments (2)
  1. [Framework of q-grammars] The definition of the q-derivative rules (in the section establishing the basic framework of q-grammars): the replacement rules applied to words or trees must be stated explicitly, and it must be verified that they generate the standard q-Eulerian polynomials (and similarly for q-Roselle and q-André) without case distinctions or parameters chosen to force agreement with known formulas.
  2. [q-grammar calculus] The q-grammar calculus (in the section developing the calculus for q-egfs): the paper must include explicit derivations showing how the calculus produces the claimed q-exponential generating functions and recurrences for at least one of the three polynomial families, with a direct comparison to the literature definitions to confirm consistency.
minor comments (1)
  1. Ensure consistent notation for the q-André polynomials (spelling and accent) between the abstract and the body of the paper.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful reading and constructive comments on our manuscript. We address the major comments point by point below, agreeing that additional explicitness will strengthen the presentation while maintaining the consistency of the q-derivative framework with existing q-analogues.

read point-by-point responses

  1. Referee: [Framework of q-grammars] The definition of the q-derivative rules (in the section establishing the basic framework of q-grammars): the replacement rules applied to words or trees must be stated explicitly, and it must be verified that they generate the standard q-Eulerian polynomials (and similarly for q-Roselle and q-André) without case distinctions or parameters chosen to force agreement with known formulas.

    Authors: We agree that the replacement rules require more explicit statement for clarity. In the revised manuscript, Section 2 will include a dedicated subsection that lists the q-derivative replacement rules for words and trees in full detail. We will then provide a direct, parameter-free verification that the q-grammar for the q-Eulerian polynomials reproduces the standard q-analogue (as defined in the literature) by explicit enumeration of the generated structures, with analogous explicit checks added for the q-Roselle and q-André cases. revision: yes

  2. Referee: [q-grammar calculus] The q-grammar calculus (in the section developing the calculus for q-egfs): the paper must include explicit derivations showing how the calculus produces the claimed q-exponential generating functions and recurrences for at least one of the three polynomial families, with a direct comparison to the literature definitions to confirm consistency.

    Authors: We accept that the calculus section would benefit from expanded explicit derivations. In the revision, we will add a complete step-by-step derivation of the q-exponential generating function and associated recurrence for the q-Eulerian polynomials, obtained directly from the q-grammar calculus. This derivation will be followed by a direct comparison to the standard definitions in the literature to confirm that the results match without adjustment. revision: yes

Circularity Check

0 steps flagged

No circularity: new q-grammar framework introduced and applied without reduction to inputs

full rationale

The paper defines a q-derivative grammar as a new object extending Chen's and Dumont's context-free grammar framework to the q-setting, then develops an associated calculus for q-egfs. Concrete grammars are subsequently constructed for q-Eulerian, q-Roselle and q-André polynomials. No quoted step shows the q-derivative rules being defined in terms of the target polynomials' known generating functions, nor any fitted parameter renamed as a prediction, nor load-bearing self-citation that reduces the central claim to prior work by the same authors. The derivation chain is therefore self-contained: the framework is posited first and the applications follow as illustrations.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

The abstract introduces the q-derivative grammar as a new defined object. No free parameters, axioms, or invented entities beyond the definition itself are mentioned.

pith-pipeline@v0.9.0 · 5444 in / 1131 out tokens · 36066 ms · 2026-05-08T02:49:22.378683+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

62 extracted references · 62 canonical work pages

  1. [1]

    Springer-Verlag, New York, Berlin, Heidelberg, 1979

    Martin Aigner.Combinatorial Theory, volume 234 ofGrundlehren der Mathematis- chen Wissenschaften. Springer-Verlag, New York, Berlin, Heidelberg, 1979. 19

    work page 1979

  2. [2]

    Andrews.The theory of partitions, volume Vol

    George E. Andrews.The theory of partitions, volume Vol. 2 ofEncyclopedia of Mathe- matics and its Applications. Addison-Wesley Publishing Co., Reading, Mass.-London- Amsterdam, 1976. 18

    work page 1976

  3. [3]

    Leonard Carlitz.q-Bernoulli and Eulerian numbers.Transactions of the American Mathematical Society, 76:332–350, 1954. 26

    work page 1954

  4. [4]

    A combinatorial property ofq-Eulerian numbers.The American Mathematical Monthly, 82(1):51–54, 1975

    Leonard Carlitz. A combinatorial property ofq-Eulerian numbers.The American Mathematical Monthly, 82(1):51–54, 1975. 26

    work page 1975

  5. [5]

    William Y. C. Chen. Context-free grammars, differential operators and formal power series.Theoret. Comput. Sci., 117 (1-2):113–129, 1993. 1, 2, 5, 15, 56, 57, 58

    work page 1993

  6. [6]

    William Y. C. Chen and Amy M. Fu. Context-free grammars for permutations and increasing trees.Adv. in Appl. Math., 82:58–82, 2017. 25, 28, 40, 48, 55, 58, 59

    work page 2017

  7. [7]

    William Y. C. Chen and Amy M. Fu. A context-free grammar for thee-positivity of the trivariate second-order Eulerian polynomials.Discrete Math., 345(1):Paper No. 112661, 9, 2022. 60

    work page 2022

  8. [8]

    William Y. C. Chen and Amy M. Fu. The Dumont ansatz for the Eulerian polynomi- als, peak polynomials and derivative polynomials.Ann. Comb., 27(3):707–735, 2023. 26, 59, 60

    work page 2023

  9. [9]

    William Y. C. Chen and Amy M. Fu. A grammatical calculus for peaks and runs of permutations.J. Algebraic Combin., 57(4):1139–1162, 2023. 60

    work page 2023

  10. [10]

    William Y. C. Chen and Amy M. Fu. A grammar of Dumont and a theorem of Diaconis-Evans-Graham.Adv. in Appl. Math., 160:Paper No. 102743, 18, 2024. 60 64 GUO-NIU HAN, KATHY Q. JI, AND HUAN XIONG

    work page 2024

  11. [11]

    William Y. C. Chen, Amy M. Fu, and Elena L. Wang. A grammatical calculus for the ramanujan polynomials, 2025. 60

    work page 2025

  12. [12]

    William Y. C. Chen, Amy M. Fu, and Sherry H. F. Yan. The Gessel correspon- dence and the partialγ-positivity of the Eulerian polynomials on multiset Stirling permutations.European J. Combin., 109:Paper No. 103655, 13, 2023. 60

    work page 2023

  13. [13]

    William Y. C. Chen, Robert X. J. Hao, and Harold R. L. Yang. Context-free gram- mars and stable multivariate polynomials over Stirling permutations. InAlgorithmic combinatorics: enumerative combinatorics, special functions and computer algebra— in honour of Peter Paule on his 60th birthday, Texts Monogr. Symbol. Comput., pages 109–135. Springer, Cham, [20...

    work page 2020

  14. [14]

    William Y. C. Chen and Harold R. L. Yang. A context-free grammar for the Ramanujan-Shor polynomials.Adv. in Appl. Math., 126:Paper No. 101908, 24, 2021. 60

    work page 2021

  15. [15]

    Three models for the description of language.IRE Transactions on information theory, 2(3):113–124, 1956

    Noam Chomsky. Three models for the description of language.IRE Transactions on information theory, 2(3):113–124, 1956. 2, 5

    work page 1956

  16. [16]

    Janet J. W. Dong, Lora R. Du, Kathy Q. Ji, and Dax T. X. Zhang. New refinements of Narayana polynomials and Motzkin polynomials.Adv. in Appl. Math., 166:Paper No. 102855, 40, 2025. 60

    work page 2025

  17. [17]

    Une g´ en´ eralisation trivari´ ee sym´ etrique des nombres eul´ eriens

    Dominique Dumont. Une g´ en´ eralisation trivari´ ee sym´ etrique des nombres eul´ eriens. J. Combin. Theory Ser. A, 28(3):307–320, 1980. 59

    work page 1980

  18. [18]

    Une approche combinatoire des fonctions elliptiques de jacobi

    Dominique Dumont. Une approche combinatoire des fonctions elliptiques de jacobi. Adv. in Math., 41:1–39, 1981. 59

    work page 1981

  19. [19]

    Grammaires de William Chen et d´ erivations dans les arbres et arborescences.S´ em

    Dominique Dumont. Grammaires de William Chen et d´ erivations dans les arbres et arborescences.S´ em. Lothar. Combin., 37:Art. B37a, 21, 1996. 1, 25, 26, 39, 40, 56, 58, 59

    work page 1996

  20. [20]

    Grammaire de Ramanujan et arbres de Cayley.Electron

    Dominique Dumont and Armand Ramamonjisoa. Grammaire de Ramanujan et arbres de Cayley.Electron. J. Combin., 3(2):Research Paper 17, approx. 18, 1996. The Foata Festschrift. 59, 60

    work page 1996

  21. [21]

    De partitione numerorum

    Leonhard Euler. De partitione numerorum. In Adolf Krazer and Ferdinand Rudio, editors,Introductio in analysin infinitorum, volume I8 ofOpera Omnia, chapter 16, pages 313–338. B.G. Teubner, 1748. Reprinted in 1922. 3

    work page 1922

  22. [22]

    Arbres minimax et polynˆ omes d’andr´ e.Advances in Applied Mathematics, 27(2-3):367–389, 2001

    Dominique Foata and Guo-Niu Han. Arbres minimax et polynˆ omes d’andr´ e.Advances in Applied Mathematics, 27(2-3):367–389, 2001. 42

    work page 2001

  23. [23]

    Arbres minmax et polynˆ omes d’andr´ e.Advances in Applied Mathematics, 27(2-3):367–389, 2001

    Dominique Foata and Guo-Niu Han. Arbres minmax et polynˆ omes d’andr´ e.Advances in Applied Mathematics, 27(2-3):367–389, 2001. 60

    work page 2001

  24. [24]

    Multivariable tangent and secantq-derivative polynomials.Mosc

    Dominique Foata and Guo-Niu Han. Multivariable tangent and secantq-derivative polynomials.Mosc. J. Comb. Number Theory, 2(3):34–84, 2012. 1, 2, 3, 4, 12, 13, 14

    work page 2012

  25. [25]

    Sch¨ utzenberger.Th´ eorie g´ eom´ etrique des polynˆ omes eul´ eriens, volume Vol

    Dominique Foata and Marcel-P. Sch¨ utzenberger.Th´ eorie g´ eom´ etrique des polynˆ omes eul´ eriens, volume Vol. 138 ofLecture Notes in Mathematics. Springer-Verlag, Berlin- New York, 1970. 26, 27

    work page 1970

  26. [26]

    Nombres d’euler et permutations alternantes

    Dominique Foata and Marcel-Paul Sch¨ utzenberger. Nombres d’euler et permutations alternantes. In J. N. et al. Srivastava, editor,A survey of combinatorial theory, pages 173–187. North-Holland, Amsterdam, 1973. 40, 59

    work page 1973

  27. [27]

    Rearrangements of the symmetric group and enumerative properties of the tangent and secant numbers.Mathematische Zeitschrift, 137(3):257–264, 1974

    Dominique Foata and Volker Strehl. Rearrangements of the symmetric group and enumerative properties of the tangent and secant numbers.Mathematische Zeitschrift, 137(3):257–264, 1974. 40

    work page 1974

  28. [28]

    Euler numbers and variations of permutations, colloquio.Internazionale sulle Teorie Combinatorie (Roma, 1973), Tomo I, 119–131

    Dominique Foata and Volker Strehl. Euler numbers and variations of permutations, colloquio.Internazionale sulle Teorie Combinatorie (Roma, 1973), Tomo I, 119–131. Atti dei Convegni Lincei, No. 17, Accademia Nazionale dei Lincei, Rome, 1976. 40

    work page 1973

  29. [29]

    Amy M. Fu. A context-free grammar for peaks and double descents of permutations. Adv. in Appl. Math., 100:179–196, 2018. 60

    work page 2018

  30. [30]

    Fu and Frank Z

    Amy M. Fu and Frank Z. K. Li. Joint distributions of permutation statistics and the parabolic cylinder functions.European J. Combin., 85:103060, 23, 2020. 60 q-DERIVATIVE GRAMMAR 65

    work page 2020

  31. [31]

    Adriano M. Garsia. On the ‘maj’ and ‘inv’q-analogues of Eulerian polynomials.Linear and Multilinear Algebra, 8(1):21–34, 1979/80. 26

    work page 1979

  32. [32]

    Cambridge University Press, Cam- bridge, second edition, 2004

    George Gasper and Mizan Rahman.Basic hypergeometric series, volume 96 ofEn- cyclopedia of Mathematics and its Applications. Cambridge University Press, Cam- bridge, second edition, 2004. With a foreword by Richard Askey. 2, 3

    work page 2004

  33. [33]

    Gessel, Bruce E

    Ira M. Gessel, Bruce E. Sagan, and Yeong-Nan Yeh. Enumeration of trees by inver- sions.Journal of Graph Theory, 19(4):435–459, 1995. 42

    work page 1995

  34. [34]

    On the foundations of combinatorial theory iv: Finite vector spaces and eulerian generating functions.Studies in Applied Mathemat- ics, 49(3):239–258, 1970

    Jay Goldman and Gian-Carlo Rota. On the foundations of combinatorial theory iv: Finite vector spaces and eulerian generating functions.Studies in Applied Mathemat- ics, 49(3):239–258, 1970. 15

    work page 1970

  35. [35]

    Eulerian polynomials and theg-indices of Young tableaux.Proc

    Guo-Niu Han and Shi-Mei Ma. Eulerian polynomials and theg-indices of Young tableaux.Proc. Amer. Math. Soc., 152(4):1437–1449, 2024. 60

    work page 2024

  36. [36]

    Michael E. Hoffman. Derivative polynomials for tangent and secant.Amer. Math. Monthly, 102(1):23–30, 1995. 13

    work page 1995

  37. [37]

    Introduction to automata theory, languages, and computation, 2001

    John E Hopcroft, Jeffrey D Ullman, Rajeev Motwani, et al. Introduction to automata theory, languages, and computation, 2001. 2, 5

    work page 2001

  38. [38]

    F. H. Jackson. A basic-sine and cosine with symbolical solutions of certain differential equations.Proc. Edinburgh Math. Soc., 22:28–39, 1904. 3

    work page 1904

  39. [39]

    Kathy Q. Ji. The (α, β)-Eulerian polynomials and descent-Stirling statistics on per- mutations.Sci. China Math., 68(9):2259–2284, 2025. 60

    work page 2025

  40. [40]

    Ji and Zhicong Lin

    Kathy Q. Ji and Zhicong Lin. The binomial-Stirling-Eulerian polynomials.European J. Combin., 120:Paper No. 103962, 15, 2024. 60

    work page 2024

  41. [41]

    Cambridge University Press, 1980

    David Lawrence Johnson.Topics in the theory of group presentations, volume 42. Cambridge University Press, 1980. 5

    work page 1980

  42. [42]

    Two involutions for signed excedance numbers

    G´ erald Ksavrelof and Jiang Zeng. Two involutions for signed excedance numbers. S´ eminaire Lotharingien de Combinatoire, 49:Article B49e, 8 pages, 2003. Available athttps://www.mat.univie.ac.at/ ~slc/wpapers/s49zeng.pdf. 26

    work page 2003

  43. [43]

    A. G. Kuznetsov, I. M. Pak, and A. E. Postnikov. Increasing trees and alternating permutations.Russian Mathematical Surveys, 49(6):79–114, 1994. 40

    work page 1994

  44. [44]

    Derivative polynomials and enumeration of permutations by number of interior and left peaks.Discrete Math., 312(2):405–412, 2012

    Shi-Mei Ma. Derivative polynomials and enumeration of permutations by number of interior and left peaks.Discrete Math., 312(2):405–412, 2012. 60

    work page 2012

  45. [45]

    Alternating Eulerian polynomials and left peak polynomials.Discrete Math., 345(3):Paper No

    Shi-Mei Ma, Qi Fang, Toufik Mansour, and Yeong-Nan Yeh. Alternating Eulerian polynomials and left peak polynomials.Discrete Math., 345(3):Paper No. 112714, 12,

    work page

  46. [46]

    Excedance-type polynomials, gamma-positivity and alternatingly increasing property.European Journal of Com- binatorics, 118:103869, 2024

    Shi-Mei Ma, Jun Ma, Jean Yeh, and Yeong-Nan Yeh. Excedance-type polynomials, gamma-positivity and alternatingly increasing property.European Journal of Com- binatorics, 118:103869, 2024. 26

    work page 2024

  47. [47]

    Shi-Mei Ma, Jun Ma, and Yeong-Nan Yeh.γ-positivity and partialγ-positivity of descent-type polynomials.J. Combin. Theory Ser. A, 167:257–293, 2019. 60

    work page 2019

  48. [48]

    Context-free grammars for several polynomials associated with Eulerian polynomials.Electron

    Shi-Mei Ma, Jun Ma, Yeong-Nan Yeh, and Bao-Xuan Zhu. Context-free grammars for several polynomials associated with Eulerian polynomials.Electron. J. Combin., 25(1):Paper No. 1.31, 17, 2018. 60

    work page 2018

  49. [49]

    C. L. Mallows and John Riordan. The inversion enumerator for labeled trees.Bull. Amer. Math. Soc., 74(1):92–96, 1968. 42

    work page 1968

  50. [50]

    Kyle Petersen.Eulerian Numbers

    T. Kyle Petersen.Eulerian Numbers. Birkh¨ auser Advanced Texts: Basler Lehrb¨ ucher. Birkh¨ auser/Springer, New York, 2015. 26

    work page 2015

  51. [51]

    Springer,

    Jean-Pierre Serre et al.Linear representations of finite groups, volume 42. Springer,

    work page

  52. [52]

    Wachs.q-Eulerian polynomials: excedance number and major index.Electronic Research Announcements of the American Mathematical Society, 13:33–45, 2007

    John Shareshian and Michelle L. Wachs.q-Eulerian polynomials: excedance number and major index.Electronic Research Announcements of the American Mathematical Society, 13:33–45, 2007. 26

    work page 2007

  53. [53]

    John Shareshian and Michelle L. Wachs. Eulerian quasisymmetric functions.Advances in Mathematics, 225(6):2921–2966, 2011. 26 66 GUO-NIU HAN, KATHY Q. JI, AND HUAN XIONG

    work page 2011

  54. [54]

    The symmetric and unimodal expansion of Eulerian polynomials via continued fractions.European J

    Heesung Shin and Jiang Zeng. The symmetric and unimodal expansion of Eulerian polynomials via continued fractions.European J. Combin., 33(2):111–127, 2012. 26

    work page 2012

  55. [55]

    Peter W. Shor. A new proof of Cayley’s formula for counting labeled trees.J. Combin. Theory Ser. A, 71(1):154–158, 1995. 60

    work page 1995

  56. [56]

    Introduction to the theory of computation, 2012

    Michael Sipser. Introduction to the theory of computation, 2012. 2, 5

    work page 2012

  57. [57]

    Richard P. Stanley. Binomial posets, M¨ obius inversion, and permutation enumeration. J. Combinatorial Theory Ser. A, 20(3):336–356, 1976. 28

    work page 1976

  58. [58]

    Richard P. Stanley. A survey of alternating permutations. InCombinatorics and Graphs: The Twentieth Anniversary Conference of IPM Combinatorics, volume 531 ofContemporary Mathematics, pages 165–196. American Mathematical Society, 2010. 40

    work page 2010

  59. [59]

    Stanley.Enumerative combinatorics

    Richard P. Stanley.Enumerative combinatorics. Volume 1, volume 49 ofCambridge Studies in Advanced Mathematics. Cambridge University Press, Cambridge, second edition, 2012. 41

    work page 2012

  60. [60]

    Nombres d’euler et permutations alternantes.Ph

    Volker Strehl. Nombres d’euler et permutations alternantes.Ph. D. Thesis, University of Florida, Gainesville, 1974. 40

    work page 1974

  61. [61]

    Harold R. L. Yang and Philip B. Zhang. Stable multivariate Narayana polynomials and labeled plane trees.Adv. in Appl. Math., 166:Paper No. 102867, 23, 2025. 60

    work page 2025

  62. [62]

    A Ramanujan sequence that refines the Cayley formula for trees.Ra- manujan J., 3(1):45–54, 1999

    Jiang Zeng. A Ramanujan sequence that refines the Cayley formula for trees.Ra- manujan J., 3(1):45–54, 1999. 60 I.R.M.A., UMR 7501, Universit´e de Strasbourg et CNRS, 7 rue Ren´e Descartes, F-67084 Strasbourg, France Email address:guoniu.han@unistra.fr Center for Applied Mathematics and KL-AAGDM, Tianjin University, Tian- jin 300072, P.R. China Email addr...

    work page 1999