arXiv (All)
open access
S-meandric Permutations and Tangency Polynomials
A meander is a configuration of two simple plane curves intersecting transversely. The orders of their intersection points define a permutation that determines the configuration. When tangencies are allowed, however, different configurations can share the same permutation. We study the combinatorial
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
- Explicit formulas for permutation pattern character polynomials#665438
- Explicit formulas for permutation pattern character polynomials#663938
- Parking functions, Smirnov words, and noncrossing Chow polynomials#972080
- Some new classes of permutation polynomials and their compositional inverses#684174
- Some new classes of permutation polynomials and their compositional inverses#682399
Record · ID 1078139
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