Dataset for New Results on Tripod Packings
<p>The files contain tripod packings obtained in the study "P.R.J. Östergård & A. Pöllänen, New results on tripod packings". More specifically, they prove the lower bounds in Table 5 of the paper. The two files contain sets of orbit representatives of codes and explicit packings in matrix form. For each type of symmetry, the results presented are for <span class="math-tex">\(n = 3,4,\ldots\)</span>. Codewords are of the form <span class="math-tex">\((x,y,z)\)</span>, where <span class="math-tex">\(x,y,z \in \{0,1,\ldots ,n-1\}\)</span>. The symmetries are</p> <ul> <li><span class="math-tex">\(r(x,y,z) = (z,x,y)\)</span>,</li> <li><span class="math-tex">\(p(x,y,z) = (y,x,z)\)</span>,</li> <li><span class="math-tex">\(o(x,y,z) = (n-1-x,n-1-y,n-1-z)\)</span>.</li> </ul> <p> </p>
ShareScore
40/100
Overall dataset sharing score
Score breakdown
These five areas show where the dataset supports — or may limit — practical reuse.
- Stewardship
- 8
- Harmonization
- 4
- Access
- 20
- Reuse readiness
- 8
- Engagement
- 0