Weaving Patterns 7 is a dataset of weaving patterns, which are size n×(n−1) matrices with {1, 2, …, n} entries. These patterns were introduced to study the number of reduced decompositions of the longest permutation up to commutation equivalence. The dataset is hosted by ACDRepo on Hugging Face and was last updated on 2026-01-15.
Use Cases
- Counting reduced decompositions of permutations based on the combinatorial structure described.
- Studying parallel sorting networks based on the enumerated combinatorial phenomena.
- Analyzing commutation equivalence classes in permutation groups based on the matrix representation.
- Exploring bijections between weaving patterns and other combinatorial objects mentioned in the description.
Strengths
- Dataset is focused on a specific, well-defined combinatorial object: n×(n−1) matrices with entries from {1, 2, …, n}.
- The description links the patterns to established mathematical concepts like reduced decompositions and commutation equivalence.
Limitations
- Description metadata is limited; actual data quality requires manual inspection after download.
- Column-level documentation is absent; field semantics must be inferred after download.
- Row count is unknown, which may limit suitability assessment.
Provenance
- Source
- ACDRepo
- Freshness
- Last updated 2026-01-15 15:37:59; freshness should be verified.