Files
math-research/papers
didericis 92f5efc3f1 coloring_nested_tire_graphs: notation cleanup pass
Define previously-implicit objects and unify conventions:
- define level sets L_d (and L_{<d}, L_{>=d}) in the Levels definition
- factor G'_d, F_{C'}, V_{C'}, R_{C'} into a standalone definition
  before Prop 1.6, removing the forward reference
- name the annular faces F_ann and state the tire-graph tuple form
  T = (B_out, O, E_ann) in the tire-graph definition
- ground the full tire dual D(T) where Gamma is introduced
- normalize tree superscripts (0)/(p)/(c) to the tire-symbol form
  (T_0)/(T_p)/(T_c)
- resolve the boundary-count clash: use nu = |V(B_in)| (inner) and
  mu = |V(B_out)| (outer) throughout, freeing n for |V(G)|

Co-Authored-By: Claude Opus 4.8 <noreply@anthropic.com>
2026-05-29 23:38:12 -04:00
..