Update README.md

README.md

@@ -4,7 +4,7 @@ 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\}\\)-
+*Weaving patterns* are size \\(n \times (n−1)\\) matrices with \\(\{1, 2, \dots , n\}\\)-
 entries introduced by \[1\] to study the number of reduced decompositions of the longest
 permutation (which swaps \\(n\\) and \\(1\\), \\(n\\) - \\(1\\) and \\(2\\), etc.) up 
 to commutation equivalence. The number
@@ -16,7 +16,7 @@ exists but gives no additional insight into the structure of
 weaving patterns and correspondingly the asymptotics of
 reduced decompositions. The enumeration of reduced decompositions 
 up to commutation equivalence has been studied by many including
-Knuth and Stanley. An exact formula is likely out of reach,
+Knuth \[3\] and Stanley \[4\]. An exact formula is likely out of reach,
 so asymptotic upper and lower bounds are of great interest.
 ML models that can detect necessary or sufficient conditions
 for a matrix to be a valid weaving pattern have the potential
@@ -97,3 +97,5 @@ Henry Kvinge, acdbenchdataset@gmail.com
 
 \[1\] Felsner, Stefan. "On the number of arrangements of pseudolines." Proceedings of the twelfth annual Symposium on Computational Geometry. 1996.  
 \[2\] Chau, Herman. "On enumerating higher bruhat orders through deletion and contraction." arXiv preprint arXiv:2412.10532 (2024).
+\[3\] Knuth, Donald E., ed. Axioms and hulls. Berlin, Heidelberg: Springer Berlin Heidelberg, 1992.
+\[4\] Stanley, Richard P. "On the number of reduced decompositions of elements of Coxeter groups." European Journal of Combinatorics 5.4 (1984): 359-372.