back to table · edit · history · where entries came from · files · download
3391 bytes, as of the version from 2026-11-18 08:37 (current). Recorded here, not run.
# Argument selection for T748
One ordered parameter: `k: R`, the real coefficient of
`Q_k=k-(X+X^-1)(Y+Y^-1)(Z+Z^-1)`, with mathematical domain `k>=8`.
The dimension, eight unit edge weights, minus sign and normalization per vertex
are fixed. No quantity selector, dimension or extra continuous coupling is varied.
The source's `z` equals `8/k`, and its `p` argument equals `k^2`.
The default enumeration is all exact integers 8 through 32, inclusive (25 rows).
This is mixed selection, with disjoint, exhaustive groups:
* Intrinsic: **8**, the spectral edge and BCC spanning-tree entropy.
* Documented application: **9**, mass one, giving the per-vertex log determinant
of `I+Delta`. The finite graph determinant counts unweighted spanning rooted
forests by Chebotarev–Shamis, Theorem 5. The infinite-lattice limit follows
by Fourier diagonalization and Riemann sums; it is a deduction here, not a
source claiming separately tabulated numerical values.
* Exploratory reference: **10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32**.
These are simple primitive integral Laurent polynomials with eight fixed
coefficients -1, or integral graph masses 2 through 24. The contiguous
low-height prefix reaches four times the spectral edge, giving useful
breadth for recognizing outputs of one simple massive operator. The
cutoff 32 is a noncanonical finite reference choice; no CM or individual
application claim is made for these 23 arguments. It depends on the integer
coefficient in the polynomial, independently of decimal notation.
## Reference policy for the exploratory group
```json
{
"purpose": "Identify logarithmic determinants arising from simple integral massive operators on the fixed three-dimensional BCC lattice.",
"bounds": "Every integer coefficient 10<=k<=32, equivalently masses 2<=k-8<=24, together with separately classified k=8 and k=9.",
"coverage_rationale": "A contiguous low-height prefix reaching four times the spectral edge covers each simple integral operator in this bounded slice, without a multidimensional mesh or a famous-only selection; 32 is a noncanonical reference cutoff.",
"noncanonical_acknowledged": true,
"notation_independent": true,
"sources_checked": true
}
```
Guttmann–Rogers, equations (18)–(20), (31)–(32), and the BCC elliptic
Green formula, define the pencil, normalization and edge. Chebotarev–Shamis,
section 3, Theorem 5, supplies the rooted-forest application. Source HTML is
archived as GR.html and CS.html beside this note; research.md records locators.
The builder inspected these passages; this is not an independent review verdict.
Breadth review: negative coefficients follow torus symmetry. Inside-band real
and complex coefficients require separate branch/absolute-log conventions and
are outside this proposal. Higher dimensions, nonunit edge weights and
fractional coefficient grids would change this planning boundary and are not
silently added. Neither the 25-row count nor a campaign quota determines this
selection. There is no claim of completeness for the real domain k>=8.
Default enumeration, Programs, stored identities and complete-note must all
retain the same integer range. The critic must independently evaluate this
justification, then fingerprint the live document and generate.py; no independent
argument verdict is written by the builder.