Weaving patterns are size n×(n−1)n \times (n−1)n×(n−1) matrices with {1,2,…,n}{1, 2, \dots , n}{1,2,…,n}-
entries introduced by [1] to study the number of reduced decompositions of the longest
permutation (which swaps nnn and 111, nnn - 111 and 222, etc.) up
to commutation equivalence. The number
of such objects counts a wide range of combinatorial phenomena, including the number of parallel sorting
networks, the number… See the full description on the dataset page:
https://huggingface.co/datasets/ACDRepo/weaving_patterns_7.
