Generalised Barred Preferential Arrangements

B\'eata B\'enyi; Sithembele Nkonkobe; Venkat Murali

arxiv: 1907.08944 · v1 · pith:4D3A7NL4new · submitted 2019-07-21 · 🧮 math.CO

Generalised Barred Preferential Arrangements

Sithembele Nkonkobe , Venkat Murali , B\'eata B\'enyi This is my paper

Pith reviewed 2026-05-24 18:50 UTC · model grok-4.3

classification 🧮 math.CO

keywords barred preferential arrangementscolored elementspreferential arrangementscombinatorial enumerationset partitionsbars between blocks

0 comments

The pith

Barred preferential arrangements extend directly when their elements receive colors from a fixed palette.

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

The paper defines a colored barred preferential arrangement by first coloring the elements of an ordinary preferential arrangement and then inserting identical bars between its blocks exactly as before. It proceeds to examine the resulting combinatorial properties under this extension. A sympathetic reader would care because the same bar-insertion rule now operates on a larger family of objects, potentially producing new counting sequences or recurrences that link to existing colored partition problems. The construction is presented as a straightforward substitution of colored elements into the classical definition.

Core claim

A barred preferential arrangement whose elements are colored with a given number of colors is obtained by coloring the elements first and then placing identical bars between the blocks of the resulting preferential arrangement; the combinatorial properties of these objects follow from applying the ordinary barred construction to the colored setting.

What carries the argument

The colored barred preferential arrangement, formed by assigning colors to elements before inserting bars between blocks of the preferential arrangement.

If this is right

Enumeration formulas for the colored objects can be derived by the same combinatorial arguments used in the uncolored case.
Recurrence relations satisfied by the uncolored counts continue to hold after the elements are colored.
The objects remain in bijection with certain colored set partitions equipped with distinguished separators.
Generating functions can be written by substituting a color variable into the ordinary exponential generating function.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

The same construction may apply to other barred combinatorial structures such as barred permutations or ordered trees.
Explicit small-case tables could reveal whether the colored counts satisfy known identities involving Stirling numbers of the second kind.
The model suggests a natural next step of allowing bars to carry colors as well.

Load-bearing premise

The standard definition of a barred preferential arrangement extends directly to the colored setting without requiring new constraints or adjustments to the bar-insertion process.

What would settle it

A concrete count of colored barred preferential arrangements for small n and k colors that cannot be obtained by applying the uncolored counting method after coloring the elements would show the direct extension fails.

read the original abstract

A barred preferential arrangement is a preferential arrangement onto which a number of identical bars are inserted in between the blocks of the preferential arrangement. In this study we examine combinatorial properties of barred preferential arrangements whose elements are colored with a number of available colors.

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

The paper defines colored barred preferential arrangements and works out their enumeration, but the step from the uncolored case looks direct.

read the letter

The core move is to color the elements of a barred preferential arrangement with a fixed number of colors and then count or describe the resulting objects. That is the new piece: the colored variant is introduced and its basic properties are examined. The authors appear to carry over the usual block-and-bar structure and simply track the color assignments on the underlying set. If they supply explicit generating functions or recurrence relations that match small cases, that counts as solid, reproducible work in the enumerative style. The definitions are standard and the extension does not seem to require new constraints on bar placement, so the mechanics stay familiar. The main limitation is that the generalization is mechanical once the objects are defined; the counting often reduces to multiplying the uncolored count by k to the power of the number of elements or inserting color variables into an existing exponential generating function. Unless the paper uncovers a non-obvious interaction between colors and bars, the results stay incremental. No load-bearing circularity or invented entities show up in the abstract or stress-test description. The paper is aimed at people already working on preferential arrangements, ordered partitions, or barred variants; a reader outside that niche will not gain new techniques. It is coherent on its own terms and the combinatorial task is well-posed, so it clears the bar for a serious referee even if the novelty is modest. I would send it to review rather than desk-reject.

Referee Report

0 major / 2 minor

Summary. The manuscript defines barred preferential arrangements in which the ground-set elements receive colors from a finite palette and studies combinatorial properties of the resulting objects, including their enumeration and structural features obtained by extending the standard bar-insertion process to the colored setting.

Significance. The direct extension of the barred preferential arrangement definition to colored elements is a natural and parameter-free generalization that preserves the ordered-partition structure. If the derived enumerative formulas or generating functions are correct, the work supplies a colored analogue that may connect to existing literature on colored set partitions and ordered partitions, providing a modest but concrete addition to the enumeration of Fubini-type objects.

minor comments (2)

The abstract states only that combinatorial properties are examined; the introduction or a dedicated results section should explicitly list the principal theorems or closed-form expressions obtained.
Notation for the colored objects (e.g., whether color assignments are functions from the ground set or part of the block data) should be fixed at the first appearance and used consistently thereafter.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their careful reading of the manuscript and for the positive assessment of the combinatorial extension to colored barred preferential arrangements. The recommendation of minor revision is noted. No specific major comments were provided in the report, so the point-by-point section below is empty.

Circularity Check

0 steps flagged

No significant circularity detected

full rationale

The paper defines barred preferential arrangements with colored elements as a direct extension of the standard definition (coloring ground-set elements without changing block structure or bar insertion) and states that it examines their combinatorial properties. No equations, generating functions, or derivations are supplied in the available text that reduce any claimed result to a fitted parameter, self-citation, or input by construction. The central task is routine enumeration once the objects are defined, rendering the derivation self-contained against external benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Only the abstract is available; no free parameters, axioms, or invented entities can be identified from the given text.

pith-pipeline@v0.9.0 · 5555 in / 804 out tokens · 18398 ms · 2026-05-24T18:50:24.839799+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

16 extracted references · 16 canonical work pages

[1]

Analytic combinatorics

Flajolet, Philippe, and Robert Sedgewick. Analytic combinatorics. cambridge University press, 2009

work page 2009
[2]

”Bar red Preferen- tial Arrangements.” The Electronic Journal of Combinatorics 20, n o

Ahlbach, Connor, Jeremy Usatine, and Nicholas Pippenger. ”Bar red Preferen- tial Arrangements.” The Electronic Journal of Combinatorics 20, n o. 2 (2013): P55

work page 2013
[3]

”A study of a family of generating fun ctions of NelsenSchmidt type and some identities on restricted barred pre ferential arrangements.” 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 pre ferential arrangements.” Discrete Mathematics 340, no. 5 (2017): 1122-1 128

work page 2017
[4]

Ferguso n, C

Guan, Meigu, Weixuan Li, Edward TH Wang, Ira Gessel, T. Ferguso n, C. Melolidakis, Roger B. Nelsen, and Ion Cucurezeanu. ”Elementary Pr oblems: E3059-E3063.” American Mathematical Monthly (1984): 580-581

work page 1984
[5]

W., and M

Gould, H. W., and M. E. Mays. ”Counting chains of subsets.” Utilitas Math- ematica 31 (1987): 227-232

work page 1987
[6]

”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

work page 2001
[7]

”Preferential arrangements.” The American Ma thematical Monthly 69, no

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

work page 1962
[8]

”Races with ties.” Mathematics Magazine 55, no

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

work page 1982
[9]

Knuth, J

Nelsen, Roger B., Donald E. Knuth, J. C. Binz, and Gordon Williams. ”E3062.” The American Mathematical Monthly 94, no. 4 (1987): 376 -377. 18

work page 1987
[10]

Corcino, Roberto B., and Cristina B. Corcino. ”On generalized Be ll polynomi- als.” Discrete Dynamics in Nature and Society 2011 (2011)

work page 2011
[11]

”Chains in power sets.” Mathematics Magazine 64, no

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

work page 1991
[12]

”Higher order generalized g eometric poly- nomials.” Turkish Journal of Mathematics 42, no

Kargin, Levent, and Bayram Cekim. ”Higher order generalized g eometric poly- nomials.” Turkish Journal of Mathematics 42, no. 3 (2018): 887-90 3

work page 2018
[13]

Corcino, Roberto B., Leetsch Charles Hsu, and Evelyn L. Tan. ” Combinatorial and statistical applications of generalized Stirling numbers.” In JOUR NAL OF MATHEMATICAL RESEARCH AND EXPOSITION-CHINESE EDITION-, vol. 21, no. 3 (2001): 337-343

work page 2001
[14]

N J A Sloane(ed), The On-line encyclopaedia of integer sequences available at http://oeis.org

work page
[15]

HS Wilf, Generatingfunctionology, Academic Press, Inc, 1990

work page 1990
[16]

”A uniﬁed appro ach to gener- alized Stirling numbers.” Advances in Applied Mathematics 20, no

Hsu, Leetsch C., and Peter Jau-Shyong Shiue. ”A uniﬁed appro ach to gener- alized Stirling numbers.” Advances in Applied Mathematics 20, no. 3 (19 98): 366-384

work page

[1] [1]

Analytic combinatorics

Flajolet, Philippe, and Robert Sedgewick. Analytic combinatorics. cambridge University press, 2009

work page 2009

[2] [2]

”Bar red Preferen- tial Arrangements.” The Electronic Journal of Combinatorics 20, n o

Ahlbach, Connor, Jeremy Usatine, and Nicholas Pippenger. ”Bar red Preferen- tial Arrangements.” The Electronic Journal of Combinatorics 20, n o. 2 (2013): P55

work page 2013

[3] [3]

”A study of a family of generating fun ctions of NelsenSchmidt type and some identities on restricted barred pre ferential arrangements.” 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 pre ferential arrangements.” Discrete Mathematics 340, no. 5 (2017): 1122-1 128

work page 2017

[4] [4]

Ferguso n, C

Guan, Meigu, Weixuan Li, Edward TH Wang, Ira Gessel, T. Ferguso n, C. Melolidakis, Roger B. Nelsen, and Ion Cucurezeanu. ”Elementary Pr oblems: E3059-E3063.” American Mathematical Monthly (1984): 580-581

work page 1984

[5] [5]

W., and M

Gould, H. W., and M. E. Mays. ”Counting chains of subsets.” Utilitas Math- ematica 31 (1987): 227-232

work page 1987

[6] [6]

”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

work page 2001

[7] [7]

”Preferential arrangements.” The American Ma thematical Monthly 69, no

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

work page 1962

[8] [8]

”Races with ties.” Mathematics Magazine 55, no

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

work page 1982

[9] [9]

Knuth, J

Nelsen, Roger B., Donald E. Knuth, J. C. Binz, and Gordon Williams. ”E3062.” The American Mathematical Monthly 94, no. 4 (1987): 376 -377. 18

work page 1987

[10] [10]

Corcino, Roberto B., and Cristina B. Corcino. ”On generalized Be ll polynomi- als.” Discrete Dynamics in Nature and Society 2011 (2011)

work page 2011

[11] [11]

”Chains in power sets.” Mathematics Magazine 64, no

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

work page 1991

[12] [12]

”Higher order generalized g eometric poly- nomials.” Turkish Journal of Mathematics 42, no

Kargin, Levent, and Bayram Cekim. ”Higher order generalized g eometric poly- nomials.” Turkish Journal of Mathematics 42, no. 3 (2018): 887-90 3

work page 2018

[13] [13]

Corcino, Roberto B., Leetsch Charles Hsu, and Evelyn L. Tan. ” Combinatorial and statistical applications of generalized Stirling numbers.” In JOUR NAL OF MATHEMATICAL RESEARCH AND EXPOSITION-CHINESE EDITION-, vol. 21, no. 3 (2001): 337-343

work page 2001

[14] [14]

N J A Sloane(ed), The On-line encyclopaedia of integer sequences available at http://oeis.org

work page

[15] [15]

HS Wilf, Generatingfunctionology, Academic Press, Inc, 1990

work page 1990

[16] [16]

”A uniﬁed appro ach to gener- alized Stirling numbers.” Advances in Applied Mathematics 20, no

Hsu, Leetsch C., and Peter Jau-Shyong Shiue. ”A uniﬁed appro ach to gener- alized Stirling numbers.” Advances in Applied Mathematics 20, no. 3 (19 98): 366-384

work page