arXiv (All)
open access
Permutations with a fixed number of occurrences of a monotone pattern
We bound the number of permutations with a fixed number $r$ of $321 \ominus p_0$ patterns by a constant times the number of permutations which avoid $321 \ominus p_0$. We use this new upper bound to show that the ordinary generating function for permutations with $r$ copies of $k(k-1)...1$ is not ra
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
- A parking function analog of the Schröder numbers#1076306
- Protected tails and polynomial-time enumeration of permutations avoiding a direct sum of an increasing pattern and 231#1156455
- Caged subsequences in permutations#793843
- Caged subsequences in permutations#789836
- Nonnesting permutations avoiding 123#973323
Record · ID 1354080
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