Datasets:

ACDRepo
/

weaving_patterns_6

@@ -2,12 +2,12 @@
 license: cc-by-2.0
 ---
-# Dataset Card for Weaving Patterns of Size, \\(n = 6\\)
-Weaving patterns are \\(n \times n−1\\)-matrices with \\(\{1, 2, . . . , n\}\\)-
 entries introduced by \[1\] to study the number of reduced decompositions of the
-permutation \\(\sigma = n\; n − 1 \;\dots\; 1\\) up to commutation equivalence. The number
-of such objects also counts the number of parallel sorting
 networks, the number of rhombic tilings of regular polygons, and is connected to
 the study of the higher Bruhat orders \[2\]. An \\(O(n^2)\\) algorithm for determining
 if a given \\(\{1, 2, . . . , n\}\\)-matrix is a valid weaving pattern
@@ -21,21 +21,17 @@ ML models that can detect necessary or sufficient conditions
 for a matrix to be a valid weaving pattern have the potential
 to lead to substantial improvements in the upper bound.
-Each dataset is a mixture of enriched weaving patterns and
-non-weaving pattern matrices with \\(\{1, 2, . . . , n\}\\)-entries.
 ## Dataset Details
-Weaving patterns of size \\(n \times n − 1\\) are a special type of matrix containing
-entries in \\(\{1, 2, . . . , n\}\\). They correspond to representations of the
-longest word permutation of \\(n\\) elements (the permutation that sends
-\\(1 \mapsto n\\), \\(2 \mapsto n − 1\\), etc.). This
-task involves trying to identify weaving patterns among matrices that look like weaving patterns but are not.
 Each matrix is stored on a single line in row-major format. For instance,
-`(0, 1, 2, 3, 3, 2, 3, 4, 2, 3, 2, 1, 5, 4, 3, 2)`
-The datasets can also be found [here](https://drive.google.com/file/d/1HsWuHpTkCOtpyTG2dFH49jzkKIZYwKG8/view?usp=sharing).
 Data loaders can be found [here](https://github.com/pnnl/ML4AlgComb/tree/master/weaving_patterns).
 **Statistics**
@@ -44,19 +40,16 @@ Data loaders can be found [here](https://github.com/pnnl/ML4AlgComb/tree/master/
 | Train | 634 | 1,116 |
 | Test  | 275 | 467 |
-This dataset is small, we encourage users to also look at the dataset for \\(n = 7\\).
-**Math question:** Find an algorithm or set of rules that can efficiently distinguish between
-weaving pattern matrices and non-weaving pattern matrices. This should be more efficient than the
 \\(O(n^2\\) algorithm that can be found in the references above.
-**ML task:** Train a model to classify whether a \\(\{1, 2, . . . , n\}\\)-
 matrix is a weaving pattern or not. This task is framed as
 binary classification. Extract mathematical insights from a performant model.
-If a successful model is trained, it would be interesting to understand whether the model has
-learned an existing algorithm or whether it has discovered something new.
 ## Small model performance
 We provide some basic baselines for this task. Benchmarking details can be found in the associated paper.
@@ -74,7 +67,7 @@ The \\(\pm\\) signs indicate 95% confidence intervals from random weight initial
 ### Dataset Sources
-Data generation scripts can be found [here](https://github.com/pnnl/ML4AlgComb/tree/master/symmetric_group_character).
 - **Repository:** [ACD Repo](https://github.com/pnnl/ML4AlgComb/tree/master/weaving_patterns)
@@ -94,9 +87,7 @@ None.
 ## Dataset Structure
-Each matrix is stored on a single line in row-major format. For instance,
-`(0, 1, 2, 3, 3, 2, 3, 4, 2, 3, 2, 1, 5, 4, 3, 2)`
 ## Dataset Creation

 license: cc-by-2.0
 ---
+# Dataset Card for Weaving Patterns of Size, \\6 \times 5\\)
+*Weaving patterns* are \\((n \times n−1)\\)-matrices with \\(\{1, 2, \dots , n\}\\)-
 entries introduced by \[1\] to study the number of reduced decompositions of the
+permutation that swaps \\(n\\) and \\(1\\), \\(n\\) - \\(1\\) and \\(2\\), 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 of rhombic tilings of regular polygons, and is connected to
 the study of the higher Bruhat orders \[2\]. An \\(O(n^2)\\) algorithm for determining
 if a given \\(\{1, 2, . . . , n\}\\)-matrix is a valid weaving pattern
 for a matrix to be a valid weaving pattern have the potential
 to lead to substantial improvements in the upper bound.
+This dataset is a mixture of enriched weaving patterns and
+non-weaving pattern matrices with \\(\{1, 2, \dots, 6\}\\)-entries.
 ## Dataset Details
 Each matrix is stored on a single line in row-major format. For instance,
+`[ 5, 4, 3, 2, 1, 6, 2, 3, 4, 1, 6, 2, 3, 5, 1, 6, 2, 4, 5, 1, 6, 3, 4, 5, 1, 6, 5, 4, 3, 2 ]`.
+Labels are `0` (not a weaving pattern) and `1` (a weaving pattern).
 Data loaders can be found [here](https://github.com/pnnl/ML4AlgComb/tree/master/weaving_patterns).
 **Statistics**
 | Train | 634 | 1,116 |
 | Test  | 275 | 467 |
+This dataset is small, we encourage users to also look at our dataset of weaving patterns of size \\(7 \times 6\\).
+**Math question:** Find necessary or sufficient conditions to distinguish between
+weaving pattern matrices and non-weaving pattern matrices. These should be more efficient than the
 \\(O(n^2\\) algorithm that can be found in the references above.
+**ML task:** Train a model to classify whether a \\(\{1, 2, . . . , 6\}\\)-
 matrix is a weaving pattern or not. This task is framed as
 binary classification. Extract mathematical insights from a performant model.
 ## Small model performance
 We provide some basic baselines for this task. Benchmarking details can be found in the associated paper.
 ### Dataset Sources
+Data generation scripts can be found [here](https://github.com/pnnl/ML4AlgComb/tree/master/weaving_patterns).
 - **Repository:** [ACD Repo](https://github.com/pnnl/ML4AlgComb/tree/master/weaving_patterns)
 ## Dataset Structure
+Each matrix is stored on a single line in row-major format (see example above).
 ## Dataset Creation