#!/usr/bin/env python3 """New exact finite witnesses for position conditioning, not an arithmetic census.""" import collections import itertools import json import math import resource import sys import time from fractions import Fraction WORDS = [(6,18,6,24,12,30),(6,18,12,30,6,24),(6,24,18,6,12,30)] THRESHOLDS = [30,24,18,12,6] def score(b): g = tuple(b)+(6,)+tuple(reversed(b)) return max(g[i]+g[(i+1)%len(g)] for i in range(len(g))) def conditional(b,T): free = [i for i,v in enumerate(b) if v<=T] vals = [b[i] for i in free] out = [] for p in sorted(set(itertools.permutations(vals))): w = list(b) for i,v in zip(free,p): w[i] = v out.append(tuple(w)) return out def pair_max(b,T): # Max over words and max over edges commute. Each individual free pair can # take the two largest remaining occurrences, while a free seam doubles one. fixed = {i:v for i,v in enumerate(b) if v>T} free = sorted((v for v in b if v<=T),reverse=True) def one(i): return fixed[i] if i in fixed else free[0] terms = [2*one(0),one(len(b)-1)+6] for i in range(len(b)-1): if i not in fixed and i+1 not in fixed: terms.append(sum(free[:2])) else: terms.append(one(i)+one(i+1)) return max(terms) def frac(f): return [f.numerator,f.denominator] def summary(b,T): words = conditional(b,T) counts = collections.Counter(score(w) for w in words) n = len(words) mean = Fraction(sum(k*v for k,v in counts.items()),n) e2 = Fraction(sum(k*k*v for k,v in counts.items()),n) var = e2-mean*mean delta = score(b)-mean exactmax = pair_max(b,T) assert max(counts)==exactmax return {'threshold':T,'fixed_positions':[[i,v] for i,v in enumerate(b) if v>T], 'arrangements':n,'score_counts':[[k,counts[k]] for k in sorted(counts)], 'mean':frac(mean),'population_variance':frac(var), 'z_status':'degenerate' if var==0 else 'defined', 'z_sign':None if var==0 else (0 if delta==0 else (1 if delta>0 else -1)), 'z_squared':None if var==0 else frac(delta*delta/var), 'exact_maximum_from_sparse_map':exactmax} def main(): resource.setrlimit(resource.RLIMIT_CPU,(15,20)) t,cpu0 = time.monotonic(),time.process_time() profiles = [] for b in WORDS: profiles.append({'half_word':list(b),'full_word':list(b)+[6]+list(reversed(b)), 'A1':max(b),'A2':score(b),'period':2*sum(b)+6, 'half_counts':[[k,v] for k,v in sorted(collections.Counter(b).items())], 'profiles':[summary(b,T) for T in THRESHOLDS]}) assert all(r['A1']==30 and r['A2']==42 and r['period']==198 for r in profiles) assert all(r['half_counts']==profiles[0]['half_counts'] for r in profiles) assert len({json.dumps(r['profiles'][3]['score_counts']) for r in profiles})==3 # New multiset, distinct from return435's five-position sampler toy. all_words = sorted(set(itertools.permutations(WORDS[0]))) universal,max_checks,degenerate_cases = 0,0,0 for b in all_words: for T in [0,6,12,18,24,30]: ws = conditional(b,T);vals = [score(w) for w in ws] assert pair_max(b,T)==max(vals) max_checks += len(ws) if T