back to table · edit · history · where entries came from · files · download
3148 bytes, as of the version from 2026-11-18 12:45 (current). Recorded here, not run.
# Argument selection for T751
The quantity is dimensionless effective resistance in the infinite homogeneous
nearest-neighbour graph; the network parameter names the object. SC, BCC and
FCC share this quantity and cubic displacement symmetry. None is an additional
quantity selector. Graphs with additional cube-edge bonds, anisotropy, spectral
parameters, and other lattice bases are outside the table.
The natural domain is every distinct endpoint orbit: lattice in {sc,bcc,fcc},
l>=m>=n>=0, l>0, with all coordinates of equal parity for BCC and even sum for
FCC. There is no continuous coupling. The common edge resistance is divided
out rather than varied independently. Integer coordinates index vertices in
the explicitly declared frame; they do not represent a sampling mesh.
All four free parameters have category discrete_index. The lattice parameter
selects three genuine cubic Bravais graph topologies. Each coordinate is a
joint discrete displacement index constrained by graph membership and signed
permutation symmetry. Every coordinate's range is justified by the same complete
graph ball; the parameters are not independently multiplied Cartesian grids.
The finite practical choice is every nonzero orbit at graph distance <=6:
22 SC, 29 BCC, 36 FCC, totalling 87. Distances are l+m+n, l, and
max(l,(l+m+n)/2), restricted to the respective vertex domains. Direct BFS of
the actual edge sets checks these formulas and the exhaustive orbit selection.
This gives complete directional shells (axes, diagonals, asymmetric sites)
across all three topologies before extending a single direction. Six is a
noncanonical reference extent, not an intrinsic constant or a corpus quota.
It is independent of numeral base and does not claim an application for every
site. No exploratory continuous arguments are disguised as discrete indices.
Enumeration order is increasing graph distance, then sc,bcc,fcc, then
lexicographic (l,m,n). Generator, Programs and completeness note use precisely
this finite selection. The origin has resistance zero but is excluded because
source and sink coincide. It is a proof seed, not a searchable entry.
Checked supporting sources: Cserti (2000), sections II and II.D and equation
(9), for the physical Green-function resistance construction and simple cubic
network; Glasser--Boersma (2000), equations (1),(16),(26) for the three cubic
coordinate conventions; Asad et al., arXiv:1302.4376, section 2 for BCC parity,
and arXiv:1206.0226, section III for FCC parity. The normalization is independently
derived from the Laplacian and Foster trace in method.md. Older Morita/Joyce
recurrence papers were not available locally and are not claimed as checked
implementations. The new exact recurrence follows directly from these Fourier
definitions and is proved and executed in method.md and derive.py.
This is the builder's justification, not an independent argument-review verdict.
The controller must obtain fresh scientific and argument-selection critiques.
Skill manifest: ../20261118T114154Z-build-skills/manifest.json, bundle SHA-256
d6e85d49873fac5bc748d068b0288cf242b0f9aebf3a9a0fff70295019227420.