arXiv (All)
open access
Avoiding patterns with three distinct letters in Canon permutations
We study avoidance of patterns of length $3$ with three distinct letters in canon permutations. We reduce the problem to studying pattern avoidance in lattice words and show that there are $6$ such pattern avoiding classes. This shows that there are $12$ classes for the original Canon permutation pa
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
- Pattern Popularity in 132-Avoiding Permutations#461144
- Protected tails and polynomial-time enumeration of permutations avoiding a direct sum of an increasing pattern and 231#1109623
- Order-Optimal Systematic Permutation Codes for Correcting t Deletions#1141895
- Enumerating Pattern-Avoiding Involutions using Combinatorial Exploration#927648
- Explicit formulas for permutation pattern character polynomials#665438
Record · ID 821487
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