arxiv: 2605.08304 · v1 · submitted 2026-05-08 · 🧮 math.GM

Recognition: no theorem link

Combinatorics of higher order degenerate r-deranged bell numbers with singletons

Sithembele Nkonkobe

Authors on Pith no claims yet

Pith reviewed 2026-05-12 00:46 UTC · model grok-4.3

classification 🧮 math.GM

keywords barred preferential arrangementsdegenerate Bell numbersr-deranged numberssingletonscombinatorial identitiesasymptoticsset partitionsBell numbers

0 comments

The pith

Barred preferential arrangements without fixed blocks and with the first r elements as singletons define higher-order degenerate r-deranged Bell numbers, for which identities and asymptotics are derived.

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

The paper introduces higher-order degenerate r-deranged Bell numbers with singletons as a generalization of barred preferential arrangements that excludes fixed blocks and forces the first r elements to be singletons. It derives several combinatorial identities for the resulting counts and supplies asymptotic results describing their growth. A sympathetic reader would care because these objects extend classical counting problems for set partitions and restricted arrangements, providing explicit ways to enumerate and approximate them under the new constraints.

Core claim

We define a new generalization of barred preferential arrangements by considering barred preferential arrangements with no fixed blocks, and ones where the first r elements of a set are singletons. We derive several combinatorial identities. Combinatorially these numbers are a kind of generalized barred preferential arrangements. We also provide some asymptotic results for these numbers.

What carries the argument

Higher-order degenerate r-deranged Bell numbers with singletons, which count barred preferential arrangements that have no fixed blocks and designate the first r elements as singletons.

Load-bearing premise

That the proposed definitions of barred preferential arrangements with no fixed blocks and first-r singletons produce well-defined, consistent combinatorial objects for which the claimed identities and asymptotics can be derived without hidden contradictions or additional constraints.

What would settle it

Direct enumeration of the arrangements for small n and r according to the definition, then checking whether the counts satisfy one of the stated combinatorial identities; a mismatch for any small case would indicate the definitions or derivations contain an error.

read the original abstract

When one inserts a number of identical bars in between blocks of an ordered set partition, they get a barred preferential arrangement. In this study we define a new generalization of barred preferential arrangements, by considering barred preferential arrangements with no fixed blocks, and ones where the first r elements of a set are singletons. We derive several combinatorial identities. Combinatorially these numbers are a kind of generalized barred preferential arrangements. We also provide some asymptotic results for these numbers.

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.

Desk Editor's Note private letter to a colleague

A narrow but formally consistent extension of barred preferential arrangements with explicit recurrences and asymptotics from the EGF.

read the letter

The paper defines a new counting object by taking barred preferential arrangements, forbidding fixed blocks except for the forced initial r singletons, and then works out the associated numbers. What stands out is the direct construction via ordered partitions with bars and the clean derivation of recurrences that match the generating-function equation by bijection. The asymptotic leading terms follow from standard singularity analysis without extra assumptions, which is the part that feels most reproducible. They also list several combinatorial identities that appear to hold by the same counting arguments. That is the solid core: the objects are well-defined for the stated range of r and n, and the claims line up with the setup. The limitation is scope. This is a targeted combination of two existing constraints rather than a broad new framework, and the text does not include numerical tables, sequence lookups, or extended comparisons that would show how much these numbers differ from prior variants. The literature connections are mentioned but not developed at length, so a reader has to do some of that work themselves. Overall the math is internally consistent and the proofs are direct rather than circular. This is for combinatorialists who already track Bell numbers, preferential arrangements, and their barred or deranged variants. Someone in that sub-area could use the identities or the asymptotic formula as a starting point for further enumeration. It is worth sending to peer review because the derivations are explicit and the central claims rest on verifiable bijections and standard analytic combinatorics rather than fitting or hand-waving.

Referee Report

0 major / 3 minor

Summary. The manuscript defines higher order degenerate r-deranged Bell numbers with singletons as a generalization of barred preferential arrangements obtained from ordered set partitions with bars, subject to no fixed blocks (except for the designated singletons) and with the first r elements forced to be singletons. It derives combinatorial identities for these numbers and provides asymptotic results.

Significance. If the derivations hold, the work extends the enumeration of preferential arrangements and Bell numbers by introducing a parameterized family with explicit combinatorial interpretations. The bijections to recurrences via the generating-function equation in §3 and the asymptotic expansions obtained from dominant singularities via standard transfer theorems are strengths, as they yield explicit leading-term coefficients without additional ad-hoc constraints.

minor comments (3)

Abstract: the high-level assertion that identities and asymptotics are derived would be strengthened by including at least one explicit sample identity or the leading asymptotic term.
§3: the generating-function equation and its bijection to the no-fixed-blocks condition with the first-r singleton constraint would benefit from a short explicit verification step or diagram for the base cases.
Asymptotics section: ensure the range of validity for r (relative to n) is stated explicitly before the expansion formulas are given.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the positive summary and recommendation of minor revision. The assessment correctly identifies the combinatorial interpretations via barred preferential arrangements, the generating-function recurrences in §3, and the asymptotic expansions via singularity analysis as the main contributions. No specific major comments appear in the report, so we have no point-by-point rebuttals to offer at this stage. We remain ready to implement any minor clarifications or corrections the editor or referee may request in the next round.

Circularity Check

0 steps flagged

No significant circularity; derivations follow directly from explicit definitions

full rationale

The paper defines the new combinatorial objects (higher-order degenerate r-deranged Bell numbers with singletons) explicitly via ordered set partitions with bars, no fixed blocks, and forced initial-r singletons. Identities are obtained by direct bijection to the stated generating-function recurrences, and asymptotics follow from standard singularity analysis of the EGF. No step reduces a claimed result to a fitted parameter, self-citation chain, or definitional tautology; all outputs are independent consequences of the initial constructions.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 1 invented entities

The paper rests on prior combinatorial definitions of ordered set partitions, Bell numbers, and barred preferential arrangements. No numerical free parameters are mentioned. The new numbers themselves constitute the primary invented entity. Standard set-theoretic and counting axioms are presupposed but not stated explicitly.

axioms (1)

domain assumption Ordered set partitions and the insertion of identical bars between blocks are well-defined combinatorial objects.
Invoked to define the baseline barred preferential arrangements before adding the no-fixed-blocks and singleton constraints.

invented entities (1)

higher order degenerate r-deranged bell numbers with singletons no independent evidence
purpose: To enumerate barred preferential arrangements that contain no fixed blocks and in which the first r elements appear as singletons.
Newly introduced in the paper; no independent external evidence or falsifiable prediction outside the definitions is provided.

pith-pipeline@v0.9.0 · 5362 in / 1357 out tokens · 75662 ms · 2026-05-12T00:46:46.771810+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

32 extracted references · 32 canonical work pages

[1]

A. J. Adell, and S. Nkonkobe ”A Unified Generalization of Touchard polynomial extensions.” Integers 23, #80, 2023

work page 2023
[2]

Adell, B

A.J. Adell, B. B´ enyi,, V. Murali, and S. Nkonkobe. ”Generalized Barred Preferential Arrangements.” Transactions on Combinatorics12, no. 1 (2023)

work page 2023
[3]

”On higher order generalized geometric polynomials with shifted parameters.” Quaestiones Mathematicae 46, no

Adell, Jos´ e A., Be´ ata B´ enyi, and Sithembele Nkonkobe. ”On higher order generalized geometric polynomials with shifted parameters.” Quaestiones Mathematicae 46, no. 3 (2023): 551-567

work page 2023
[4]

Ahlbach, J

C. Ahlbach, J. Usatine, and N. Pippenger, Barred preferential arrangements,Electron. J. Combin. 20(2013), #P55

work page 2013
[5]

”Combinatorial approach of unified Apostol-type polyno- mials usingα-distanced words.” Discrete Applied Mathematics 344 (2024): 23-31

B´ enyi, Be´ ata, and Sithembele Nkonkobe. ”Combinatorial approach of unified Apostol-type polyno- mials usingα-distanced words.” Discrete Applied Mathematics 344 (2024): 23-31

work page 2024
[6]

B´ enyi, B. E.´A. T. A., Sithembele Nkonkobe, and Mark Shattuck. ”Unfair distributions counted by the generalized Stirling numbers.” Integers 22 (2022): A79

work page 2022
[7]

Belbachir, , Y

H. Belbachir, , Y. Djemmada, and L. N´ emeth. ”The deranged Bell numbers.” Mathematica Slovaca 73, no. 4 (2023): 849-860

work page 2023
[8]

On Whitney numbers of Dowling lattices

M. Benoumhani “On Whitney numbers of Dowling lattices.” Discrete Mathematics159, no. 1-3 (1996): 13-33

work page 1996
[9]

Broder, A. Z. (1984). The r-Stirling numbers. Discrete Mathematics, 49(3), 241-259

work page 1984
[10]

Boyadzhiev and A

Kh.N. Boyadzhiev and A. Dil, Geometric polynomials: properties and applications to series with zeta values, Analysis Mathematica42(3) (2016), 203–224

work page 2016
[11]

Catlitz, ”Degenerate stirling, bernoulli and eulerian numbers.” Util

L. Catlitz, ”Degenerate stirling, bernoulli and eulerian numbers.” Util. Math15(1979): 51-88

work page 1979
[12]

L. Comtet. Advanced Combinatorics: The Art of Finite and Infinite Expansions. Springer Science & Business Media, 1974

work page 1974
[13]

Corcino, R.B

C.B. Corcino, R.B. Corcino, B. C ¸ ekim, L. Kargin, and S. Nkonkobe, A second type of higher order generalized geometric polynomials and higher order generalized Euler polynomials,Quaest. Math. 45(2022), 71-89

work page 2022
[14]

”Partial Deranged Bell Numbers and Their Combinatorial Properties.” arXiv preprint arXiv:2507.21643 (2025)

Djemmada, Yahia, Levent Kargın, and M¨ um¨ un Can. ”Partial Deranged Bell Numbers and Their Combinatorial Properties.” arXiv preprint arXiv:2507.21643 (2025)

work page arXiv 2025
[15]

Gould, Henry W., and A. T. Hopper. ”Operational formulas connected with two generalizations of Hermite polynomials.”Duke Math.J29(1962): 51-63

work page 1962
[16]

Preferential arrangements

O.A Gross, “Preferential arrangements.”Am. Math. Mon.69, no. 1 (1962): 4-8

work page 1962
[17]

Generalization of Mellin derivative and its applications

L. Kargın, Levent, and R.B Corcino. “Generalization of Mellin derivative and its applications.” Integral Transforms and Special Functions27, no. 8 (2016): 620-631

work page 2016
[18]

P. R. de Montmort, Essai d’analyse sur les jeux de hasard, 1st ed., Paris, 1708; 2nd ed., Jacques Quillau, Paris, 1713. (See Proposition VII, p. 55). 12 SITHEMBELE NKONKOBE

work page
[19]

L.C. Hsu. and P.J. Shiue, A unified approach to generalized Stirling numbers,Adv. Appl. Math.20 (1998), 366-384

work page 1998
[20]

Corcino, L.C

R.B. Corcino, L.C. Hsu, and E.L. Tan, Combinatorial and statistical applications of generalized Stirling numbers,J. Math. Res. Exp.-Chinese Edition21(2001), 337-343

work page 2001
[21]

Hsu, Power-type generating functions, Colloquia Mathematica Societatis Janos Bolyai, Ap- proximation Theory, Kesckemet, Hungary58(1990), 405-412

L.C. Hsu, Power-type generating functions, Colloquia Mathematica Societatis Janos Bolyai, Ap- proximation Theory, Kesckemet, Hungary58(1990), 405-412

work page 1990
[22]

Hsu and W

L.C. Hsu and W. Chu, A kind of asymptotic expansion using partitions,Tohoku Math. J.43(1991), 235-242

work page 1991
[23]

Knuth, O

R.L.Graham, D.E. Knuth, O. Patashnik, and S. Liu. ”Concrete mathematics: a foundation for computer science.” Computers in Physics3, no. 5 (1989): 106-107

work page 1989
[24]

Kargin and B

L. Kargin and B. C ¸ ekim, Higher order generalized geometric polynomials,Turkish J. Math.42 (2018), 887-903

work page 2018
[25]

L.Kargın and M.Cenkci, Recurrences and congruences for higher order geometric polynomials and related numbers, preprint,arXiv:1910.13248

work page arXiv 1910
[26]

Nkonkobe, B

S. Nkonkobe, B. B´ enyi, R.B. Corcino, and C.B. Corcino, A combinatorial analysis of higher order generalised geometric polynomials: A generalisation of barred preferential arrangements,Discrete Math.343(2020), Article 111729

work page 2020
[27]

A study of a family of generating functions of Nelsen–Schmidt type and some identities on restricted barred preferential arrangements

S.Nkonkobe, and V.Murali, 2017. A study of a family of generating functions of Nelsen–Schmidt type and some identities on restricted barred preferential arrangements. Discrete Mathematics,340(5), pp.1122-1128

work page 2017
[28]

Mag.83(2010), 331-346

N.Pippenger, The hypercube of resistors, asymptotic expansions, and preferential arrangements, Math. Mag.83(2010), 331-346

work page 2010
[29]

”Moment recurrence relations for binomial, Poisson and hypergeometric frequency distributions.” The Annals of Mathematical Statistics8, no

Riordan, John. ”Moment recurrence relations for binomial, Poisson and hypergeometric frequency distributions.” The Annals of Mathematical Statistics8, no. 2 (1937): 103-111

work page 1937
[30]

On degenerate gener- alized Fubini polynomials

Kim, Taekyun, Dae San Kim, Hyunseok Lee, Jonkyum Kwon, and J. Kwon. “On degenerate gener- alized Fubini polynomials.” AIMS Mathematics 7, no. 7 (2022): 12227-12240

work page 2022
[31]

The r-derangement numbers

C.Wang, P.Miska, and I.Mez˝ o, 2017. The r-derangement numbers. Discrete mathematics,340(7), pp.1681-1692

work page 2017
[32]

Wilf, Generatingfunctionology

H.S. Wilf, Generatingfunctionology. CRC press, 2005. School of Mathematics, University of Witwatersrand, 2050 Wits, Johannesburg, South Africa Email address:snkonkobe@gmail.com

work page 2005