arXiv (All)
open access
Enumerating Pattern-Avoiding Involutions using Combinatorial Exploration
The enumeration of pattern-avoiding permutations has been a popular area of study over the past several decades, but comparatively little attention has been given to the topic of pattern-avoiding involutions. In this paper, we derive the algebraic generating functions of two Wilf-equivalence classes
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
- Protected tails and polynomial-time enumeration of permutations avoiding a direct sum of an increasing pattern and 231#1109623
- Stable patterns on permutations of multisets#820362
- Global patterns in signed permutations#1110087
- Permuton and local limits for the Luce model#1130471
- Avoiding patterns with three distinct letters in Canon permutations#821487
Record · ID 927648
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