Pith. sign in

REVIEW 6 minor 13 references

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

T0 review · 0 major / 6 minor · reviewed 2026-07-12 · grok-4.5

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

Pith's one-line read Deranged parking functions are unit-interval preferences whose lucky cars never line up by index and preference, counted by the deranged Bell numbers.

desk verdict Honest, carefully scoped parking-side structure for deranged Bell numbers; solid note, modest significance. read the letter →

arxiv 2607.01273 v2 pith:CKYHKHTY submitted 2026-06-30 math.CO

Yahia Djemmada This is my paper
classification math.CO MSC 05A1505A1805A05
keywords unit-intervalparkingfunctionsderangedBellnumbersorderedsetpartitionsluckycarsfixedblocksFubiniCayleypermutationsrencontrespolynomials
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

Unit-interval parking functions are preference lists in which every car parks in its preferred spot or exactly one spot later. They are known to be in bijection with ordered set partitions and are counted by the Fubini numbers. This note pulls the already-studied deranged ordered set partitions across that bijection, producing the deranged unit-interval parking functions. Enumeration and asymptotics therefore come for free from the deranged Bell numbers; what is new is the intrinsic parking language. The deranged condition is equivalent to a single test on the lucky cars: the order of those cars by index must disagree in every position with the order of the same cars by preferred spot. The same viewpoint stratifies every unit-interval parking function by how many of its blocks are fixed, yields a Poisson(1) limit law for that count, decomposes the Fubini numbers bijectively, and supplies fully deranged r-start and first-appearance Cayley models. A reader who works with parking functions or ordered partitions gains a concrete, simulation-friendly characterization of the deranged family and a family of refinements that live naturally on the parking side.

What carries the argument

The bijection ϕ that sends a unit-interval parking function to the ordered set partition whose blocks are the sets of cars preferring each successive value-block; leaders of those blocks are exactly the lucky cars, so the deranged condition and the fixed-block count become statements about two natural orders on the lucky cars.

What would settle it

For small n (say n=4 or 5) enumerate all unit-interval parking functions by direct parking simulation, compute the two orders of the lucky cars for each, and check whether the count of those with no matching positions equals the known deranged Bell number; any mismatch falsifies the characterization.

Watch

Extended reading notes

Core claim

A unit-interval parking function is deranged precisely when the standardization of its leader word is a derangement, or equivalently when the lucky cars ordered by increasing index differ from the lucky cars ordered by increasing preference in every coordinate. Through the known bijection with ordered set partitions this family is counted by the deranged Bell numbers, and the fixed-block stratification of all unit-interval parking functions is given by the rencontres formula {n brace m} binom(m,r) d_{m-r}.

Load-bearing premise

The paper relies on the block-structure theorem for unit-interval parking functions and on the explicit inverse of the bijection that identifies value-blocks with car sets and leaders with lucky cars; if either identification fails, the leader and lucky-car characterizations collapse.

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

0 major / 6 minor

Summary. The paper defines deranged unit-interval parking functions DUPF_n by pulling the deranged ordered set partitions of Belbachir–Djemmada–Németh back through the known bijection ϕ between unit-interval parking functions and ordered set partitions. It states explicitly that |DUPF_n|=F̃_n, the Stirling-transform formula, the EGF e^{1−e^x}/(2−e^x), and the dominant asymptotics are transported consequences, not new enumerative discoveries. The new material is parking-side structure: an intrinsic leader characterization (Prop. 3.3) and an equivalent lucky-car ordering test (Thm. 3.11); a fixed-block stratification of all UPF_n with rencontres counts (Thm. 4.3), a marked EGF, and a Poisson(1) limit law for the number of fixed blocks (Cor. 4.6); a bijective fixed-block decomposition of the Fubini numbers (Thm. 4.7); a multivariate block-size refinement; a fully deranged r-start extension carefully distinguished from the r-deranged Bell numbers; and a Cayley-permutation model read from first-appearance ranks.

Significance. The note supplies a clean, self-contained parking-function counterpart to the deranged Bell numbers, with characterizations (leaders, lucky cars, first appearances) that can be checked from the parking process alone. The fixed-block stratification of all UPF_n, the Poisson limit, and the bijective Fubini decomposition are natural and correctly executed. Strengths include: an explicit inductive inverse of ϕ (Lemma 2.4) with a preserved block-spot invariant; honest novelty disclosure; careful separation of the fully deranged r-start family from the r-deranged Bell numbers of [3]; and small-n values confirmed by exhaustive search against OEIS A064898. The work is a solid combinatorial note that fits the literature on restricted unit-interval parking functions and deranged partition statistics.

minor comments (6)
  1. In §2.3–2.4 and Prop. 3.3, the two orders on blocks (value order vs. min-leader order) are clear once introduced, but a single short sentence early in §3 equating “fixed block” with “leader is the j-th smallest leader” would help readers who skip the OSP language.
  2. Cor. 3.12: the counterexample (2,1,3) is useful; adding one line that a1≠1 is necessary but not sufficient would make the logical status of the first-car condition fully explicit for skimmers.
  3. Thm. 4.7 / Rem. 4.9: the bijection is the main contribution here; a brief parenthetical that the generating-function identity F=B·F̃ is classical (or already in [3]) would further reinforce the paper’s careful novelty stance.
  4. §5.1: the numerical sequences for |DUPF^r_{n+r}| are helpful; if space permits, a one-line pointer that they are not currently in the OEIS would aid future cataloguing.
  5. Typographical: a few long compound sentences in the Introduction and §4.2 could be split for readability; check consistency of “deranged Bell” vs. “deranged Bell numbers” and of the tilde notation F̃_n throughout.
  6. Table 2 and the n=3 example list are consistent with the formulas; a parenthetical that the n≤7 exhaustive checks used the lucky-car test of Thm. 3.11 (or the leader-word test) would document the verification method.

Circularity Check

2 steps flagged · score 2.0 of 10

Openly definitional transport of the author's prior deranged Bell numbers; parking characterizations and refinements are independent and non-circular.

  1. self definitional [Def. 3.1 + Prop. 3.2 (and Abstract / §1 novelty paragraph)]
    "DUPF_n := ϕ^{-1}(DOSP_n) ... the map ϕ restricts to a bijection DUPF_n → DOSP_n, and |DUPF_n|=˜F_n = ∑_{k=0}^n d_k {n \brace k}. ... The equality |DUPF_n|=˜F_n, the Stirling-transform formula, the exponential generating function e^{1-e^x}/(2-e^x), and the dominant asymptotics are therefore not presented as new enumerative discoveries; they are consequences of the known deranged Bell-number theory."

    The set is defined as the preimage of the already-counted deranged ordered set partitions under a bijection, so the cardinality equality is tautological. The paper acknowledges this and does not treat the count as a derived theorem, but the object itself is constructed precisely so that the equality holds.

  2. self citation load bearing [§1 and Thm. 4.1 (citing [3])]
    "Independently, Belbachir, Djemmada, and Németh [3] introduced the deranged Bell numbers ˜F_n. ... The generating function of ˜F_n is due to Belbachir, Djemmada, and Németh [3, Thm. 3.1]; it is not new here. ... the ordered-set-partition interpretation, formula (1), the exponential generating function, and the basic asymptotics are due to Belbachir, Djemmada, and Németh [3]."

    The enumerative foundation (formula (1), EGF, asymptotics) is taken from a paper co-authored by the present author. While the paper re-proves the EGF by the symbolic method and is transparent about attribution, the base sequence and its closed form rest on this overlapping-author citation rather than an external independent source.

full rationale

The paper defines DUPF_n as the preimage ϕ^{-1}(DOSP_n) under the known UPF–OSP bijection, so |DUPF_n|=˜F_n holds by construction. It states this repeatedly and explicitly refuses to claim the count, Stirling formula, EGF e^{1-e^x}/(2-e^x), or asymptotics as new (Abstract; §1; Prop. 3.2; Novelty paragraph). The base objects and formula (1) come from Belbachir–Djemmada–Németh [3] (overlapping author), a self-citation, but the paper re-derives the EGF via the labelled composition Der∘E_{≥1} and attributes the rest. All claimed new results—leader/lucky-car tests (Prop. 3.3, Thm. 3.11), fixed-block stratification (Thm. 4.3), rencontres EGF and Poisson(1) limit (Prop. 4.5, Cor. 4.6), bijective Fubini decomposition (Thm. 4.7), block-size marking (Thm. 4.10), fully deranged r-start (Thm. 5.3), and Cayley first-appearance model (Prop. 5.9)—are obtained by rewriting the derangement condition in parking language or by elementary rencontres/symbolic-method arguments that do not reduce to the input count. No fitted parameters, no uniqueness theorems, no ansatz smuggling, and no prediction that is forced by construction. The single minor circularity is the transparent definitional renaming plus self-citation of the base sequence; it is not load-bearing for the parking-side claims. Score 2 is therefore appropriate.

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

Pure enumerative combinatorics: no fitted parameters, no physical constants, no new dynamical entities. The ledger records only the standard combinatorial background the note relies on and the named combinatorial objects it introduces by definition.

assumptions (5)
  • standard math Unit-interval parking functions are in bijection with ordered set partitions via the car-to-block map ϕ of Chaves Meyles et al.; the paper supplies a self-contained inverse ψ (Lemma 2.4).
    Load-bearing for every parking-side statement; proved by induction on arrival order in §2.3.
  • domain assumption Block structure of a unit-interval parking function (Definition 2.1 and Theorem 2.2 of Bradt et al.): rearrangements stay unit-interval precisely when relative order inside each prime block is preserved.
    Cited and used throughout; the paper does not re-prove the rearrangement criterion.
  • standard math Deranged ordered set partitions are those whose block permutation (relative to min-element order) is a derangement; their count is the deranged Bell number ~F_n = sum d_k {n \brace k} (Belbachir–Djemmada–Németh).
    Definition transported by preimage; enumeration and EGF taken as known.
  • standard math Labelled species composition theorem: EGF of Der ◦ E_{≥1} is D(E(x)) with D(z)=e^{-z}/(1-z) and E(x)=e^x-1 (Flajolet–Sedgewick).
    Used for the EGF of ~F_n and all marked refinements (Thm. 4.1, Prop. 4.5, Thm. 4.10).
  • standard math Singularity analysis at the simple pole x=log 2 of 1/(2-e^x) yields the dominant asymptotics of Fubini and deranged Bell numbers.
    Applied in Remark 4.2 and Prop. 5.4; standard transfer theorems.
invented entities (3)
  • Deranged unit-interval parking functions DUPF_n independent evidence
    purpose: Parking-function preimage of deranged ordered set partitions; vehicle for leader/lucky-car and fixed-block statistics.
    Defined as ϕ^{-1}(DOSP_n); independent enumerative handle via parking simulation or Cayley first appearances.
  • Fully deranged r-start unit-interval parking functions DUPF^r_{n+r} independent evidence
    purpose: Intersection of r-start UPF with DUPF; counted by sum d_{k+r} {n+r \brace k+r}_r.
    Distinct from the authors’ earlier r-deranged Bell numbers (different derangement condition); small values verified by search.
  • Deranged Cayley permutations DCP_n independent evidence
    purpose: Sequence model in which the deranged condition is read from the first-appearance permutation θ_p.
    Obtained by composing the standard Cayley–OSP bijection with ϕ; equivalent count ~F_n.

how reviews work

0 comments
Cite this review

Pith. "Pith review of On Deranged Unit-Interval Parking Functions and the Deranged Bell Numbers." pith.science (2026). https://pith.science/paper/CKYHKHTY

@misc{pith2026260701273,
  author       = {Pith},
  title        = {Pith review of: On Deranged Unit-Interval Parking Functions and the Deranged Bell Numbers},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/CKYHKHTY}},
  note         = {Machine review of arXiv:2607.01273}
}
abstract

Unit-interval parking functions are counted by the Fubini numbers and are in explicit bijection with ordered set partitions. We transport the deranged ordered set partitions of Belbachir, Djemmada, and N\'emeth through this bijection and obtain the deranged unit-interval parking functions $\mathrm{DUPF}_n$. The equality $|\mathrm{DUPF}_n|=\widetilde F_n$, the Stirling-transform formula, the exponential generating function $e^{1-e^x}/(2-e^x)$, and the dominant asymptotics are therefore not presented as new enumerative discoveries; they are consequences of the known deranged Bell-number theory. The new material of this note is the parking-side structure: leader and lucky-car characterizations, a fixed-block stratification of all unit-interval parking functions, rencontres-type generating functions and a Poisson limit law for fixed blocks, a bijective fixed-block decomposition of the Fubini numbers, a multivariate block-size refinement, a fully deranged $r$-start extension, and a Cayley-permutation model based on first appearances.

Review history (2 revisions) →

Discussion (0). Sign in to comment.

Reference graph

Works this paper leans on

13 extracted references · 1 linked inside Pith

  1. [3]

    Belbachir, Y

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

    2023

  2. [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

    2024

  3. [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

    2026

  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

    2024

  5. [5]

    A. Z. Broder.Ther-Stirling numbers. Discrete Math.49(1984), 241–259

    1984

  6. [6]

    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

    2025

  7. [7]

    Djemmada, L

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

    arXiv 2025

  8. [8]

    Flajolet and R

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

    2009

Show all 13 references
  1. [9]

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

    2022

  2. [10]

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

    1966

  3. [11]

    Mor and A

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

    1984

  4. [12]

    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

    2020

  5. [13]

    OEIS Foundation Inc.The On-Line Encyclopedia of Integer Sequences, entry A064898 (Stirling transform of the derangement numbers; entered by K. A. Penson, 2001).https: //oeis.org/A064898. 14

    2001

Pith tools

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