Update README.md
Browse files
README.md
CHANGED
@@ -49,40 +49,38 @@ In all cases the characters are heavily concentrated around 0 with very long tai
|
|
49 |
### Statistics for the three datasets, \\(n = 18,20,22\\)
|
50 |
|
51 |
**Characters of \\(S_{18}\\)**
|
52 |
-
|
53 |
| | Number of instances |
|
54 |
|----------|----------|
|
55 |
| Train | 118,580 |
|
56 |
| Test | 29,645 |
|
57 |
-
|
58 |
Maximum character value 16,336,320, minimum character value -1,223,040.
|
59 |
|
60 |
**Characters of \\(S_{20}\\)**
|
61 |
-
|
62 |
| | Size |
|
63 |
|----------|----------|
|
64 |
| Train | 298,661 |
|
65 |
| Test | 74,819 |
|
66 |
-
|
67 |
Maximum character value 249,420,600, minimum character value -17,592,960.
|
68 |
|
69 |
**Characters of \\(S_{22}\\)**
|
70 |
-
|
71 |
| | Size |
|
72 |
|----------|----------|
|
73 |
| Train | 763,109 |
|
74 |
| Test | 190,726 |
|
75 |
-
|
76 |
Maximum character value 5,462,865,408, minimum character value -279,734,796.
|
77 |
|
78 |
**Math question (solved):** The [Murnaghan–Nakayama rule](https://en.wikipedia.org/wiki/Murnaghan–Nakayama_rule) is an example of an algorithm for calculating the character of an irreducible representation of the symmetric group using only elementary operations on the corresponding pair of partitions.
|
79 |
|
80 |
-
**ML task:** Train a model that can take two partitions of \\(n\\), \\(\lambda\\) and \\(\mu\\),
|
|
|
81 |
|
82 |
-
If a successful model is trained, it would be interesting to understand whether the model has
|
|
|
83 |
|
84 |
## Small model performance
|
85 |
|
|
|
|
|
86 |
| Size | Linear regression | MLP | Transformer | Guessing training label mean |
|
87 |
|----------|----------|-----------|------------|------------|
|
88 |
| \\(n= 18\\) | \\(1.5920 \times 10^{10}\\) | \\(2.7447 \times 10^{8} \pm 8.8602 \times 10^8\\) | \\(2.4913 \times 10^{10} \pm 1.4350 \times 10^7\\)| \\(1.5920 \times 10^{10}\\) |
|
@@ -100,90 +98,53 @@ The \\(\pm\\) signs indicate 95% confidence intervals from random weight initial
|
|
100 |
|
101 |
The dataset was generated using [SageMath](https://www.sagemath.org/). Data generation scripts can be found [here](https://github.com/pnnl/ML4AlgComb/tree/master/symmetric_group_character).
|
102 |
|
103 |
-
- **Repository:** [
|
104 |
-
|
105 |
-
- **Demo [optional]:** [More Information Needed]
|
106 |
-
|
107 |
## Uses
|
108 |
|
109 |
-
This dataset was generated to study ML
|
110 |
irreducible representations of the symmetric group.
|
111 |
|
112 |
### Direct Use
|
113 |
|
114 |
-
|
115 |
-
|
116 |
-
|
117 |
|
118 |
### Out-of-Scope Use
|
119 |
|
120 |
-
|
121 |
-
|
122 |
-
[More Information Needed]
|
123 |
|
124 |
## Dataset Structure
|
125 |
|
126 |
-
|
127 |
-
|
128 |
-
[More Information Needed]
|
129 |
-
|
130 |
-
## Dataset Creation
|
131 |
-
|
132 |
-
### Curation Rationale
|
133 |
-
|
134 |
-
<!-- Motivation for the creation of this dataset. -->
|
135 |
|
136 |
-
[
|
137 |
|
138 |
-
|
139 |
|
140 |
-
|
141 |
|
142 |
-
|
|
|
|
|
143 |
|
144 |
-
|
145 |
|
146 |
-
|
|
|
|
|
|
|
147 |
|
148 |
#### Who are the source data producers?
|
149 |
|
150 |
-
|
151 |
-
|
152 |
-
[More Information Needed]
|
153 |
-
|
154 |
-
### Annotations [optional]
|
155 |
-
|
156 |
-
<!-- If the dataset contains annotations which are not part of the initial data collection, use this section to describe them. -->
|
157 |
-
|
158 |
-
#### Annotation process
|
159 |
-
|
160 |
-
<!-- This section describes the annotation process such as annotation tools used in the process, the amount of data annotated, annotation guidelines provided to the annotators, interannotator statistics, annotation validation, etc. -->
|
161 |
-
|
162 |
-
[More Information Needed]
|
163 |
-
|
164 |
-
#### Who are the annotators?
|
165 |
-
|
166 |
-
<!-- This section describes the people or systems who created the annotations. -->
|
167 |
-
|
168 |
-
[More Information Needed]
|
169 |
-
|
170 |
-
#### Personal and Sensitive Information
|
171 |
-
|
172 |
-
<!-- State whether the dataset contains data that might be considered personal, sensitive, or private (e.g., data that reveals addresses, uniquely identifiable names or aliases, racial or ethnic origins, sexual orientations, religious beliefs, political opinions, financial or health data, etc.). If efforts were made to anonymize the data, describe the anonymization process. -->
|
173 |
-
|
174 |
-
[More Information Needed]
|
175 |
|
176 |
## Bias, Risks, and Limitations
|
177 |
|
178 |
-
|
179 |
-
|
180 |
-
[More Information Needed]
|
181 |
-
|
182 |
-
### Recommendations
|
183 |
-
|
184 |
-
<!-- This section is meant to convey recommendations with respect to the bias, risk, and technical limitations. -->
|
185 |
-
|
186 |
-
Users should be made aware of the risks, biases and limitations of the dataset. More information needed for further recommendations.
|
187 |
|
188 |
## Citation
|
189 |
|
@@ -202,16 +163,6 @@ Users should be made aware of the risks, biases and limitations of the dataset.
|
|
202 |
|
203 |
Chau, H., Jenne, H., Brown, D., He, J., Raugas, M., Billey, S., & Kvinge, H. (2025). Machine learning meets algebraic combinatorics: A suite of datasets capturing research-level conjecturing ability in pure mathematics. arXiv preprint arXiv:2503.06366.
|
204 |
|
205 |
-
## Glossary [optional]
|
206 |
-
|
207 |
-
<!-- If relevant, include terms and calculations in this section that can help readers understand the dataset or dataset card. -->
|
208 |
-
|
209 |
-
[More Information Needed]
|
210 |
-
|
211 |
-
## More Information [optional]
|
212 |
-
|
213 |
-
[More Information Needed]
|
214 |
-
|
215 |
## Dataset Card Contact
|
216 |
|
217 |
Henry Kvinge, acdbenchdataset@gmail.com
|
|
|
49 |
### Statistics for the three datasets, \\(n = 18,20,22\\)
|
50 |
|
51 |
**Characters of \\(S_{18}\\)**
|
|
|
52 |
| | Number of instances |
|
53 |
|----------|----------|
|
54 |
| Train | 118,580 |
|
55 |
| Test | 29,645 |
|
|
|
56 |
Maximum character value 16,336,320, minimum character value -1,223,040.
|
57 |
|
58 |
**Characters of \\(S_{20}\\)**
|
|
|
59 |
| | Size |
|
60 |
|----------|----------|
|
61 |
| Train | 298,661 |
|
62 |
| Test | 74,819 |
|
|
|
63 |
Maximum character value 249,420,600, minimum character value -17,592,960.
|
64 |
|
65 |
**Characters of \\(S_{22}\\)**
|
|
|
66 |
| | Size |
|
67 |
|----------|----------|
|
68 |
| Train | 763,109 |
|
69 |
| Test | 190,726 |
|
|
|
70 |
Maximum character value 5,462,865,408, minimum character value -279,734,796.
|
71 |
|
72 |
**Math question (solved):** The [Murnaghan–Nakayama rule](https://en.wikipedia.org/wiki/Murnaghan–Nakayama_rule) is an example of an algorithm for calculating the character of an irreducible representation of the symmetric group using only elementary operations on the corresponding pair of partitions.
|
73 |
|
74 |
+
**ML task:** Train a model that can take two partitions of \\(n\\), \\(\lambda\\) and \\(\mu\\),
|
75 |
+
and predict the corresponding character \\(\chi^{\lambda}_{\mu}\\).
|
76 |
|
77 |
+
If a successful model is trained, it would be interesting to understand whether the model has
|
78 |
+
learned an existing algorithm or whether it has discovered something new.
|
79 |
|
80 |
## Small model performance
|
81 |
|
82 |
+
We provide some basic baselines for this task framed as regression. Benchmarking details can be found in the associated paper.
|
83 |
+
|
84 |
| Size | Linear regression | MLP | Transformer | Guessing training label mean |
|
85 |
|----------|----------|-----------|------------|------------|
|
86 |
| \\(n= 18\\) | \\(1.5920 \times 10^{10}\\) | \\(2.7447 \times 10^{8} \pm 8.8602 \times 10^8\\) | \\(2.4913 \times 10^{10} \pm 1.4350 \times 10^7\\)| \\(1.5920 \times 10^{10}\\) |
|
|
|
98 |
|
99 |
The dataset was generated using [SageMath](https://www.sagemath.org/). Data generation scripts can be found [here](https://github.com/pnnl/ML4AlgComb/tree/master/symmetric_group_character).
|
100 |
|
101 |
+
- **Repository:** [ACD Repo](https://github.com/pnnl/ML4AlgComb/tree/master/symmetric_group_character)
|
102 |
+
|
|
|
|
|
103 |
## Uses
|
104 |
|
105 |
+
This dataset was generated to study ML model's ability to calculate the characters of
|
106 |
irreducible representations of the symmetric group.
|
107 |
|
108 |
### Direct Use
|
109 |
|
110 |
+
There are a range of tasks that could be performed using this dataset. The one we consider here is
|
111 |
+
regression of characters from the two integer partitions that index it. That is, given \\(\lambda\\)
|
112 |
+
and \\(\mu\\), predict the corresponding character \\(\chi^{\lambda}_{\mu}\\).
|
113 |
|
114 |
### Out-of-Scope Use
|
115 |
|
116 |
+
None.
|
|
|
|
|
117 |
|
118 |
## Dataset Structure
|
119 |
|
120 |
+
Within each file, two integer partitions are provided followed by an integer
|
121 |
+
corresponding to the character. For instance, the line
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
122 |
|
123 |
+
`[3,1,1],[2,2,1],-2`
|
124 |
|
125 |
+
says that the character \\(\chi^{3,1,1}_{2,2,1} = −2\\).
|
126 |
|
127 |
+
## Dataset Creation
|
128 |
|
129 |
+
The dataset was generated using [SageMath](https://www.sagemath.org/).
|
130 |
+
Data generation scripts can be found
|
131 |
+
[here](https://github.com/pnnl/ML4AlgComb/tree/master/symmetric_group_character).
|
132 |
|
133 |
+
### Curation Rationale
|
134 |
|
135 |
+
The dataset was generated because the discovery of algorithms that calculate
|
136 |
+
the characters of irreducible representations of the symmetric group was a breakthrough
|
137 |
+
in algebraic combinatorics and thus it is interesting if ML systems can re-discover this
|
138 |
+
result.
|
139 |
|
140 |
#### Who are the source data producers?
|
141 |
|
142 |
+
Henry Kvinge used [SageMath](https://www.sagemath.org/) to generate this dataset.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
143 |
|
144 |
## Bias, Risks, and Limitations
|
145 |
|
146 |
+
We only provide characters for \\(n = 18,20,22\\). These characters exist for any \\(n > 0\\).
|
147 |
+
We are happy to generate additional datasets upon request.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
148 |
|
149 |
## Citation
|
150 |
|
|
|
163 |
|
164 |
Chau, H., Jenne, H., Brown, D., He, J., Raugas, M., Billey, S., & Kvinge, H. (2025). Machine learning meets algebraic combinatorics: A suite of datasets capturing research-level conjecturing ability in pure mathematics. arXiv preprint arXiv:2503.06366.
|
165 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
166 |
## Dataset Card Contact
|
167 |
|
168 |
Henry Kvinge, acdbenchdataset@gmail.com
|