arXiv (All)
open access
On the Number of Iterations in a Kruskal-Type Process
Motivated by the Kruskal counting procedure, this paper investigates a combinatorial elimination process defined on a deck consisting of $m$ copies of each value $1,2,\ldots,n$. Starting from an arbitrary arrangement of the $mn$ cards, the process repeatedly removes a number of consecutive cards equ
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- On Permutations Whose Adjacent-Sum Reciprocals Sum to One#1343941
- Théorie algébrique des nombres. (Algebraic number theory)#490227
- A parking function analog of the Schröder numbers#1076306
- Algebraic Proof of Completeness of a Positional Numeral System in the Normalized Mersenne Basis#1051584
- An Exact Rounds-versus-Queries Trade-off for Pointer Chasing, Machine-Checked in Lean 4#1393789
Record · ID 1413256
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive