Pith. sign in

REVIEW 2 major objections 5 minor 59 references

Normal ordering in the $(p,q)$-deformed generalized Weyl algebra. III: The binomial formula

T0 review · 2 major / 5 minor · reviewed 2026-07-14 · grok-4.5

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read The noncommutative binomial (X+Y)^m expands with coefficients that are sums of (p,q)-weighted s-rook numbers on Young diagrams.

desk verdict Solid third paper that unifies classical noncommutative binomials under (p,q)-rook numbers and adds genuine new coefficients; the only real soft spot is dependence on the authors' prior rook weight. read the letter →

arxiv 2607.11693 v1 pith:RVOCYBDZ submitted 2026-07-13 math.CO

Toufik Mansour , Lahcen Oussi , Matthias Schork This is my paper · ORCID
classification math.CO MSC 05A1005A1905A3011B6511B7316S99
keywords generalizedWeylalgebranormalordering(pq)-commutingvariablesbinomialformulaYoungdiagramsrooknumberss-rooknoncommutative
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

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

The reading

This paper studies powers of a sum of noncommuting generators inside a $(p,q)$-deformed generalized Weyl algebra. The generators $X$, $Y$ and $Z_p$ obey the relations $XY - q YX = h Y^s Z_p$ together with two scaling rules that make $Z_p$ act like a $p$-deformation. Expanding $(X+Y)^m$ produces a linear combination of normal-ordered words $Y^a Z_p^b X^c$. The authors prove that the numerical coefficient of each such word is exactly the sum of certain $(p,q)$-deformed $s$-rook numbers taken over every Young diagram that fits inside a fixed rectangle. By specializing the deformation parameters and the exponent $s$ they recover the classical $q$-binomial theorem, the Weyl-algebra binomial formula of Yamazaki and Varvak, Benaoum's $h$- and $(q,h)$-binomial formulae for the Jordan plane, and several new $(p,q)$-analogues that involve operator-valued Hermite or Bell polynomials.

What carries the argument

The $(p,q)$-deformed $s$-rook numbers $R_{s,1;p,q}[B_\lambda,k]$ that weight each non-attacking rook placement by counting $t$-boxes, $\ell$-boxes and empty boxes under the $s$-row creation rule; their sum over all diagrams of a given shape is precisely the normal-ordering coefficient $J_{s,p,q}$.

What would settle it

Compute the left-hand side $(X+Y)^m$ by hand for small $m$ (say $m=3$ or $4$) using only the defining commutation relations, extract the coefficient of a concrete monomial $Y^a Z_p^b X^c$, and check whether it equals the independently enumerated sum of $(p,q)$-weighted $s$-rook numbers over the corresponding Young diagrams.

Watch

Extended reading notes

Core claim

For generators satisfying $XY - q YX = h Y^s Z_p$, $X Z_p = p Z_p X$ and $Z_p Y = p Y Z_p$, the expansion of $(X+Y)^m$ in normal order is given by a double sum whose coefficients $J_{s,p,q}(m,\ell,k)$ equal the sum of the $(p,q)$-deformed $s$-rook numbers of all Ferrers boards associated with partitions inside the rectangle of size $(m-\ell)$ by $\ell$.

Load-bearing premise

The entire binomial formula rests on an earlier identification that equates algebraic normal-ordering coefficients with the particular $(p,q)$-weights assigned to $s$-rook placements; if those weights are wrong for $p \neq 1$, every subsequent formula fails.

Editorial extensions

If this is right

  • Classical q-binomial, Weyl-binomial and Jordan-plane binomial formulae appear as immediate specializations of a single rook-theoretic expression.
  • New (p,q)-analogues of Hermite, Bell and Bessel polynomials arise as generating functions for the same rook numbers.
  • Operator realizations via the (p,q)-derivative yield deformed Burchnall-type identities for concrete differential operators.
  • The same rook numbers give closed forms for the generalized Stirling numbers that count normal-ordered words in the algebra.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The same weighted-rook dictionary should extend, with only notational changes, to the still-open case in which the right-hand side is an arbitrary polynomial f(Y) rather than a pure monomial Y^s.
  • A purely bijective proof that equates the algebraic coefficient J with the rook sum, without invoking the earlier normal-ordering theorem, would remove the dependence on the preceding paper.
  • The operator-valued (p,q)-Hermite polynomials introduced here may satisfy a three-term recurrence or an orthogonality relation that has not yet been written down.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

2 major / 5 minor

Summary. The paper derives the normal-ordered expansion of (X+Y)^m in the (p,q)-deformed generalized Weyl algebra A_{s;h|p,q} generated by XY-qYX=h Y^s Z_p, XZ_p=p Z_p X, Z_p Y=p Y Z_p. Expanding into binary words, mapping them bijectively to Young diagrams in I_m (Theorem 3.1), and applying the normal-ordering formula of Theorem 2.9 yields Theorem 3.3: (X+Y)^m = sum_ℓ sum_k h^k J_{s,p,q}(m,ℓ,k) Y^{m-ℓ+(s-1)k} Z_p^k X^{ℓ-k}. Corollary 3.9 identifies J with the sum of (p,q)-deformed s-rook numbers R_{s,1;p,q}[B_λ,k] over λ∈I_{m-ℓ,ℓ}. Specializations recover the quantum-plane q-binomial theorem, Weyl/q-Weyl binomial coefficients and Burchnall-type identities, shift/Jordan binomial coefficients (linked to Stirling/cycle numbers and h-binomials), and analogous formulas for s=3 involving Bessel numbers; several (p,q)-extensions and Conjecture 3.37 are new.

Significance. The work systematically unifies classical noncommutative binomial formulas (Potter–Schützenberger, Benaoum, Viskov, Varvak, Cigler, etc.) under a single (p,q)-rook-theoretic umbrella and produces new (p,q)-Weyl, shift and Jordan binomial coefficients together with operator-valued Hermite-type polynomials and a (p,q)-Burchnall identity. The derivation path is transparent, specializations are checked against independent literature, and the combinatorial interpretation via (p,q)-weighted s-rook numbers supplies a concrete counting model. Strengths include explicit recovery of known identities, isolation of the open Conjecture 3.37, and the production of several new coefficient families that invite further combinatorial study.

major comments (2)
  1. The identification J_{s,p,q}(m,ℓ,k)=sum_λ R_{s,1;p,q}[B_λ,k] (Corollary 3.9) rests entirely on the weight ω_{s;p,q} and the normal-ordering theorem imported from the authors’ Part II (Theorem 2.8 / Definition 2.6). For p≠1 the assignment of p-powers to t- and ℓ-boxes is non-standard; a short self-contained verification for a small board (e.g., the 2-column case that recovers the known q-Weyl or Jordan coefficients) would make the combinatorial side of the main claim independent of the prior paper.
  2. Conjecture 3.37 (and the equivalent claim for the (p,q)-Jordan binomial coefficients) is left open. While correctly isolated, the paper’s claim of a full (p,q)-analog of Benaoum’s formula (Eq. (113)) is incomplete without either a proof or an explicit counter-example for small m,k. Resolving or clearly demarcating this gap would strengthen the s=2 section.
minor comments (5)
  1. In Example 3.4 the verification for m=2 is correct but the intermediate claim J_{s,p,q}(2,2,1)=0, J(2,2,2)=0 could be accompanied by a one-line reference to the empty sum over |k|=1,2 on a board with only two columns.
  2. Notation for the various binomial coefficients (Weyl {m choose ℓ}_k, shift ⟨m choose ℓ⟩_k, Jordan ⟦m choose ℓ⟧_k, etc.) proliferates; a short summary table in §3 would improve readability.
  3. Typographical inconsistencies appear in the arXiv source (e.g., “pp, qq” vs. “(p,q)”, occasional missing spaces around operators). A uniform (p,q) notation throughout would help.
  4. References to Parts I–II are given only as arXiv links; once those papers are published the bibliographic entries should be updated.
  5. Remark 3.25 notes that a combinatorial proof of the Blumen formula (79) would be desirable; even a brief indication whether the rook weight reproduces the product of even q-numbers would be useful.

Circularity Check

1 steps flagged · score 2.0 of 10

Ordinary multi-paper self-citation of prior algebraic/rook framework; no definitional loop or fitted-as-prediction circularity in the binomial derivation.

  1. self citation load bearing [Section 2 (Theorems 2.8–2.9) and their use in Section 3 (proof of Theorem 3.3 / Corollary 3.9)]
    "In general, we have the following result [30]. Theorem 2.8. Let wm,n = Y^{nr} X^{mr} ⋯ Y^{n1} X^{m1} be a word … Then one has the normal ordering result (17) wm,n = ∑ Rs,h;p,q[Bwm,n , k] Y^{|n|+(s−1)k} Z_p^k X^{|m|−k} … The following theorem from [29] plays a crucial role … Theorem 2.9. … ω = ∑ h^{|k|} p^{Pr(m,k)} q^{Qr|s(m,n,k)} …"

    The algebraic normal-ordering expansion (Thm 2.9) and its identification with (p,q)-weighted s-rook numbers (Thm 2.8 / Def 2.6) are taken as black boxes from the authors’ own Parts I–II and applied verbatim to every binary word arising from (X+Y)^m. The central claim of Cor 3.9 (J = sum of those rook numbers) therefore rests on that self-citation chain. The step is only mildly circular: the prior results are independent combinatorial identities, not tautological redefinitions of the binomial coefficients themselves, and the present derivation remains transparent once they are granted.

full rationale

The paper is a sequential Part III that expands (X+Y)^m by writing it as a sum of binary words (Theorem 3.1, standard) and then normal-orders each word via the algebraic formula of Theorem 2.9 (imported from Part I) and the (p,q)-s-rook interpretation of Theorem 2.8/Definition 2.6 (imported from Part II). The resulting coefficients J_{s,p,q}(m,ℓ,k) are thereby identified with sums of those rook numbers (Corollary 3.9). This is ordinary citation of prior independent combinatorial identities in a series; the prior results are not defined in terms of the binomial formula, contain no fitted parameters, and are not uniqueness theorems that force the present claim. Specializations recover classical formulas (Weyl, q-Weyl, Jordan, quantum plane, etc.) by direct substitution, confirming independent content. Conjecture 3.37 is correctly left open and unused. No self-definitional reduction, no ansatz smuggled as theorem, and no renaming of a known empirical pattern appears. Score 2 reflects only the minor, non-load-bearing self-citation typical of multi-part mathematical series.

Assumptions & free parameters 0 free parameters · 4 assumptions · 2 invented entities

The paper works entirely inside a finitely presented associative algebra whose generators and relations are fixed at the outset; the only external inputs are standard combinatorial constructions (Young diagrams, rook placements) and the authors' own prior normal-ordering theorems. No numerical fitting occurs. The single open conjecture is not used as an axiom.

assumptions (4)
  • domain assumption The algebra A_{s;h|p,q} is the unital associative algebra generated by X,Y,Z_p subject to XY-qYX=h Y^s Z_p, XZ_p=p Z_p X, Z_p Y=p Y Z_p, Z_1=I (Definition 2.1).
    All subsequent identities are identities inside this algebra; the relations are postulated, not derived.
  • domain assumption Normal ordering of an arbitrary word equals a weighted sum of (p,q)-deformed s-rook numbers on the associated Ferrers board (Theorem 2.8, imported from Part II).
    Used as a black-box input for every binomial coefficient identification in Section 3.
  • standard math There is a bijection between binary words of length m over {X,Y} and Young diagrams in I_m (Theorem 3.1, cited from [34]).
    Standard combinatorial fact used to expand (X+Y)^m.
  • standard math Ordinary rook, file and i-rook numbers count non-attacking placements under the stated row-creation rules (Definitions 2.3–2.6).
    Classical rook theory extended by Goldman–Haglund and by the authors' Part II.
invented entities (2)
  • (p,q)-deformed s-rook numbers R_{s,h;p,q}[B,k]
    purpose: Provide the combinatorial weight that equals the algebraic normal-ordering coefficient of each word.
    Introduced in the authors' Part II; the present paper only applies them. Independent combinatorial definition exists, but independent verification outside the series is limited.
  • Coefficients J_{s,p,q}(m,ℓ,k) and the associated (p,q)-Weyl / shift / Jordan binomial coefficients independent evidence
    purpose: Package the summed rook numbers that appear in the binomial expansion.
    Defined by the paper as the normal-ordering coefficients themselves; they are not free inventions but notational packaging of already-derived sums.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Normal ordering in the $(p,q)$-deformed generalized Weyl algebra. III: The binomial formula." pith.science (2026). https://pith.science/paper/RVOCYBDZ

@misc{pith2026260711693,
  author       = {Pith},
  title        = {Pith review of: Normal ordering in the $(p,q)$-deformed generalized Weyl algebra. III: The binomial formula},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/RVOCYBDZ}},
  note         = {Machine review of arXiv:2607.11693}
}
abstract

We study the $(p, q)$-deformed generalized Weyl algebra generated by variables $X, Y$ and $Z_p$ satisfying the $(p, q)$-commutation relations $XY-qYX=h Y^sZ_{p}, XZ_p=pZ_pX$, and $Z_pY=pYZ_p$, with $s\in \mathbb{N}_0$. Within this framework, we investigate the noncommutative binomial formula $(X+Y)^n$ and related identities. In particular, we show how the associated normal ordering coefficients can be expressed in terms of $(p,q)$-deformed $s$-rook numbers. We treat several special cases explicitly, recovering known results from literature as well as deriving new ones.

Figures

Figures reproduced from arXiv: 2607.11693 by the authors.

Figure 1
Figure 1. The Young diagrams in I4. By aligning the columns at the top, we identify the Young diagram Yλ with the Ferrers board denoted by Bλ. A file placement of k rooks (or k-file placement) on a Ferrers board B is a placement of k rooks containing at most one rook in each column. We denote the set of all such placements by FkpBq and its cardinality fkpBq “ |FkpBq| is the k-th file number of B. A k-rook placement is a speci… view at source ↗
Figure 2
Figure 2. The Ferrers board B33211 with a 4-file placement which is not a 4-rook placement. This model of rook and file placements was generalized by the authors in [30], following the approach of Goldman and Haglund [21]. Let i P N0 and let B be a Ferrers board. The i-row creation rule means [PITH_FULL_IMAGE:figures/full_fig_p004_2.png] view at source ↗
Figure 3
Figure 3. The Ferrers board B33211 with a 3-rook placement with 1-row creation rule. Definition 2.3 ([21]). Let i P N0. Given a Ferrers board B, the k-th i-rook number r piq k pBq is the number of ways to place k non-attacking rooks on the board B going from right to left, creating i new rows to the left of each rook. Clearly, for i “ 0 one recovers the conventional rook numbers. For i “ 1 ( [PITH_FULL_IMAGE:figures/full_fig… view at source ↗
Figures from the paper (2 more)
Figure 4
Figure 4. Figure 4: A Ferrers board with a 6-rook placement and marking of the boxes ac￾cording to their class. On the other hand, for the case s ą 0, we recall the pp, qq-weights for s-rook placements introduced in [30], which extend the work of Celeste et al. [14] to p ‰ 1. Let ϕ be a r…
Figure 5
Figure 5. Figure 5: The Ferrers board B88875533311 with a 6-rook placement for s “ 2 (left) and the equivalent representation with boxes marked by their class (right). In general, we have the following result [30]. Theorem 2.8. Let wm,n “ Y nrXmr ¨ ¨ ¨ Y n1Xm1 be a word in the letters X a…

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

59 extracted references · 1 canonical work pages

  1. [1]

    W.H. Abdi. A basic analogue of the Bessel polynomial . Math. Nachr. 30 (1965), 209–219

    1965

  2. [2]

    Barraquand and M

    G. Barraquand and M. Rychnovsky, Random Walk on Nonnegative Integers in Beta Distributed Random Envi- ronment, Commun. Math. Phys. 398 (2023), 823–875

    2023

  3. [3]

    Beauduin, Old and new powerful tools for the normal ordering problem and noncommutative binomials , Enumer

    K. Beauduin, Old and new powerful tools for the normal ordering problem and noncommutative binomials , Enumer. Combin. Appl. 5 (2025), Article S2R4

    2025

  4. [4]

    Benaoum, h analogue of Newton ’s binomial formula , J

    H.B. Benaoum, h analogue of Newton ’s binomial formula , J. Phys. A. 31 (1998), L751–L754

    1998

  5. [5]

    Benaoum, pq, hq-analogue of Newton ’s binomial formula , J

    H.B. Benaoum, pq, hq-analogue of Newton ’s binomial formula , J. Phys. A. 32 (1999), 2037–2040

    1999

  6. [6]

    Benkart, S.A

    G. Benkart, S.A. Lopes and M. Ondrus, A parametric family of subalgebras of the Weyl algebra. II: Irreducible modules, Recent developments in algebraic and combinatorial aspects of representation theory. Contemp. Math. 602, Amer. Math. Soc., Providence, RI (2013), 73–98

    2013

  7. [7]

    Benkart, S.A

    G. Benkart, S.A. Lopes and M. Ondrus, A parametric family of subalgebras of the Weyl algebra. I: Structure and automorphisms, Trans. Am. Math. Soc. 367 (2015), 1993–2021

    2015

  8. [8]

    Benkart, S.A

    G. Benkart, S.A. Lopes and M. Ondrus, Derivations of a parametric family of subalgebras of the Weyl algebra , J. Algebra 424 (2015), 46–97

    2015

Show all 59 references
  1. [9]

    Berry, Diffraction of Light by Ultrasound , Academic Press (1966)

    M.V. Berry, Diffraction of Light by Ultrasound , Academic Press (1966)

    1966

  2. [10]

    Blasiak and P

    P. Blasiak and P. Flajolet, Combinatorial models of creation-annihilation , Sém. Lothar. Combin. 65 (2011), Article B65c

    2011

  3. [11]

    Blumen, Two generalisations of the binomial theorem , Austral

    S.C. Blumen, Two generalisations of the binomial theorem , Austral. Math. Soc. Gaz. 33 (2006), 39–43

    2006

  4. [12]

    Burchnall, A note on the polynomials of Hermite , Q

    J.L. Burchnall, A note on the polynomials of Hermite , Q. J. Math. 12 (1941), 9–11

    1941

  5. [13]

    Burde, On the matrix equation XA ´ AX “ X p, Linear Algebra Appl

    D. Burde, On the matrix equation XA ´ AX “ X p, Linear Algebra Appl. 404 (2005), 147–165

    2005

  6. [14]

    Celeste, R.B

    R.O. Celeste, R.B. Corcino and K.J.M. Gonzales, Two approaches to normal order coefficients , J. Integer Seq. 20 (2017), Art. 17.3.5

    2017

  7. [15]

    Cigler, Some operator identities related to q-Hermite polynomials , arXiv:1006.3210v3 [math.CO]

    J. Cigler, Some operator identities related to q-Hermite polynomials , arXiv:1006.3210v3 [math.CO]

    arXiv

  8. [16]

    d’Ocagne, Sur une classe de nombres remarquables , Amer

    M. d’Ocagne, Sur une classe de nombres remarquables , Amer. J. Math. 9 (1887), 353–380

  9. [17]

    de Médicis and P

    A. de Médicis and P. Leroux, A unified combinatorial approach for q- (and p, q)-Stirling numbers , J. Stat. Plann. Inference 34 (1993), 89–105

    1993

  10. [18]

    Dulucq, Un q-analogue des polynomes de Bessel

    S. Dulucq, Un q-analogue des polynomes de Bessel . Sémin. Lothar. Comb. 28 (1992), Article B28i

    1992

  11. [19]

    Duran, M

    U. Duran, M. Acikgoz, A. Esi and S. Araci, A note on the pp, qq-Hermite polynomials , Appl. Math. Inf. Sci. 12 (2018), 227–231

    2018

  12. [20]

    Gaddis, Two-parameter analogs of the Heisenberg enveloping algebra , Commun

    J. Gaddis, Two-parameter analogs of the Heisenberg enveloping algebra , Commun. Algebra 44 (2016), 4637–4653. NORMAL ORDERING IN THE pp, qq-DEFORMED GENERALIZED WEYL ALGEBRA 35

    2016

  13. [21]

    Goldman and J

    J. Goldman and J. Haglund, Generalized rook polynomials, J. Combin. Theory Ser. A 91 (2000), 509–530

    2000

  14. [22]

    Habib, A

    A. Habib, A. Ouahhabi and E.H. Tahri, Operator-valued generalized Stirling numbers of the first kind from gener- alized boson algebra , Phys. Lett. A 592 (2026), Article 131948

    2026

  15. [23]

    Hegazi and M

    A.S. Hegazi and M. Mansour, Some special functions of noncommuting variables , Int. J. Theor. Phys. 41 (2002), 1815–1825

    2002

  16. [24]

    Ismail, The basic Bessel functions and polynomials , SIAM J

    M.E.H. Ismail, The basic Bessel functions and polynomials , SIAM J. Math. Anal. 12 (1989), 454–468

    1989

  17. [25]

    Jia and Y

    H. Jia and Y. Zhang, Noncommutative binomial theorem, shuffle-type polynomials, and Bell polynomials , J. Alge- braic Combin. 64 (2026), Article 5

    2026

  18. [26]

    Katriel and M

    J. Katriel and M. Kibler, Normal ordering for deformed boson operators and operator-valued deformed Stirling numbers, J. Phys. A: Math. Gen. 25 (1992), 2683–2691

    1992

  19. [27]

    Kirkman and L.W

    E.E. Kirkman and L.W. Small, q-analogs of harmonic oscillators and related rings , Israel J. Math. 81 (1993), 111–127

    1993

  20. [28]

    Manin, Quantum Groups and Noncommutive Geometry , Centre de Recherches Mathématiques, Montréal (1988)

    Y.I. Manin, Quantum Groups and Noncommutive Geometry , Centre de Recherches Mathématiques, Montréal (1988)

    1988

  21. [29]

    Mansour, L

    T. Mansour, L. Oussi and M. Schork, Normal ordering in the pp, qq-deformed generalized Weyl algebra. I: Algebraic Framework and Combinatorial Identities , A vailable at: https://doi.org/10.48550/arXiv.2606.22585

    doi arXiv

  22. [30]

    Mansour, L

    T. Mansour, L. Oussi and M. Schork, Normal ordering in the pp, qq-deformed generalized Weyl algebra. II: Inter- pretation in terms of rook placements , A vailable at: https://doi.org/10.48550/arXiv.2607.01141

    doi arXiv

  23. [31]

    Mansour, M

    T. Mansour, M. Schork, The commutation relation xy “ qyx ` hf pyq and Newton ’s binomial formula , Ramanujan J. 25 (2011), 405–445

    2011

  24. [32]

    Mansour and M

    T. Mansour and M. Schork, The generalized Touchard polynomials revisited , Appl. Math. Comput. 219 (2013), 9978–9991

    2013

  25. [33]

    Mansour, M

    T. Mansour, M. Schork, Commutation relations, normal ordering, and Stirling numbers , CRC Press, Boca Raton, FL (2016)

    2016

  26. [34]

    Mansour and M

    T. Mansour and M. Schork, On a close relative of the quantum plane , Mediterr. J. Math. 15 (2018), Article 124

    2018

  27. [35]

    Mason and D.C

    J.C. Mason and D.C. Handscomb, Chebyshev Polynomials , Chapman and Hall/CRC, 2003

    2003

  28. [36]

    Mikhailov, Ordering of some boson operator functions , J

    V.V. Mikhailov, Ordering of some boson operator functions , J. Phys. A. 16 (1983), 3817–3827

    1983

  29. [37]

    Mikhailov, Normal ordering and generalized Stirling numbers , J

    V.V. Mikhailov, Normal ordering and generalized Stirling numbers , J. Phys. A. 18 (1985), 231–235

    1985

  30. [38]

    Ouahhabi and E.H

    A. Ouahhabi and E.H. Tahri, On generalized normal ordering and generalized Stirling operators , Phys. Lett. A 525 (2024), Article 129917

    2024

  31. [39]

    Oussi, A pp, qq-deformed recurrence for the Bell numbers , J

    L. Oussi, A pp, qq-deformed recurrence for the Bell numbers , J. Integer Seq. 23 (2020), Article 20.5.2

    2020

  32. [40]

    Oussi, pp, qq-analogues of the generalized Touchard polynomials and Stirling numbers , Indag

    L. Oussi, pp, qq-analogues of the generalized Touchard polynomials and Stirling numbers , Indag. Math. 33 (2022), 664–681

    2022

  33. [41]

    Oussi, A note on the pp, qq-derivative operator, Int

    L. Oussi, A note on the pp, qq-derivative operator, Int. J. Appl. Comput. Math. 10 (2024), Article 172

    2024

  34. [42]

    Potter, On the latent roots of quasi-commutative matrices , Amer

    H.S.A. Potter, On the latent roots of quasi-commutative matrices , Amer. Math. Monthly 57 (1950), 321–322

    1950

  35. [43]

    Povolotsky, On the integrability of zero-range chipping models with factorized steady states , J

    A.M. Povolotsky, On the integrability of zero-range chipping models with factorized steady states , J. Phys. A. 46 (2013), Article 465205

    2013

  36. [44]

    Riahi, Wick ordering associated with the pp, qq-Gaussian white noise process , Complex Anal

    A. Riahi, Wick ordering associated with the pp, qq-Gaussian white noise process , Complex Anal. Oper. Theory 13 (2019), 3151–3167

    2019

  37. [45]

    Ricci and I

    P.E. Ricci and I. Tavkhelidze, An introduction to operational techniques and special polynomials , J. Math. Sci. 157 (2009), 161–189

    2009

  38. [46]

    Rosengren, A non-commutative binomial formula , J

    H. Rosengren, A non-commutative binomial formula , J. Geom. Phys. 32 (2000), 349–363

    2000

  39. [47]

    Sack, Taylor’s theorem for shift operators , Philos

    R.A. Sack, Taylor’s theorem for shift operators , Philos. Mag. VIII (1958), 497–503

    1958

  40. [48]

    Njionou Sadjang, On pp, qq-Appell polynomials , Anal

    P. Njionou Sadjang, On pp, qq-Appell polynomials , Anal. Math. 45 (2019), 583–598

    2019

  41. [49]

    Schork, Recent developments in combinatorial aspects of normal ordering , Enumer

    M. Schork, Recent developments in combinatorial aspects of normal ordering , Enumer. Combin. Appl. 1 (2021), Article S2S2

    2021

  42. [50]

    Schork, On Stirling and Bell numbers of order 1{2, Filomat 38 (2024), 609–619

    M. Schork, On Stirling and Bell numbers of order 1{2, Filomat 38 (2024), 609–619

    2024

  43. [51]

    Schützenberger, Une interprétation de certains solutions de l’équation fonctionnelle: F px ` yq “ F pxqF pyq, C

    M.P. Schützenberger, Une interprétation de certains solutions de l’équation fonctionnelle: F px ` yq “ F pxqF pyq, C. R. Acad. Sci. Paris 236 (1953), 352–353

    1953

  44. [52]

    Varvak, Rook numbers and the normal ordering problem , J

    A. Varvak, Rook numbers and the normal ordering problem , J. Combin. Theory Ser. A. 112 (2005), 292–307

    2005

  45. [53]

    Viskov, On the R

    O.V. Viskov, On the R. A. Sack theorem for translation operators , Dokl. Math. 51 (1995), 79–82

    1995

  46. [54]

    Viskov, Expansion in powers of a noncommutative binomial , Proc

    O.V. Viskov, Expansion in powers of a noncommutative binomial , Proc. Steklov Inst. Math. 216 (1996), 63–69

    1996

  47. [55]

    Viskov, An approach to ordering , Dokl

    O.V. Viskov, An approach to ordering , Dokl. Math. 57 (1998), 69–71

    1998

  48. [56]

    Wood, R.A

    A.J. Wood, R.A. Blythe and M.R. Evans, Combinatorial mappings of exclusion processes , J. Phys. A. 53 (2020), Article 123001

    2020

  49. [57]

    Yang and Z

    S. Yang and Z. Qiao, The Bessel numbers and Bessel matrices , J. Math. Res. Expo. 31 (2011), 627–636. 36 T. MANSOUR, L. OUSSI, AND M. SCHORK

    2011

  50. [58]

    Yasmin and A

    G. Yasmin and A. Muhyi, On a family of pp, qq-hybrid polynomials , Kragujevac J. Math. 45 (2021), 407–426

    2021

  51. [59]

    Zhang and J

    Z. Zhang and J. Wang, Some properties of the pq, hq-binomial coefficients , J. Phys. A. 33 (2000), 7653–7658. 1 Department of Mathematics, University of Haifa, 3498838 Haifa, Israel, tmansour@univ.haifa.ac.il 2 F aculty of Pure and Applied Mathematics, Wrocław University of Sci...

    2000

Pith tools

Reviewed July 14, 2026 · model on record in the stance chip above.