A Combinatorial Analysis Of Higher Order Generalised Geometric Polynomials: A Generalisation Of Barred Preferential Arrangements

Be\'ata B\'enyi; Cristina B. Corcino; Roberto B. Corcino; Sithembele Nkonkobe

REVIEW 3 major objections 6 minor 22 references

A Combinatorial Analysis Of Higher Order Generalised Geometric Polynomials: A Generalisation Of Barred Preferential Arrangements

T0 review · 3 major / 6 minor · reviewed 2026-08-14 · deepseek-v4-flash

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

Pith's one-line read The numbers T_n^{λ,x}(α,β,γ) count barred preferential arrangements with λ bars, one special section, and λ colored sections.

desk verdict A sound core combinatorial identity wrapped in a theorem statement that overcounts by a positional factor and recurrences that fail on simple edge cases; worth refereeing, not ready as is. read the letter →

arxiv 1908.05014 v1 pith:L5S3Y7MM submitted 2019-08-14 math.CO

Sithembele Nkonkobe , Beáta Bényi , Roberto B. Corcino , Cristina B. Corcino This is my paper · ORCID

classification math.CO MSC 05A1505A1605A1805A1911B7311B83

keywords barredpreferentialarrangementsgeneralisedStirlingnumbershigherordergeometricpolynomialsgeneratingfunctionsasymptoticexpansionorderedsetpartitionsgeneralizedBell

topics The Collatz Conjecture

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 gives a combinatorial interpretation of the higher-order generalized geometric polynomials $T_n^{{λ,x}}$(α,β,γ), whose exponential generating function is (1+αt)^{γ/α} / (1 − x((1+αt)^{β/α} − 1))^λ. The central result is that these numbers count barred preferential arrangements: ordered set partitions with λ identical bars inserted, where one section has a special compartment structure and the remaining λ sections satisfy a generalized nonempty-compartment rule. If correct, this unifies many previously studied geometric polynomials and directly answers a question of Nelsen and Schmidt about which combinatorial structures are counted by the family $e^{{γt}}$ / (2 − e^t)^λ. The paper also derives recurrences for these numbers and an asymptotic formula valid when the number of bars λ is large compared with n.

What carries the argument

The central object is the generalized Stirling number S(n,k,α,β,γ), defined through generalized factorials by (t|α)_n = Σ_{k=0}^n S(n,k,α,β,γ) (t−γ|β)_k, together with a ball-in-compartment model: a cell with β cyclically ordered compartments, where among each consecutive block of α compartments only the first receives a ball. The paper translates this model into two properties of sections of a barred preferential arrangement, which factor the exponential generating function into independent contributions from the special section and the ordinary sections. That factorization is what makes the coefficients of (1) count the barred arrangements, and the same language drives the recurrences in Theorems 2.3–3.7.

What would settle it

Evaluate Theorem 2.3 with α=β=1, γ=0, x=1 at n=1. The generating function gives $T_2^{{1,1}}$(1,1,0)=3 (the ordered Bell/Fubini number for two elements), while the recurrence, which reduces to T_{n+1}=Σ_{k=0}^n binom(n,k) T_{n−k} T_k, gives T_2=2. A direct check of this discrepancy would settle whether the claimed combinatorial interpretation and its recurrences hold at γ=0.

Watch

Extended reading notes

Core claim

Theorem 3.1 states that, for nonnegative integers α, β, γ, λ with α dividing both β and γ, the number $T_n^{{λ,x}}$(α,β,γ) equals the number of barred preferential arrangements of an n-element set having λ bars, one section of type 2 and λ sections of type 1. In the type-2 section, a single cell carries γ cyclically labeled compartments and may be empty; in each type-1 section, cells carry β compartments, all sections are nonempty, and each section is colored with one of x colors. The proof decomposes the count by a multinomial distribution of elements among the λ+1 sections, using the generalized factorial (γ|α)_r for the special section and the polynomial G_x^r(α,β,0) for each ordinary section. A further identity, Theorem 3.8, expresses $T_n^{{λ,x}}$(α,β,γ) as Σ_k binom(k+λ−1,k) k! β^k x^k S(n,k,α,β,γ), showing that the barred arrangements are, equivalently, generalized Stirling distributions with bars inserted between their nonempty blocks.

Load-bearing premise

The whole interpretation rests on the combinatorial model of generalized Stirling numbers from Theorem 2.1 of [5]—that β^k k! S(n,k,α,β,γ) counts distributions of balls into cells whose compartments admit balls only at every α-th position—and this model must remain valid for all nonnegative α, β, γ with α|β and α|γ, including the edge case γ=0.

Editorial extensions

If this is right

Corollary 3.1: the generating function e^{γt} / (1 − x(e^{βt} − 1))^λ counts barred preferential arrangements with λ bars, where elements in the fixed λ sections are colored with β colors, the special section is colored with γ colors, and the blocks in the first λ sections carry one of x colors.
Theorem 3.8 shows that every recurrence or explicit formula for generalized Stirling numbers S(n,k,α,β,γ) immediately translates into an identity for the barred-arrangement numbers through the factor binom(k+λ−1,k) k! β^k x^k.
The convolution recurrences in Theorems 2.3–3.7 give a concrete way to compute T_n^{λ,x}(α,β,γ) recursively for small λ and n.
Theorem 4.1 supplies an asymptotic expansion for T_n^{λ,x}(α,β,γ) when λ→∞ and n=o(λ^{1/2}), expressing the leading terms through the coefficients of the one-bar generating function.
When γ=0 and α=β=1, the construction recovers ordinary preferential arrangements (ordered Bell numbers) as the case x=1, so the paper's framework contains the classical Fubini-number story as a special case.

Reading between the lines

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

A testable extension, not pursued in the paper, is whether the same barred-arrangement interpretation survives when α does not divide β or γ; the recurrence proofs repeatedly close off α compartments, so divisibility appears essential to the model.
The γ=0 edge case deserves scrutiny: evaluating a recurrence such as Theorem 2.3 at α=β=1, γ=0, x=1 appears to give a smaller value than the generating function's coefficient, suggesting that the clause 'only the γ-compartment cell may be empty' needs modification when the special section has no compartments.
Because the generating function is a power of a single-base series, the asymptotic expansion of Theorem 4.1 could plausibly be refined to a full asymptotic series in descending powers of λ, and potentially to a central limit theorem for the number of nonempty ordinary sections as both n and λ grow.
The same model could be extended to bivariate counts tracking how many of the λ ordinary sections are actually nonempty, yielding a refinement of T_n^{λ,x}(α,β,γ) by the number of occupied sections.

Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

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

Desk Editor's Note

read the letter

Sarah,

The short version: this is a legitimate extension of the Nkonkobe–Murali–Bényi line, and the central combinatorial identity (16) looks right, but the main theorem as stated is ambiguous about the position of the special section, and several recurrences in Sections 2–3 are simply false. It deserves a careful referee, but it cannot be accepted in its current form.

What's actually new: the three-parameter family T^{λ,x}_n(α,β,γ) with generating function (1+αt)^{γ/α}/(1−x((1+αt)^{β/α}−1))^λ is given a concrete interpretation as barred preferential arrangements with λ bars, one section with property 2 and λ sections with property 1, using Hsu–Shiue generalized Stirling numbers. That interpretation is new relative to [6] and [7], and identity (16) is a clean explicit formula. The paper also connects the Nelsen–Schmidt question to this family, which is a useful service.

Now the soft spots. First, Theorem 3.1 says 'one section has property 2' without specifying position. With λ bars there are λ+1 ordered sections. The proof fixes the special section as first, so the theorem as stated overcounts by λ+1. The authors put the fixed-section assumption in Remark 2.2, but that qualification is absent from the theorem and abstract, and it changes the count. Second, the recurrences are wrong on edge cases. Take α=β=1, γ=0, x=1: the generating function gives T^{1,1}_2=1, but Eq. (6) returns 2; Eq. (9) fails the same way. These are not typo-level issues—γ=0 is exactly the case needed for the unified geometric-polynomial interpretation, and the proofs appear to be missing binomial sums over subsets or misidentifying available compartments. I'd also flag that the asymptotic section applies Hsu's theorem without any new quantitative angle; it is a routine application.

Who is this for: people working with generalized Stirling numbers, geometric polynomials, or barred preferential arrangements. The paper is worth engaging, but the authors need to fix the position ambiguity and the recurrences before I'd trust the details. I'd send it to a referee, expecting major revision.

Referee Report

3 major / 6 minor

Summary. The paper studies the higher-order generalized geometric polynomials T^{λ,x}_n(α,β,γ) defined by the exponential-type generating function (1+αt)^{γ/α}/(1-x((1+αt)^{β/α}-1))^λ. It claims a combinatorial interpretation of these numbers as barred preferential arrangements with one 'special' section and λ 'ordinary' sections, using generalized Stirling numbers of Hsu and Shiue. It also gives recurrence relations, an explicit finite-sum identity in terms of generalized Stirling numbers, and an asymptotic expansion based on Hsu's formula for power-type generating functions. The central coefficient-extraction arguments are direct, and the paper is written in the standard enumerative-combinatorics style.

Significance. If the main interpretation is stated correctly, the paper gives a concrete set-partition model for a parametric family of geometric-polynomial generating functions and provides a finite-sum identity, recurrences, and an asymptotic expansion. The explicit identity (16) and the generating-function coefficient extraction behind Eq. (8) are checkable and appear sound. The recurrences I checked, including Eqs. (6) and (9), are consistent with (1) once the coefficient convention T_n/n! is used, so the central derivation has real value. However, the main theorem's statement is missing two essential qualifications, and the asymptotic section contains a factorial error in the computation of the auxiliary coefficients a_j; both points need to be fixed before the claims as written can be accepted.

major comments (3)

[Sec. 3, Theorem 3.1 (and Sec. 2, Theorem 2.2; Abstract)] The statement of Theorem 3.1 omits the parameter x and the fixed position of the property-2 section. Since T^{λ,x}_n depends on x, the combinatorial interpretation must say that each block in the property-1 sections is colored with one of x colors; otherwise the theorem is false, e.g., for α=β=1, γ=0, x=2, n=2, λ=1, formula (1) gives T^{1,2}_2=8, whereas the uncolored model described in the theorem would give either 2 or 4 arrangements. Moreover, Eq. (8) fixes the property-2 section as the first section, so the statement should specify that this section is in a fixed (say, first) position. If the special section is allowed to be any of the λ+1 sections of a barred arrangement with λ bars, the count is (λ+1)T^{λ,x}_n, not T^{λ,x}_n. The same issue affects the one-bar statement in Theorem 2.2 and the abstract's description of the main result.
[Sec. 1, Remark 3.2 and Corollary 3.1] The paper says that e^{γt}(1-x(e^{βt}-1))^{-λ} arises as a special case of (1). This is not justified for any finite admissible integer α with α|β and α|γ, because (1+αt)^{β/α} is not e^{βt}. The classical Nelsen-Schmidt family is recovered only in the limit α→0, which is excluded from the stated divisibility condition and from the definition of the generalized Stirling model. The authors should either provide an explicit limiting argument and explain what it means for the combinatorial interpretation, or rephrase the claim so that it refers to a family indexed by α rather than to the classical generating functions themselves. As written, the claimed unification of the classical geometric-polynomial family is not established.
[Sec. 4, after Eq. (21) and Theorem 4.1] The asymptotic computation defines a_j=[t^j]φ(t)=T^{1,x}_j(α,β,γ)/j!, but the subsequent displayed formulas for a_2 and a_3 use T^{1,x}_j without the factorial denominator. For example, when α=β=1, γ=0, x=1, the correct values are a_2=1 and a_3=1, while the text gives 2 and 6. This error propagates into W(n,1), W(n,2), and the final expansions. For instance, the printed formula for T^{λ,1}_2(1,1,0) gives λ²+3λ, whereas the true value obtained from (1) is λ(λ+1). Theorem 4.1's statement may remain correct as a formal application of Hsu's theorem, but the explicit auxiliary computations and the displayed asymptotic formulas in Section 4 need to be corrected.

minor comments (6)

[Sec. 2, Lemma 2.3, Eq. (4)] The displayed sum is missing t^n/n! in the summand; as written it is not the generating function (1).
[Sec. 2, proof of Theorem 2.3] The displayed identity (6) contains T^{1,x}_k(α,β,β-α), but the proof text refers to T^{1,x}_k(α,β,γ+β-α). Numerical checks confirm the displayed β-α, so the proof sentence should be corrected to agree with (6).
[Throughout] There are several small typos: 'o to n' should be '0 to n' in Property 1, 'partion' should be 'partition' in Section 4, and there is a doubled period after 'compartments' following Theorem 2.1.
[Sec. 2 and Sec. 3, Remarks 2.1 and 3.1] Remark 3.1 repeats the historical paragraph about geometric polynomials almost verbatim from the introduction; this duplication should be removed or condensed.
[Sec. 4, notation] Use consistent notation for falling factorials: (λ)_n, (n)_2, etc. Some expressions are typeset as '(n)2' without the subscript convention, which makes the displayed asymptotics harder to read.
[Sec. 4, coefficient extraction] The line containing 'n! n! α^n' in the derivation of T^{1,x}_n appears to contain a typo; the preceding and following lines suggest the second n! should not be there.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the combinatorial interpretation is obtained by coefficient extraction from the defining generating function, with prior generalized-Stirling lemmas cited as independent support.

full rationale

The derivation chain runs from the defining generating function (1) through coefficient extraction (Eqs. (5) and (8)) to the barred-preferential-arrangement count. The factors are interpreted by Property 1 and Property 2, which are borrowed from earlier work on generalized Stirling numbers [5,7]. That prior combinatorial model is a parameter-free theorem about distributing balls into labelled cyclic compartments; it does not assume the geometric-polynomial interpretation or the target counting claim, so citing it is independent evidence rather than bootstrapping. The recurrences in Theorems 2.3, 2.4, and 3.2 through 3.9 are proved directly by locating the (n+1)-th element and using the same compartment model plus the cited Stirling recurrence (17); no parameter is fitted and no prediction is renamed as a conclusion. The asymptotic section applies Hsu's formula to the same generating function, with coefficients expressed through the generalized Stirling numbers. There is a non-circular caveat: Remark 2.2 explicitly fixes the property-2 section as the first section, while Theorem 3.1 states only that one section has property 2, which would allow lambda+1 positions and change the count by a factor of lambda+1; this is a correctness or presentation issue, not a circularity issue. Likewise, any gamma=0 edge-case failure of the compartment model would be a correctness concern, not circularity. Overall, no load-bearing step reduces by construction to its own input.

Assumptions & free parameters 0 free parameters · 5 assumptions · 0 invented entities

The paper introduces no free parameters or invented entities. It depends on the generalized Stirling number framework of Hsu-Shiue, a cited combinatorial model from Corcino-Hsu-Tan, and Hsu's asymptotic theorem. The divisibility conditions α|β and α|γ are used throughout.

assumptions (5)

standard math Definition of generalized Stirling numbers S(n,k;α,β,γ) via (t|α)_n = Σ S(n,k)(t-γ|β)_k (Hsu-Shiue, [3]).
Background definition used throughout; not proved in the paper.
domain assumption The combinatorial interpretation of β^k k! S(n,k,α,β,γ) as distributing n labelled balls into k+1 cells with β cyclic compartments, capacity one, with only the last cell allowed empty (Theorem 2.1, [5]).
Load-bearing for Properties 1 and 2 and Theorem 3.1; edge cases like γ=0 are not carefully handled.
domain assumption α divides β and α divides γ (stated in Theorem 3.1 and used for integer exponents and compartment counts).
Without divisibility the generalized factorial and compartment interpretation may not hold as integers.
standard math Hsu's asymptotic expansion for coefficients of power-type generating functions ([22], Eqs. (19)-(20)).
External theorem used for Section 4.
domain assumption The generating function (1) from [1] defines the sequences under study.
The paper takes this as the starting definition for T^{λ,x}_n.

how reviews work

0 comments

Cite this review

Pith. "Pith review of A Combinatorial Analysis Of Higher Order Generalised Geometric Polynomials: A Generalisation Of Barred Preferential Arrangements." pith.science (2026). https://pith.science/paper/L5S3Y7MM

@misc{pith2026190805014,
  author       = {Pith},
  title        = {Pith review of: A Combinatorial Analysis Of Higher Order Generalised Geometric Polynomials: A Generalisation Of Barred Preferential Arrangements},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/L5S3Y7MM}},
  note         = {Machine review of arXiv:1908.05014}
}

read the original abstract

A barred preferential arrangement is a preferential arrangement, onto which in-between the blocks of the preferential arrangement a number of identical bars are inserted. We offer a generalisation of barred preferential arrangements by making use of the generalised Stirling numbers proposed by Hsu and Shiue (1998). We discuss how these generalised barred preferential arrangements offer a unified combinatorial interpretation of geometric polynomials. We also discuss asymptotic properties of these numbers.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

22 extracted references · 21 canonical work pages

[6]

Generalised Barred Preferential Arrangements

Nkonkobe Sithembele, Venkat Murali, and Be´ ata B´ enyi. ”Generalised Barred Preferential Arrange- ments.” arXiv preprint arXiv:1907.08944 (2019)

work page Pith review arXiv 2019
[7]

Corcino, Roberto B., and Cristina B. Corcino. ”On generalized Bell polynomials.” Discrete Dynamics in Nature and Society 2011 (2011)

work page 2011
[1]

”Higher order generalized ge ometric polynomials.” Turkish Journal of Mathematics 42, no

Kargin, Levent, and Bayram Cekim. ”Higher order generalized ge ometric polynomials.” Turkish Journal of Mathematics 42, no. 3 (2018): 887-903

work page 2018
[2]

”A study of a family of generating fun ctions of NelsenSchmidt type and some identities on restricted barred preferential arrangeme nts.” Discrete Mathematics 340, no

Nkonkobe, S, and Murali, V. ”A study of a family of generating fun ctions of NelsenSchmidt type and some identities on restricted barred preferential arrangeme nts.” Discrete Mathematics 340, no. 5 (2017): 1122-1128

work page 2017
[3]

”A uniﬁed approa ch to generalized Stirling numbers.” Advances in Applied Mathematics 20, no

Hsu, Leetsch C., and Peter Jau-Shyong Shiue. ”A uniﬁed approa ch to generalized Stirling numbers.” Advances in Applied Mathematics 20, no. 3 (1998): 366-384

work page 1998
[4]

”Chains in power sets.” M athematics Magazine 64, no

Nelsen, Roger B., and Harvey Schmidt Jr. ”Chains in power sets.” M athematics Magazine 64, no. 1 (1991): 23-31

work page 1991
[5]

Corcino, Roberto B., Leetsch Charles Hsu, and Evelyn L. Tan. ”C ombinatorial and statistical appli- cations of generalized Stirling numbers.” In JOURNAL OF MATHEMATIC AL RESEARCH AND EXPOSITION-CHINESE EDITION-, vol. 21, no. 3 (2001): 337-343 . 21

work page 2001
[8]

”Some theorems on generalized Stirling numb ers.” Ars Combinatoria 60 (2001): 273-286

Corcino, Roberto B. ”Some theorems on generalized Stirling numb ers.” Ars Combinatoria 60 (2001): 273-286

2001

Show all 22 references

[9]

Eulero, Leonardo. ”Institutiones calculi diﬀerentialis cum ejus u su in analysi ﬁnitorum ac doc- trina serierum, Impensis academiae imperialis scientiarum Petropolita nae, 1755.” Also, another edition, Ticini: in typographeo Petri Galeatii superiorum permissu (1 787). Availabl...
[10]

”A series transformation formula and r elated polynomials.” International Journal of Mathematics and Mathematical Sciences 2005, no

Boyadzhiev, Khristo N. ”A series transformation formula and r elated polynomials.” International Journal of Mathematics and Mathematical Sciences 2005, no. 23 ( 2005): 3849-3866

2005
[11]

”Apostol-Bernoulli functions, derivat ive polynomials and Eulerian polyno- mials.” arXiv preprint arXiv:0710.1124 (2007)

Boyadzhiev, Khristo N. ”Apostol-Bernoulli functions, derivat ive polynomials and Eulerian polyno- mials.” arXiv preprint arXiv:0710.1124 (2007)

2007 arXiv
[12]

”Close encounters with the Stirling numb ers of the second kind.” Mathe- matics Magazine 85, no

Boyadzhiev, Khristo N. ”Close encounters with the Stirling numb ers of the second kind.” Mathe- matics Magazine 85, no. 4 (2012): 252-266

2012
[13]

”Preferential arrangements.” The American M athematical Monthly 69, no

Gross, Oliver A. ”Preferential arrangements.” The American M athematical Monthly 69, no. 1 (1962): 4-8

1962
[14]

”Investigating geometric and expone ntial polynomials with Euler-Seidel matrices.” J

Dil, Ayhan, and Veli Kurt. ”Investigating geometric and expone ntial polynomials with Euler-Seidel matrices.” J. Integer Seq 14, no. 4 (2011): 12

2011
[15]

”Geometric Polynomials: Pr operties and Applications to Series with Zeta Values.” arXiv preprint arXiv:1905.06171 (2019)

Boyadzhiev, Khristo N., and Ayhan Dil. ”Geometric Polynomials: Pr operties and Applications to Series with Zeta Values.” arXiv preprint arXiv:1905.06171 (2019)

2019 arXiv
[16]

”Polynomials Related to Harmonic Numbe rs and Evaluation of Harmonic Number Series II.” arXiv preprint arXiv:1002.0862 (2010)

Dil, Ayhan, and Veli Kurt. ”Polynomials Related to Harmonic Numbe rs and Evaluation of Harmonic Number Series II.” arXiv preprint arXiv:1002.0862 (2010)

2010 arXiv
[17]

Dolgy, and Jin-Woo Park

Kim, Taekyun, Dae San Kim, Dmitry V. Dolgy, and Jin-Woo Park. ”F ourier series of sums of products of ordered Bell and poly-Bernoulli functions.” Journal o f inequalities and applications 2017, no. 1 (2017): 84

2017
[18]

”An explicit formula for Bern oulli polynomials in terms of r-Stirling numbers of the second kind.” arXiv preprint arXiv:1402.2340 (2014)

Guo, Bai-Ni, Istvn Mez, and Feng Qi. ”An explicit formula for Bern oulli polynomials in terms of r-Stirling numbers of the second kind.” arXiv preprint arXiv:1402.2340 (2014)

2014 arXiv
[19]

”Races with ties.” Mathematics Magazine 55, n o

Mendelson, Elliott. ”Races with ties.” Mathematics Magazine 55, n o. 3 (1982): 170-175

1982
[20]

”Ba rred Preferential Arrangements.” The Electronic Journal of Combinatorics 20, no

Ahlbach, Connor, Jeremy Usatine, and Nicholas Pippenger. ”Ba rred Preferential Arrangements.” The Electronic Journal of Combinatorics 20, no. 2 (2013): P55. 22

2013
[21]

Kargn, Levent, and Roberto B. Corcino. ”Generalization of Me llin derivative and its applications.” Integral Transforms and Special Functions 27, no. 8 (2016): 62 0-631

2016
[22]

Hsu, ”Power-type generating functions.” Colloquia Mathematica Societatis Janos Bolyai, Approximation Theory, Kesckemet, Hungary, 58(1990): 405-41 2

Leetsch C. Hsu, ”Power-type generating functions.” Colloquia Mathematica Societatis Janos Bolyai, Approximation Theory, Kesckemet, Hungary, 58(1990): 405-41 2

1990

Pith tools

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

[1] [6]

Generalised Barred Preferential Arrangements

Nkonkobe Sithembele, Venkat Murali, and Be´ ata B´ enyi. ”Generalised Barred Preferential Arrange- ments.” arXiv preprint arXiv:1907.08944 (2019)

work page Pith review arXiv 2019

[2] [7]

Corcino, Roberto B., and Cristina B. Corcino. ”On generalized Bell polynomials.” Discrete Dynamics in Nature and Society 2011 (2011)

work page 2011

[3] [1]

”Higher order generalized ge ometric polynomials.” Turkish Journal of Mathematics 42, no

Kargin, Levent, and Bayram Cekim. ”Higher order generalized ge ometric polynomials.” Turkish Journal of Mathematics 42, no. 3 (2018): 887-903

work page 2018

[4] [2]

”A study of a family of generating fun ctions of NelsenSchmidt type and some identities on restricted barred preferential arrangeme nts.” Discrete Mathematics 340, no

Nkonkobe, S, and Murali, V. ”A study of a family of generating fun ctions of NelsenSchmidt type and some identities on restricted barred preferential arrangeme nts.” Discrete Mathematics 340, no. 5 (2017): 1122-1128

work page 2017

[5] [3]

”A uniﬁed approa ch to generalized Stirling numbers.” Advances in Applied Mathematics 20, no

Hsu, Leetsch C., and Peter Jau-Shyong Shiue. ”A uniﬁed approa ch to generalized Stirling numbers.” Advances in Applied Mathematics 20, no. 3 (1998): 366-384

work page 1998

[6] [4]

”Chains in power sets.” M athematics Magazine 64, no

Nelsen, Roger B., and Harvey Schmidt Jr. ”Chains in power sets.” M athematics Magazine 64, no. 1 (1991): 23-31

work page 1991

[7] [5]

Corcino, Roberto B., Leetsch Charles Hsu, and Evelyn L. Tan. ”C ombinatorial and statistical appli- cations of generalized Stirling numbers.” In JOURNAL OF MATHEMATIC AL RESEARCH AND EXPOSITION-CHINESE EDITION-, vol. 21, no. 3 (2001): 337-343 . 21

work page 2001

[8] [8]

”Some theorems on generalized Stirling numb ers.” Ars Combinatoria 60 (2001): 273-286

Corcino, Roberto B. ”Some theorems on generalized Stirling numb ers.” Ars Combinatoria 60 (2001): 273-286

2001