arXiv (OAI Expanded)
open access
Enumerating separable derangements
We give a polynomial-time algorithm to compute the number $b_n$ of separable derangements of $[n]$. This algorithm is based on a generating function technique which tracks permutations along with their occupied diagonals, where each permutation is counted once for every such diagonal. We provide bou
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
- Enumerating separable derangements#780889
- Nonnesting permutations avoiding 123#973323
- Maximal Lehmer Codes for Permutations with Classical and Consecutive 321-Avoidance#1117849
- Explicit formulas for permutation pattern character polynomials#665438
- Explicit formulas for permutation pattern character polynomials#663938
Record · ID 779514
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