pith. sign in

arxiv: 2606.18047 · v1 · pith:MVEJRMX6new · submitted 2026-06-16 · 🧮 math.PR · math.CO

Analysis of the asymmetric shelf shuffle

Raghavendra Tripathi This is my paper

Pith reviewed 2026-06-26 22:41 UTC · model grok-4.3

classification 🧮 math.PR math.CO
keywords shelf shuffleasymmetric permutation modelcycle distributiondescent statisticsinversion countRSK shaperandom permutations
0
0 comments X

The pith

The asymmetric shelf shuffle model allows derivation of permutation statistics for any placement probability p in (0,1).

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

The paper extends prior analysis of the shelf shuffle, which assigns cards to shelves and places them with bias p, to general p. It examines how this affects the distribution of cycles, their lengths, descents, valleys, inversions, and the RSK shape of the resulting permutation. This generalizes the symmetric p=1/2 case studied earlier and introduces new results on descents and inversions. A reader would care because it provides a parametric family of random permutation generators with explicit statistical properties.

Core claim

The distributions of cycle numbers, descent counts, inversion counts, and RSK shapes for permutations generated by the asymmetric shelf shuffle can be analyzed by extending the methods used for the symmetric case to arbitrary p.

What carries the argument

The asymmetric shelf shuffle, where each card is assigned to one of m shelves uniformly and placed at the top with probability p or bottom with probability 1-p.

If this is right

  • The cycle structure of the permutation is determined by the shelf assignments and placement choices in a way that generalizes the symmetric formulas.
  • Explicit distributions for the number of descents and inversions are obtained for any p, including p=1/2.
  • The RSK shape follows a distribution that can be computed from the generalized model.
  • Analysis of valleys and cycle lengths also extends directly.

Where Pith is reading between the lines

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

  • These results suggest the model can generate permutations with tunable bias in inversion count for applications in randomized algorithms.
  • Further work could examine the mixing time of repeated asymmetric shuffles as a function of p.
  • Connections may exist to other biased permutation models in probability theory.

Load-bearing premise

The combinatorial and probabilistic techniques developed for the symmetric case p=1/2 extend directly to arbitrary p without requiring additional model assumptions or restrictions on the parameters n and m.

What would settle it

A direct computation for small n and m of the descent distribution under p=0.7 and comparison against the extended formula from the symmetric case would falsify the claim if they disagree.

read the original abstract

In an asymmetric shelf shuffle, a deck of $n$ cards is dealt sequentially from the bottom and assigned one of the $m$ shelves uniformly at random. The card is placed at the top of the assigned shelf with probability $p$, and at the bottom of the assigned shelf with probability $(1-p)$. Analysis of the shelf shuffle has gained much attention recently, and the case $p=1/2$ was first treated by Diaconis--Fulman--Holmes [Ann. Appl. Prob. 23 (2013), no. 4, 1692--1720]. In this paper, we extend the analysis of the shelf shuffle to general $p\in (0, 1)$. In particular, we study the distribution of cycles, cycle lengths, number of descents, number of valleys, number of inversions, and the RSK shape of a permutation obtained from an asymmetric shelf shuffle. Our results extend the analysis of Diaconis--Fulman--Holmes to arbitrary $p$. Furthermore, our analysis of the distribution of descents and inversions is new even for $p=1/2$.

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 paper extends the analysis of the shelf shuffle permutation model from the symmetric case p=1/2 (Diaconis-Fulman-Holmes) to general p in (0,1). It derives the distributions of cycles and cycle lengths, number of descents, number of valleys, number of inversions, and the RSK shape under the asymmetric placement rule (top with prob p, bottom with prob 1-p).

Significance. The generalization to arbitrary p is of interest for biased shuffling models. The new results on descents and inversions (even for p=1/2) add to the literature on permutation statistics under this construction. The work appears to confirm that the cycle index, generating functions, and RSK analysis carry over with p-dependent but closed-form adjustments.

minor comments (2)
  1. [Introduction] The abstract states that the combinatorial techniques extend directly, but the manuscript should include an explicit statement (e.g., in the introduction or §2) confirming that no p=1/2 symmetry is used in the recursions for the descent or inversion generating functions.
  2. Notation for the shelf-assignment probabilities should be introduced once and used consistently when stating the p-dependent formulas for the cycle index or inversion table.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their positive summary, assessment of significance, and recommendation of minor revision. No specific major comments appear in the report.

Circularity Check

0 steps flagged

No significant circularity; extension relies on independent combinatorial techniques

full rationale

The paper claims to extend the Diaconis--Fulman--Holmes analysis (distinct authors) to general p via combinatorial and probabilistic methods for cycles, descents, inversions, and RSK shapes. The abstract states that descent/inversion results are new even for p=1/2, indicating fresh derivations rather than reductions to prior fits or self-definitions. No load-bearing self-citations, fitted inputs renamed as predictions, or ansatzes smuggled via citation appear in the provided text. The derivation chain is presented as self-contained against the symmetric case without tautological equivalence to inputs.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

Abstract-only review yields no explicit free parameters, invented entities, or non-standard axioms beyond ordinary probability.

axioms (1)
  • domain assumption Cards are assigned to shelves uniformly at random and placement decisions are independent Bernoulli trials with success probability p.
    This is the generative model stated in the abstract.

pith-pipeline@v0.9.1-grok · 5721 in / 1147 out tokens · 33982 ms · 2026-06-26T22:41:40.797882+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

14 extracted references · 5 canonical work pages · 1 internal anchor

  1. [1]

    [AD86] David Aldous and Persi Diaconis,Shuffling cards and stopping times, Amer. Math. Monthly93 (1986), no. 5, 333–348. MR 841111 [Ald83] David Aldous,Random walks on finite groups and rapidly mixing Markov chains, Seminar on prob- ability, XVII, Lecture Notes in Math., vol. 986, Springer, Berlin, 1983, pp. 243–297. MR 770418 [BD92] Dave Bayer and Persi ...

    work page arXiv 1986

  2. [2]

    [Cla25a] Alexander Clay,Guessing strategies for shuffling machines, arXiv:2507.10294,

    work page arXiv

  3. [3]

    [Cla25b] ,Limit theorems for descents and inversions of shelf-shuffles, arXiv:2510.00343,

    work page internal anchor Pith review Pith/arXiv arXiv

  4. [4]

    [CO25] Ray Chen and Andrea Ottolini,Cutoff in total variation for the shelf shuffle, Electron. Commun. Probab.30(2025), Paper No. 44,

    2025

  5. [5]

    Reidel Publishing Co., Dordrecht, 1974, The art of finite and infinite expansions

    MR 4908782 [Com74] Louis Comtet,Advanced combinatorics, enlarged ed., D. Reidel Publishing Co., Dordrecht, 1974, The art of finite and infinite expansions. MR 460128 [DF23] Persi Diaconis and Jason Fulman,The mathematics of shuffling cards, American Mathematical Society, Providence, RI,

    1974

  6. [6]

    MR 4565368 [DFH13] Persi Diaconis, Jason Fulman, and Susan Holmes,Analysis of casino shelf shuffling machines, Ann. Appl. Probab.23(2013), no. 4, 1692–1720. MR 3098446 [Dia88] Persi Diaconis,Group representations in probability and statistics, Institute of Mathematical Sta- tistics Lecture Notes—Monograph Series, vol. 11, Institute of Mathematical Statist...

    2013

  7. [7]

    1, 11–29

    MR 964069 [DMP95] Persi Diaconis, Michael McGrath, and Jim Pitman,Riffle shuffles, cycles, and descents, Combi- natorica15(1995), no. 1, 11–29. MR 1325269 [DS81] Persi Diaconis and Mehrdad Shahshahani,Generating a random permutation with random trans- positions, Z. Wahrsch. Verw. Gebiete57(1981), no. 2, 159–179. MR 626813 [GR04] George Gasper and Mizan Ra...

    1995

  8. [8]

    Math.375(2020), 107370,

    MR 4138640 [GZ20b] ,Plethystic formulas for permutation enumeration, Adv. Math.375(2020), 107370,

    2020

  9. [9]

    MR 4136604 [Had06] Jacques Hadamard,Book Review: Elementary Principles in Statistical Mechanics, Developed with especial Reference to the Rational Foundations of Thermodynamics, Bull. Amer. Math. Soc.12 (1906), no. 4, 194–210. MR 1558318 [Kel23] Bernd C. Kellner,Faulhaber polynomials and reciprocal Bernoulli polynomials, Rocky Mountain J. Math.53(2023), n...

    1906

  10. [10]

    MR 1197512 22 [NY25] Evita Nestoridi and Alan Yan,Cutoff for the biased random transposition shuffle, S´ em. Lothar. Combin.93B(2025), Art. 6,

    2025

  11. [11]

    Kyle Petersen,Eulerian numbers, Birkh¨ auser Advanced Texts: Basler Lehrb¨ ucher

    MR 4968505 [Pet15] T. Kyle Petersen,Eulerian numbers, Birkh¨ auser Advanced Texts: Basler Lehrb¨ ucher. [Birkh¨ auser Advanced Texts: Basel Textbooks], Birkh¨ auser/Springer, New York, 2015, With a foreword by Richard Stanley. MR 3408615 [Poi12] Henri Poincar´ e,Calcul des probabilit´ es, Gauthier-Villars,

    2015

  12. [12]

    [Sal25] Justin Salez,Modern aspects of markov chains: entropy, curvature and the cutoff phenomenon, arXiv:2508.21055,

    work page arXiv

  13. [13]

    Probab.50(2022), no

    [Sel22] Mark Sellke,Cutoff for the asymmetric riffle shuffle, Ann. Probab.50(2022), no. 6, 2244–2287. MR 4499839 [Sta24] Richard P. Stanley,Enumerative combinatorics. Vol. 2, second ed., Cambridge Studies in Advanced Mathematics, vol. 208, Cambridge University Press, Cambridge, [2024]©2024, With an appendix by Sergey Fomin. MR 4621625 [Ste97] John R. Stem...

    2022

  14. [14]

    [Tri26b] ,On the position matrix of single-shelf shuffle and card guessing, arXiv:2602.07920,

    work page arXiv