back to table · edit · history · where entries came from · files · download
3588 bytes, as of the version from 2026-11-18 23:06 (current). Recorded here, not run.
# Argument selection: K3-type Frobenius polynomials
Quantity: P_(A,z,p)(T)=det(1-T Frob_p | H_(A,z)), on the standard rank-three, weight-two rational hypergeometric motive, with geometric Frobenius and no added Tate or quadratic twist. This is one quantity on four classified global templates, not a collection of trace/determinant variants. The lower arithmetic residues are (0,0,0).
The natural ordered parameters are template (Symbolic), z (Q), p (Z). The mathematical z domain is Q minus {0,1}. Write z=u/v reduced with v>0 and d=lcm(A); p is any prime not dividing d*u*v*(u-v). Singular, tame and wild local factors are outside this table's definition.
- template: discrete index. All four degree-three cyclotomic numerators without Phi_1 occur: Phi_2^3, Phi_2 Phi_3, Phi_2 Phi_4, Phi_2 Phi_6, permanently keyed 2.2.2, 2.3, 2.4, 2.6 in that order. The denominator is Phi_1^3. Totient-degree enumeration and RRV Section 5, completely separated MUM case, (5.2), establish completeness of this template roster and Hodge vector (1,1,1). This does not classify all K3 motives.
- z: reference_sample, openly noncanonical. For recognition of simple rational motives with controlled bad primes, take every rational z=u/v with z and 1-z in Z[1/6]^*, max(|u|,v)<=9. This selects exactly -8,-3,-2,-1,-1/2,-1/3,-1/8,1/9,1/4,1/3,1/2,2/3,3/4,8/9,9/8,4/3,3/2,2,3,4,9. The arithmetic condition controls the possible bad primes uniformly to {2,3}; the choice of prime set and height nine is a bounded reference policy rather than a theorem of demand. The list includes seven fibres in each real regime z<0, 0<z<1, z>1 and the full sixfold fractional-linear orbits of seeds 1/2,1/3,1/4,1/9. Exact bounded enumeration will be checked independently. No unbounded S-unit classification is claimed. RRV Section 10 and PARI Motives/Reduction substantiate the reduction criterion, not an application for every fibre. The finite selection is independent of decimal spelling and numeral base. Useful breadth across all four templates and three regimes precedes larger heights.
- p: discrete reduction index. Include every prime 5<=p<=13, hence 5,7,11,13, for every selected smooth fibre and every template. The practical bound reaches all unit residue classes modulo 12 (5,7,11,1), so both split and nonsplit arithmetic regimes of all four denominators occur. The maximum third-trace checking field is 13^3=2197. This cutoff controls checking cost, not entry count. It is not every good prime <=13: individually good primes at 3 are not enumerated.
There are 4*21*4=336 entries. Enumeration, Programs and the completeness note must agree. complete=no preserves the infinite mathematical domain. The arithmetic slice is shared with the analytic companion to identify the same (template,z) objects, without treating its values as verification of these polynomials.
Checked source leads: RRV arXiv:2109.00027v1 Sections 5,8,10,11; BCM arXiv:1505.02900v2 Definition 1.1, Theorem 1.3 and Assumption 1.4; Watkins Section 11.1.1; Sage hypergeometric_motive introduction and euler_factor; PARI Hypergeometric Motives Templates and Motives. The source passages and live discovery are recorded in research.md and source-manifest.json. Independent critique must reassess this policy; this file is a builder justification, not an independent acceptance.
Skill archive: agents/runs/20261118T224539Z-build-skills/manifest.json. Core SHA-256 b79b7fbc9fa3ce63f2d642cccdac12b0d214757ab01db66c03a2d84264a58e5f; complete matching local/live bundle SHA-256 b5c3c7985b7c9e178b4899d083a9e3bc4284989dff76f05e5b0e52835d47eed2.