The odd quotients of even A in characteristic two (Appendix B) #
characteristic-two-mesh-calculations.tex: "For the odd quotient of A_{2n} with
period r, … If r ≤ 2n − 1, retain the first (r+1)/2 levels. The top paths of the
resulting even-A tree have degree r, go to reflected vertices, and increase the
repetition coordinate by r. They are nonzero radical endomorphisms at every quotient
object. Thus r > 2n − 1. A path from τv to v starts and ends at the same level and
has degree d ≡ 2 modulo r, whereas d ≤ 2n − 1 < r. Again no degree at least three
is possible."
This file: the second part (a_even_long). A row of degree m + 1 ≥ 3 lifts to a path
of length 2 + n r ≥ 2 + r > 2n, which vanishes in Π(A_{2n}) (ASort.long_mem);
in characteristic two the all-one coefficients are the signed ones, so it gives the
zero class (phiL_eq_zero_of_mem).
Odd quotients of A_{2n} with period at least 2n: in characteristic two the
derivatives are surjective.
Short periods: deletion to a middle interval #
not_brick_star_to with an arbitrary retained base vertex.
The shifted interval #
The embedding of a shorter line as an interval, shifting depths by off.
Instances For
Odd quotients of A_{2n} with period at most 2n − 1 contradict the brick
hypothesis (any characteristic).
Odd quotients of even A in characteristic two, under the brick hypothesis: the
derivatives are surjective.