pith. sign in

arxiv: 2607.01273 · v1 · pith:CKYHKHTYnew · submitted 2026-06-30 · 🧮 math.CO

On Deranged Unit-Interval Parking Functions and the Deranged Bell Numbers

Yahia Djemmada This is my paper

Pith reviewed 2026-07-03 21:49 UTC · model grok-4.3

classification 🧮 math.CO
keywords deranged unit-interval parking functionsderanged Bell numbersordered set partitionsFubini numberslucky carsStirling numbersgenerating functionsCayley permutations
0
0 comments X

The pith

Deranged unit-interval parking functions are counted by the deranged Bell numbers because the standard bijection with ordered set partitions restricts to the deranged case.

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

Unit-interval parking functions of length n are known to be counted by the Fubini numbers and to stand in explicit bijection with ordered set partitions of [n]. The paper isolates those parking functions whose associated partition satisfies the derangement condition that no block sits in the position given by its minimum element, and shows that the same bijection maps these objects onto the deranged ordered set partitions. Consequently the number of deranged unit-interval parking functions equals the n-th deranged Bell number. The work also supplies an intrinsic description of the deranged condition in terms of lucky cars, refines the count by total displacement and by number of blocks, and derives the exponential generating function e^{1-e^x}/(2-e^x) together with several convolution identities.

Core claim

Unit-interval parking functions of length n are in explicit bijection with ordered set partitions of [n]. The bijection restricts to the deranged objects, where no block occupies the position indexed by its minimum element, so the deranged unit-interval parking functions are counted by the n-th deranged Bell number tilde F_n. An intrinsic, coordinate-wise characterization is given through the lucky cars of a parking function. The enumeration is refined by total displacement, yielding d_m Stir{n}{m} deranged unit-interval parking functions with m blocks. The exponential generating function is obtained by the symbolic method as e^{1-e^x}/(2-e^x). A fixed-block convolution relating the Fubini n

What carries the argument

The explicit bijection between unit-interval parking functions of length n and ordered set partitions of [n] that preserves the deranged condition (no block in the position of its minimum element).

If this is right

  • The number of deranged unit-interval parking functions with m blocks equals d_m times the Stirling number of the second kind Stir{n}{m}.
  • A fixed-block convolution identity holds among the Fubini numbers, ordinary Bell numbers, and deranged Bell numbers.
  • The count of deranged unit-interval parking functions can be refined by the number of singleton blocks using the 2-associated Stirling numbers.
  • An r-start generalization exists together with a model in terms of deranged Cayley permutations.

Where Pith is reading between the lines

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

  • The same restriction technique may apply to other families of parking functions that already possess ordered-set-partition bijections.
  • The derived generating function e^{1-e^x}/(2-e^x) supplies a new route to asymptotic or recurrence relations for the deranged Bell numbers themselves.
  • The lucky-car characterization may translate into a direct probabilistic or algorithmic test for the deranged property without constructing the full partition.

Load-bearing premise

The explicit bijection between unit-interval parking functions and ordered set partitions restricts exactly to the deranged objects as defined by the no-block-in-minimum-position condition.

What would settle it

A direct enumeration for some n greater than 3 that finds a different number of deranged unit-interval parking functions than the known value of the n-th deranged Bell number.

read the original abstract

Unit-interval parking functions of length $n$ are enumerated by the Fubini numbers $F_n$ and are in explicit bijection with the ordered set partitions of $[n]$. We use this bijection to single out the unit-interval parking functions whose associated ordered set partition is \emph{deranged} in the sense of Belbachir, Djemmada, and N\'emeth -- no block occupies the position indexed by its minimum element -- and call them the \emph{deranged unit-interval parking functions} $\DUPF_n$. Since the bijection restricts to the deranged objects, $|\DUPF_n| = \tilde F_n$, the $n$-th deranged Bell number. We give an intrinsic, coordinate-wise characterization of the deranged condition through the lucky cars (equivalently, the block leaders) of a parking function, and we refine the enumeration by total displacement, obtaining $d_m\Stir{n}{m}$ deranged unit-interval parking functions with $m$ blocks. We derive the exponential generating function $e^{1-e^x}/(2-e^x)$ by the symbolic method, prove a fixed-block convolution relating $F_n$, the Bell numbers, and $\tilde F_n$, refine the count by singleton blocks via $2$-associated Stirling numbers, and describe an $r$-start extension together with a deranged Cayley-permutation model. Worked examples and a table of values are included.

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

0 major / 2 minor

Summary. The manuscript defines deranged unit-interval parking functions (DUPF_n) by restricting the standard bijection between unit-interval parking functions of length n and ordered set partitions of [n] to those partitions that are deranged (no block occupies the position indexed by its minimum element, per Belbachir-Djemmada-Németh). It concludes that |DUPF_n| equals the n-th deranged Bell number ilde F_n by this restriction. Additional contributions include a coordinate-wise characterization of the deranged condition via lucky cars/block leaders, a refinement counting d_m inom{n}{m} such objects with m blocks and total displacement, the EGF e^{1-e^x}/(2-e^x) derived via the symbolic method, a fixed-block convolution relating F_n, Bell numbers, and ilde F_n, a refinement by singleton blocks using 2-associated Stirling numbers, and an r-start extension with a deranged Cayley-permutation model, supported by examples and a table of values.

Significance. If the results hold, the paper supplies a new combinatorial model for the deranged Bell numbers inside the well-studied class of unit-interval parking functions, together with an intrinsic (non-bijection-dependent) characterization and a clean symbolic-method derivation of the EGF. The refinements by displacement and singletons, the convolution identity, and the r-start/Cayley extensions are concrete additions to the enumeration literature. The explicit use of the known bijection and the provision of worked examples and tabulated values are strengths.

minor comments (2)
  1. [Abstract] The notation d_m for the displacement refinement is introduced in the abstract without an inline definition; a brief parenthetical or reference to its definition in §3 would improve readability.
  2. [Introduction / §2] The statement that the bijection 'restricts' is correct by construction once DUPF_n is defined as the preimage, but a one-sentence reminder that the deranged condition is preserved under the inverse map would make the equality less tautological on first reading.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their careful reading and positive summary of the manuscript. The report recommends acceptance and raises no major comments or criticisms. We appreciate the recognition of the new combinatorial model for deranged Bell numbers within unit-interval parking functions, the intrinsic characterization, the EGF derivation, and the various refinements and extensions.

Circularity Check

1 steps flagged

Central enumeration claim reduces to definitional equality by construction of DUPF_n

specific steps
  1. self definitional [Abstract]
    "We use this bijection to single out the unit-interval parking functions whose associated ordered set partition is deranged in the sense of Belbachir, Djemmada, and Németh -- no block occupies the position indexed by its minimum element -- and call them the deranged unit-interval parking functions DUPF_n. Since the bijection restricts to the deranged objects, |DUPF_n| = ilde F_n, the n-th deranged Bell number."

    DUPF_n is defined exactly as the preimage of the deranged ordered set partitions under the bijection. The cardinality statement is therefore true by the definition of DUPF_n together with bijectivity; the phrase 'the bijection restricts' adds no new verification beyond the selection criterion used to define the objects.

full rationale

The paper defines DUPF_n precisely as the subset of unit-interval parking functions whose images under the stated bijection are the deranged ordered set partitions (with the deranged condition taken from the cited prior work). The asserted equality |DUPF_n| = tilde F_n then follows immediately from the definition of the set and the bijectivity of the map; it is not an independent derivation. Other results in the paper (intrinsic characterization via lucky cars, symbolic generating function, convolutions) do not rely on this step and appear self-contained, so the circularity is localized to the counting claim.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 1 invented entities

Central claims rest on the standard bijection between unit-interval parking functions and ordered set partitions together with the external definition of deranged ordered set partitions; no free parameters are introduced and the new class itself has no independent evidence outside the paper.

axioms (1)
  • domain assumption Unit-interval parking functions of length n are in explicit bijection with the ordered set partitions of [n].
    Invoked at the start of the abstract to single out the deranged subset.
invented entities (1)
  • Deranged unit-interval parking functions (DUPF_n) no independent evidence
    purpose: New combinatorial class obtained by restricting the standard bijection to deranged ordered set partitions.
    Defined for the first time in this work; no falsifiable handle outside the enumeration is supplied.

pith-pipeline@v0.9.1-grok · 5789 in / 1235 out tokens · 27934 ms · 2026-07-03T21:49:54.726783+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

11 extracted references · 11 canonical work pages

  1. [1]

    Aguilar-Fraga, J

    T. Aguilar-Fraga, J. Elder, R. E. Garcia, K. P. Hadaway, P. E. Harris, K. J. Harry, I. B. Hogan, J. Johnson, J. Kretschmann, K. Lawson-Chavanu, J. C. Martínez Mori, C. D. Monroe, D. Quiñonez, D. Tolson III, and D. A. Williams II.Interval andℓ-interval rational parking functions. Discrete Math. Theor. Comput. Sci.26:1(2024), #10

    work page 2024

  2. [2]

    Barreto, P

    C. Barreto, P. E. Harris, J. L. Ramírez, and J. C. Vasquez.Restricted Fubini rankings and restricted unit-interval parking functions. Discrete Math. Algorithms Appl. (2026), 2650063

    work page 2026

  3. [3]

    Belbachir, Y

    H. Belbachir, Y. Djemmada, and L. Németh.The deranged Bell numbers. Math. Slovaca 73(2023), 849–860

    work page 2023

  4. [4]

    S. A. Bradt, J. Elder, P. E. Harris, G. Rojas Kirby, E. Reutercrona, Y. Wang, and J. Whid- den.Unit interval parking functions and ther-Fubini numbers. La Matematica3(2024), 370–384

    work page 2024

  5. [5]

    Chaves Meyles, P

    L. Chaves Meyles, P. E. Harris, R. Jordaan, G. Rojas Kirby, S. Sehayek, and E. Spingarn. Unit-interval parking functions and the permutohedron. J. Comb.16(2025), 281–301

    work page 2025

  6. [6]

    Djemmada, L

    Y. Djemmada, L. Kargın, and M. Can.Partial deranged Bell numbers and their combina- torial properties. Preprint, 2025. arXiv:2507.21643

    work page arXiv 2025

  7. [7]

    Flajolet and R

    P. Flajolet and R. Sedgewick.Analytic Combinatorics. Cambridge University Press, Cam- bridge, 2009

    work page 2009

  8. [8]

    K. P. Hadaway.On combinatorial problems of generalized parking functions. Honors Thesis, Williams College, 2022

    work page 2022

  9. [9]

    A. G. Konheim and B. Weiss.An occupancy discipline and applications. SIAM J. Appl. Math.14(1966), 1266–1274

    work page 1966

  10. [10]

    Mor and A

    M. Mor and A. S. Fraenkel.Cayley permutations. Discrete Math.48(1984), 101–112

    work page 1984

  11. [11]

    Nkonkobe, B

    S. Nkonkobe, B. Bényi, R. B. Corcino, and C. B. Corcino.A combinatorial analysis of higher order generalised geometric polynomials: a generalisation of barred preferential ar- rangements. Discrete Math.343(2020), 111729. 12

    work page 2020