Sequenceability

Navigation page for Blueprint/D5/S3/Combinatorics/Sequenceability/ at upstream snapshot 6268c3f4d17a52fe29b4a5d6c337f1beecff2f2e.

Contents

• Charges and connectivity of original minimal zero supports
• A numerical stopping condition for arbitrary finite groups
• Near invariance forces an exact proper subgroup
• A translated ten-column relative path
• Characteristic-seven six-column detour
• Characteristic-seven complete relative path
• Disjoint minimal zero supports admit a Good ordering
• Original-label Good orders above half girth
• Quadratic carriers from affine binary points
• Seventy elements for the parameter-five cyclic carrier
• Cyclic sharpness of the finite-order component bound
• The cyclic order-seven minimum
• A universal finite abelian carrier bound
• Finite-order bounds for original support components
• Sharpness of the finite-order component bound
• Polynomial-size cyclic extremal labels
• A quadratic carrier lower bound from the original zero supports
• Quadratic carriers with a cyclic signed quotient
• Translated quotient bounds
• Uniform finite paired binomial tail
• Original C3 pair events on one circle inventory
• Explicit density of circles without opposite-pair adjacencies
• A finite uniform quantitative bound for paired C3 Good orders
• Complement pairing of residual zero blocks
• Coefficient-one zero subsets of signed C3 coordinate bases
• Positive charge determines original Boolean geometry
• Original incidence and positive component charge
• Original port incidence and directed geometry
• Original-coordinate port cycles and avoiding words
• Exact Boolean coverage descent at a private pair
• Rotational columns, two row orbits, and endpoint insertion
• A zero pair and its original complement
• Zero total connects circular arcs to actual Good intervals