arXiv (All)
open access
Arrow-Wilf equivalences and enumerative results for short arrow patterns
Arrow patterns, introduced by Berman and Tenner, provide a unified framework for studying permutation classes where both one-line and cycle structure constraints are present. In this paper, we continue the systematic study of arrow pattern avoidance initiated by Archer and Laudone. We establish seve
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
- Can Aggregate Invariants Accelerate Continuous Subgraph Matching? Limits, Laws, and a Dynamic Spectral Index#303303
- Nonnesting permutations avoiding 123#973323
- Iterating the Lehmer code on inversion sequences: Catalan fixed points and finite stabilization#998351
- Order-Optimal Systematic Permutation Codes for Correcting t Deletions#1141895
- Enumerating Pattern-Avoiding Involutions using Combinatorial Exploration#927648
Record · ID 1077321
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