Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2604.23825

Recursive Record Filtering and Longest Decreasing Subsequences

Jackson Zariski·Kaitlin Kratter
View original source ↗Read source document ↗Export metadata ↓

Abstract

We consider a recursive record-filtering procedure, which we informally call Disappear-Sort, acting as a sort of parallel to traditional patience sorting. Let $D_n$ denote the number of passes required to eliminate a sequence of length $n$ sampled as i.i.d.\ copies of a continuous random variable, where each pass retains the left-to-right records and applies the same rule recursively to the remaining entries. For the non-resampling procedure, we associate to a permutation $p_n\in S_n$ a natural poset and show that the recursive Disappear-Sort layers form an antichain decomposition of this poset. This provides an order-theoretic interpretation of the procedure and identifies the total number of passes with $L(p_n)$, the length of the longest decreasing subsequence of $p_n$. Equivalently, after reversing the comparison direction, the Disappear-Sort layers coincide with the piles arising in classical patience sorting. For a uniformly random permutation, the pass count therefore has the same distribution as the first-column length of the tableau shape produced by the Robinson--Schensted correspondence. We use this classical connection to express $\mathbb{E}[D_n]$ as a sum over partitions and standard Young tableaux. Established results on Plancherel-random Young diagrams then imply $\mathbb{E}[D_n]\sim 2\sqrt{n}$, with fluctuations on the $n^{1/6}$ scale governed by the Tracy--Widom distribution. We also consider a resampling variant in which the nonrecord entries are replaced after each pass by a fresh independent sample of the same size, and derive an exact recurrence for its expected number of passes involving the unsigned Stirling numbers of the first kind. We conclude with an $O(n\log n)$ implementation for computing the non-resampling pass count.

Explore related subjects

math.COmath.PR

Keep this discovery

BibTeXRIS

Jackson Zariski, Kaitlin Kratter. 2026-04-26. Recursive Record Filtering and Longest Decreasing Subsequences. https://arxiv.org/abs/2604.23825

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Balanced even cycles in signed graphs:Tur\'an bounds, double covers, and parity obstructions

We study Tur\'an problems for balanced even cycles in simple signed graphs, where signed subgraphs are considered up to switching. For every balanced bipartite signed graph, the signed and ordinary Tur\'an numbers differ by at most a factor of two. Our main structural results concern the underlying graphs that admit a signing in which every $2k$-cycle is unbalanced. We characterize these graphs by the absence of an odd dependence among their $2k$-cycle incidence vectors, give a cohomological formulation, and construct subgraph-minimal obstructions of arbitrarily large order. In particular, there is no finite forbidden-subgraph characterization. We also give an exact closed-walk criterion for cycles in double covers and derive a direct signed breadth-first-search upper bound. As applications, we prove \[ \hex(n,C_{+4})=\left(\frac{\sqrt2}{2}+o(1)\right)n^{3/2} \] and study the signed hexagon number $R_6(n)=\hex(n,\{C_{-3},C_{+6}\})$. We characterize the underlying graphs counted by $R_6$ and express it as an extremal problem for ordinary $C_6$-free graphs with a prescribed involution. For every sufficiently large $n$, we construct examples with $\Omega(n^{4/3})$ edges, and we give an equivariant construction attaining the coefficient obtained from the F\"uredi--Naor--Verstra\"ete lower bound by double-cover transfer. Finally, we give $n$-vertex $C_{+10}$-free signed graphs with $\Omega(n^{6/5})$ edges and use octagon examples to illustrate the limitations of theta-freeness as a signing criterion.

math.CO↗
arXiv2026

Fractional DP-colorings of $d$-degenerate locally sparse graphs

Bernshteyn, Kostochka, and Zhu (2020) introduced the notion of fractional DP-coloring, which generalizes both fractional coloring and fractional list coloring. Among several foundational results, they proved that every $d$-degenerate bipartite graph $G$ satisfies $\chi_f^{\mathrm{DP}} \le (1 + o(1))\frac{d}{\log d}$, and that this bound is optimal---a stark contrast to ordinary fractional coloring. In this paper, we extend this upper bound to all $d$-degenerate triangle-free graphs, proving that $\chi_f^{\mathrm{DP}} \le (4 + o(1))\frac{d}{\log d}$. This generalizes a recent result of Martinsson and Steiner (2025) for ordinary fractional coloring. We derive this result as a corollary of a more general upper bound concerning locally sparse graph orderings. Specifically, a $d$-degenerate graph $G$ is left $k$-locally-sparse if it admits a degeneracy ordering in which, for every vertex $v$, the subgraph induced by its back-neighbors contains at most $k$ edges. We show that if a $d$-degenerate graph $G$ is left $\frac{d^2}{f}$-locally-sparse, then \[ \chi_f^{\mathrm{DP}}(G) \le (8 + o(1))\frac{d}{\log f}. \] This immediately yields an identical upper bound on the ordinary fractional chromatic number $\chi_f(G)$, improving upon the leading constants of previously known bounds. Additionally, we establish the asymptotic sharpness of this result up to the leading constant. For any $1 \ll f \le d^2$, we construct $d$-degenerate graphs that are left $\frac{d^2}{f}$-locally-sparse and satisfy $\chi_f(G) \ge (1 - o(1))\frac{d}{\log f}$. Finally, as applications of our main theorem, we obtain improved upper bounds on the fractional DP-chromatic number of $d$-degenerate $K_{1,t,t}$-free graphs, as well as $K_{t,t,t}$-free graphs with maximum degree $\Delta$. Notably, these bounds improve upon existing results even in the setting of ordinary fractional coloring.

math.CO↗
arXiv2026

Erd\H{o}s-S\'{o}s for digraphs

It is shown that every Eulerian digraph on $n$ vertices with more than $(t-1)n$ arcs contains every oriented tree with $t$ edges. The digraphs have no loops or repeated arcs, but opposite arcs are permitted. The bound is sharp for each fixed oriented tree, as witnessed by disjoint unions of complete bidirected graphs. Previously, such tight bounds were not known, even just for directed paths. This can be considered as a directed analog of the recently proved Erd\H{o}s-S\'os conjecture. The result was proved by GPT-6 Astra.

math.CO↗