This repository contains the numerical certificates for the explicit examples in Appendix A of the paper
Xiao-Nan Lu and Masanori Sawa, Paired Constructions and Rational Gaussian Designs, 2026.
It also contains a short, independent verifier that uses only exact arithmetic. Every certificate checked here is listed explicitly in the paper, and the verifier checks these certificates directly.
Requires Python 3.9 or later. No third-party packages are needed.
python3 verify_appendix.pyIf every check succeeds, the script prints PASS with the verification counts.
If a check fails, it prints FAIL with the reason. To list every design and
union as it is checked:
python3 verify_appendix.py --verboseThe target probability measure is
For a set
with
Verification scope:
| Source in the paper | Certificates / checks |
|---|---|
| Table 1 | 26 distinct degree-5 designs; exact moments through degree 5 |
| Table 3 | 55 distinct degree-7 designs; exact moments through degree 7 |
| Table 2 | 10 disjoint unions, including their exact moments |
| Table 4 | 6 disjoint unions, including their exact moments |
| Table 5 | 54 disjoint unions, including their exact moments |
| Proposition 4.1 | All 21 joint moment identities with |
| Proposition 5.1 | All 36 joint moment identities with |
| Theorems 1.1 and 1.2 | The complete degree-5 base interval |
For each union of two designs of orders
Coverage of the base orders is checked as follows:
- Degree 5: the initial orders 28, 32, 34 and every order from 36 to 71. The paper proves that these extend in steps of 36.
- Degree 7: every order from 55 to 128 except the 25 excluded orders listed in
Theorem 1.2. As in the paper, order 112 is supplied by Theorem 5.2 (from
$P_7$ ) rather than by an explicit example. The interval from 129 to 240 is split into 49 orders$n$ for which$n - 112$ is already covered, 9 direct examples, and 54 unions from Table 5. The paper proves that these extend in steps of 112.
Table, proposition, and theorem numbers refer to the version of the
paper that accompanies release v1.0.0 of this repository.
verify_appendix.py: the verifierdata/appendix_data.json: numerators, denominators, the point sets of Propositions 4.1 and 5.1, and the union recipesCITATION.cff: citation informationLICENSE: MIT License
Designs are referred to by their labels in the paper. For example, X28 is
H37 is X32tilde denotes
p denotes a primed alternative, so Z60p
is
data/appendix_data.json contains the following entries:
-
table_1,table_3: the designs of Tables 1 and 3. Each entry gives the order$n$ , the denominator$d$ , and the positive numerators$A$ . The design is$\mathcal{X}(A,d)$ when$n$ is even and$\mathcal{H}(A,d)$ when$n$ is odd. -
table_2_unions,table_4_unions: the unions in Tables 2 and 4, each given by its order and its two components. -
table_5_union_rules: the rows of Table 5. In each row, the designfirstis combined with each design listed inseconds. -
paired_P5,paired_P7: the integer points$D_5$ and$D_7$ and the denominators$6$ and$30$ from Propositions 4.1 and 5.1. -
seven_nonexistence_orders_N: the 25 excluded orders$\mathcal{N}$ of Theorem 1.2. -
seven_large_direct_labels: the nine designs$Z_{129}, \dots, Z_{176}$ used directly for orders between 129 and 240. -
five_data_7_design_labels: the degree-7 designs$Z_{55}$ ,$Z_{56}$ ,$Z_{59}$ ,$Z_{63}$ from Table 3, which are also used as degree-5 designs.
When referring to the examples or the certificates, please cite the paper
above. GitHub shows citation metadata from the included CITATION.cff.
The code and data in this repository are released under the MIT License.
See LICENSE for the full text.