arXiv (OAI Expanded)
open access
Global patterns in signed permutations
Global permutation patterns have recently been shown to characterize important properties of a Coxeter group. Here we study global patterns in the context of signed permutations, with both characterizing and enumerative results. Surprisingly, many properties of signed permutations may be characteriz
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
- Permutation polynomials over finite fields from low-degree rational functions#819221
- Permutation polynomials over finite fields from low-degree rational functions#809229
- Protected tails and polynomial-time enumeration of permutations avoiding a direct sum of an increasing pattern and 231#1156455
- Enumeration of certain permutation group polynomials#784875
- Enumeration of certain permutation group polynomials#783285
Record · ID 1110087
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