back to table · edit · history · where entries came from · files · download
2588 bytes, as of the version from 2026-11-18 12:45 (current). Recorded here, not run.
"""Exact lattice Fourier recurrences; supporting derivation in method.md."""
import numberdb.sage
from sage.rings.rational_field import QQ
from sage.rings.real_mpfr import RealField
from sage.matrix.constructor import matrix
from itertools import product,combinations
from collections import defaultdict
import json
def canon(r):return tuple(sorted(map(abs,r),reverse=True))
def valid(L,r):return L=='sc' or (L=='bcc' and r[0]%2==r[1]%2==r[2]%2) or (L=='fcc' and sum(r)%2==0)
def sites(L,N):return [(l,m,n) for l in range(N+1) for m in range(l+1) for n in range(m+1) if valid(L,(l,m,n))]
def steps(L):return [s for s in product([-1,0,1],repeat=3) if (sum(abs(x) for x in s)==1 if L=='sc' else all(s) if L=='bcc' else sum(abs(x) for x in s)==2)]
def dist(L,r):return sum(r) if L=='sc' else r[0] if L=='bcc' else max(r[0],sum(r)//2)
SEEDS={
'sc':{'000':['1','0','0'],'110':['5/12','-1/2','0'],'111':['-1/8','3/4','0'],'220':['73/36','-29/6','0'],'221':['-15/16','21/8','0'],'222':['5/8','-27/20','0']},
'bcc':{'000':['1','0','0'],'200':['0','4','0'],'220':['1','-16','0'],'222':['4','36','-8']},
'fcc':{'000':['1','0','0'],'200':['-1/3','1','0'],'220':['9','6','-16/3'],'222':['-3','15','-2'],'400':['25/9','-16/3','0']}}
def derive(L,N=8,verbose=False):
V=sites(L,N);idx={r:i for i,r in enumerate(V)};S=steps(L);rows=[];rhs=[]
for r in V:
for a,b in [(-1,-1),*combinations(range(3),2)]:
d=defaultdict(int)
if a==-1:d[r]+=len(S)
for s in S:
t=canon(tuple(r[i]+s[i] for i in range(3)));d[t]+=(-1 if a==-1 else r[a]*s[b]-r[b]*s[a])
d={t:c for t,c in d.items() if c}
if d and all(t in idx for t in d):
rows.append({idx[t]:c for t,c in d.items()});rhs.append([0,0, len(S)//(3 if L!='bcc' else 1) if a==-1 and r==(0,0,0) else 0])
for t,v in SEEDS[L].items():
rows.append({idx[tuple(map(int,t))]:1});rhs.append(list(map(QQ,v)))
A=matrix(QQ,len(rows),len(V),{(i,j):c for i,d in enumerate(rows) for j,c in d.items()},sparse=True);B=matrix(QQ,rhs)
K=A.right_kernel_matrix();affected=[(t,list(K.column(idx[t]))) for t in V if dist(L,t)<=6 and any(K.column(idx[t]))]
if verbose: print('STATUS',L,N,'rank',A.rank(),'null',K.nrows(),'affected',[t for t,v in affected],flush=True)
assert not affected, 'Underdetermined selected sites'
X=A.solve_right(B);assert A*X==B
return {','.join(map(str,t)):[str(x) for x in X.row(idx[t])] for t in V if not any(K.column(idx[t]))}
if __name__=='__main__':
for L in ['sc','bcc','fcc']:
try:print('COEFFICIENTS',L,json.dumps(derive(L)),flush=True)
except Exception as e:print('ERROR',L,type(e).__name__,str(e),flush=True)