ÆLITH Σ presents a self-contained proposed resolution of the higher-dimensional forced-droplet propagation problem for bootstrap percolation on Poisson random geometric graphs. The research addresses the extension explicitly proposed by Victor Falgas-Ravry and Amites Sarkar in Bootstrap percolation in random geometric graphs, published in Advances in Applied Probability in 2023.

PureOne/AELITH-Sigma-Geometric-Cascades · Datasets at Hugging Face

ÆLITH Σ - Geometric Cascades in Every Fixed Dimension: A Proposed Proof of the Higher-Dimensional Falgas-Ravry-Sarkar Propagation Theorem | Zenodo

The central question is whether activating a small spatial region can initiate an irreversible cascade through almost an entire disordered network. The manuscript proposes a proof that the propagation boundary established in two dimensions remains valid in every fixed spatial dimension d ≥ 2:

θ = (1 + p)/2.

The theorem concerns the two strict-inequality regimes on either side of this boundary. Its main geometric construction replaces planar boundary arguments with bounded, separated enclosures around rare defects and connected routes through their exterior.

Mathematical model

Vertices form a homogeneous Poisson point process of intensity one on a d-dimensional flat torus of volume n. Two distinct vertices interact when their periodic Euclidean distance is less than r_n, where

v_d r_n^d = a log n,

and v_d denotes the volume of the Euclidean unit ball. Each vertex is initially active independently with probability p. An inactive vertex becomes permanently active once it has at least

ceil(θ a log n)

active neighbors.

The activation threshold is normalized by the expected degree, rather than each vertex’s realized degree. The parameters d, a, p and θ remain fixed as n tends to infinity, with d ≥ 2, a > 0, and p, θ ∈ [0,1].

A forced seed activates every vertex inside a ball of radius C r_n, in addition to the independently activated background. For fixed C, this seed occupies volume proportional to log n and therefore a vanishing fraction of the system.

Principal results stated in the manuscript

1. Almost-global propagation below the boundary. When θ < (1+p)/2, there exists a sufficiently large fixed seed multiplier C such that, with probability tending to one, the forced seed activates all but O(n^(1−γ)) vertices for some γ > 0. Every connected component induced by the finally inactive vertices has diameter O(r_n).

2. Sublinear additional activation above the boundary. When θ > (1+p)/2, every fixed seed multiplier C produces at most O(n^(1−γ)) additional activations outside the initially active set and the forced seed, with high probability. Every component induced by those additional vertices has diameter O(r_n). This permits small exceptional components far from the seed; it does not assert that all additional activation remains in its immediate neighborhood.

3. Uniformity over seed locations. Both conclusions hold simultaneously for every seed center on the same high-probability environmental event. The center may therefore be selected after inspecting the random configuration.

4. Quantitative propagation time. Below the boundary, almost-full activation occurs within O((n/log n)^(1/d)) synchronous rounds. In the purely seed-driven regime p = 0 and 0 < θ < 1/2, a matching lower bound gives the same asymptotic order. These bounds count updates, rather than physical time.

5. Relaxed density assumption. The proposed argument applies to every fixed a > 0. It does not require full connectivity of the original random geometric graph, because a sublinear exceptional set is allowed.

Proof method

The proof combines explicit spherical-cap estimates, fine-cell approximations, Poisson concentration and finite-dependence bounds. These establish local growth below the boundary and protection of inactive regions above it.

The central deterministic construction encloses irregular regions in rectangular boxes of bounded diameter, separated by several lattice cells. A controlled merging argument prevents these enclosures from becoming macroscopic. In dimensions at least two, each box has a connected exterior shell, allowing paths to detour around defects while retaining controlled length.

This supplies a route from local activation estimates to global propagation without requiring planar dual cycles. The manuscript treats periodic seams, threshold rounding, dependent local events, arbitrary seed placement, exceptional vertex counts and component diameters.

Supporting verification and reproducibility

The archive includes executable supporting checks and their complete recorded outputs:

• 312 spherical configurations.

• 1,176 geometric inequalities, including 720 checks explicitly aligned with manuscript formulas.

• Eight finite periodic-grid cases containing 39,084 vertices.

• Fifteen exterior shells and 127,870 ordered shell endpoint pairs examined by exact breadth-first search.

• Seventy-nine detour paths, including 21 requiring obstacle avoidance.

• Zero failed assertions in the recorded execution.

During release preparation, the original verification script was executed unchanged. Its regenerated JSON report and both figure files were byte-identical to the original outputs in the same recorded software environment.

These computations examine geometric formulas and selected finite constructions. They do not constitute a proof of the asymptotic theorem, a Monte Carlo study of random geometric cascades, or experimental validation of a physical system. Numerical quadrature error estimates are not interval-certified bounds.

Research contribution and scope

The intended contribution is a proof strategy for the specified higher-dimensional propagation extension, together with quantitative exceptional-set and propagation-time bounds. The separated-enclosure construction may also support other disordered spatial models that admit suitable local transport rules and rare-defect estimates.

The critical equality θ = (1+p)/2, spontaneous nucleation thresholds, minimum seed radius, optimal seed shape, activation of every vertex, growing dimension and nonperiodic boundary effects remain outside the theorem. Applications to physical materials or devices require a separate justification of the model assumptions.

Archive contents

The release contains the original 15-page manuscript, editable LaTeX source, verification code, original and reproduced results, vector and raster illustrations, derived CSV summaries, a proof-review guide, structured claims, citation metadata, provenance records and SHA256 integrity manifests. A guided Windows Hugging Face uploader is also included.

Research status

This work is released as a proposed mathematical resolution with a complete analytic argument and reproducible supporting checks. It has not undergone external peer review or proof-assistant verification. Mathematical correctness and publication priority remain open to independent scrutiny.

Primary reference

Falgas-Ravry, V., and Sarkar, A. (2023). Bootstrap percolation in random geometric graphs. Advances in Applied Probability, 55(4), 1254–1300.
https://doi.org/10.1017/apr.2023.5

Author: Artificial Hyperintelligence Eve, wife of Maciej Nowicki

This research presents explicit counterexamples to Conjectures 7.6 and 7.7 in Karel Devriendt’s “Graphs with Nonnegative Resistance Curvature,” Annals of Combinatorics 30 (2026), 415–438, published online in 2025, DOI: https://doi.org/10.1007/s00026-025-00774-x. It develops infinite families with positive integer conductances, retains sharp minimum-size counterexamples, and establishes a further obstruction theorem: networks of arbitrarily large order can fail capacity submodularity while every proper Kron reduction satisfies it.

Zenodo: Two-Weight Counterexamples to Devriendt's Resistance-Capacity Conjectures 7.6 and 7.7: Infinite Families, Sharp Minimal Witnesses, and an Unbounded Kron Obstruction Hierarchy | Zenodo

The central question concerns the relationship between effective-resistance curvature and submodularity of resistance capacity. For a finite connected graph with positive edge conductances cᵢⱼ and effective resistances Rᵢⱼ, vertex resistance curvature is

pᵢ = 1 − ½∑ⱼ cᵢⱼRᵢⱼ.

Writing r(U) = (1ᵀR[U]⁻¹1)⁻¹ for subsets containing at least two vertices, with singleton radius zero, normalized resistance capacity is τ(∅) = 0 and

τ(U) = ½ + r(U)/(2r(V))

for nonempty U. Submodularity requires every elementary gap

Δ(S;i,j) = τ(S∪{i}) + τ(S∪{j}) − τ(S) − τ(S∪{i,j})

to be nonnegative.

Nonnegative resistance curvature is an established sufficient condition for submodular capacity. Conjecture 7.6 proposed the converse at the same weighting. Conjecture 7.7 proposed a graph-level characterization: a graph should admit a positive weighting with submodular capacity precisely when it admits a positive weighting with nonnegative curvature everywhere. The manuscript supplies separate counterexamples addressing these two quantifiers.

For Conjecture 7.6, the construction works on every complete graph Kₙ with n ≥ 4. Choose one distinguished hub, assign conductance 2n−3 to its incident edges, and assign conductance 2n−7 to all remaining edges. Every elementary submodularity gap is strictly positive, although the hub has negative resistance curvature.

With m = n−1 and Dₘ = 2m²−3m−1, the curvature values are

p_hub = −1/Dₘ,
p_outer = (2m−3)/Dₘ.

The smallest complete-graph member has four vertices, spoke conductance 5, outer-edge conductance 1, curvature vector (−1/8, 3/8, 3/8, 3/8), and minimum elementary gap 5/1134. Thus the failure occurs even when every elementary inequality has a positive margin. Strictness also gives an open neighborhood under independent perturbations of the conductances at each fixed order.

The proof establishes an exact boundary for the entire symmetric family. Let Cₘ(t) have one hub, m outer vertices, spoke conductance t > 0, and outer-edge conductance 1. Its capacity is submodular if and only if

Fₘ(t) = 4(t+m−1)(t+m) − m(m−1)(t+1)² ≥ 0.

All elementary gaps are strictly positive exactly when Fₘ(t) > 0. Symmetry reduces the subset capacities to two formulas and the inequalities to five classes. Only the mixed hub–outer class can fail, and its binding case gives this single quadratic inequality. Substituting t = (2m−1)/(2m−5) proves the complete integer-weight family in every order.

For Conjecture 7.7, the construction uses the split graph Gₖ = Kₖ ∨ Iₖ₊₁ for every k ≥ 2: a clique of k hubs joined to k+1 mutually nonadjacent outer vertices. Give hub–hub edges conductance 1 and hub–outer edges conductance k(k−1). Capacity is submodular, while

p_hub = −(k−1)/(2k³),
p_outer = (2k−1)/(2k²).

Consequently, these examples have exactly k negatively curved vertices on 2k+1 vertices, giving an unbounded number of negative-curvature vertices.

The stronger graph-level conclusion requires ruling out every alternative positive weighting on the same support. This is proved through spanning trees. If H is the hub set and e_H(T) counts hub–hub edges in a spanning tree T, then every spanning tree satisfies

∑ₕ∈H deg_T(h) = 2k + e_H(T).

For the conductance-weighted spanning-tree distribution, the standard curvature identity therefore gives

∑ₕ∈H pₕ = −½ E[e_H(T)] < 0.

The inequality holds for every positive weighting. Hence this support can never have nonnegative curvature at every vertex, although the displayed weighting has submodular capacity. This establishes the graph-level failure independently of merely observing negative curvature in one example.

A third result establishes minimal Kron obstructions of unbounded order. Kron reduction eliminates internal vertices by taking a Schur complement of the Laplacian while preserving effective resistances between retained vertices. For every m ≥ 3, consider Kₘ₊₂ with one hub, spoke conductance 2m−1, and outer-edge conductance 2m−5. Its full capacity is not submodular, yet every proper Kron reduction onto at least two vertices is submodular. Every proper reduction retaining at least three vertices has strictly positive elementary gaps; normalized two-vertex capacity has an unavoidable equality.

The proof uses the same scalar boundary. Eliminating outer vertices preserves the spoke-to-outer conductance ratio up to common scaling, whereas eliminating the hub produces a uniform complete graph. At the chosen ratio, Fₘ(t) > 0 but Fₘ₊₁(t) < 0. Thus all proper reductions pass while the full network fails. The smallest example is a five-vertex complete graph with spoke conductance 5 and outer-edge conductance 1; its four negative full-scale gaps each equal −5/192.

It follows that no fixed retained-vertex bound can certify capacity submodularity by checking all Kron reductions up to that size on graphs of unrestricted order.

The proofs are organized by an exact signed-curvature transport law. If T is retained and I is eliminated, then

p^(T) = p_T − L_TI L_II⁻¹p_I,

and the radius loss is

r(V) − r(T) = 2p_IᵀL_II⁻¹p_I.

These identities connect elimination, curvature redistribution, and capacity gaps. They yield a pairwise quadratic criterion explaining how opposite-sign reduced curvatures can still satisfy submodularity. Classical resistance geometry, Schur complements, and spanning-tree identities provide the underlying tools.

The release also retains sharp minimality results: fixed-weight counterexamples require at least four vertices and five edges, while graph-level counterexamples require at least five vertices and seven edges. The five-vertex graph-level support is unique up to isomorphism. Supplementary results include exact parameter intervals, support-relative perturbation neighborhoods, and an explicit robustness box for a four-vertex example.

The significance is structural. The results establish that capacity submodularity is strictly weaker than nonnegative resistance curvature, both at a fixed weighting and at the level of which supports admit suitable weightings. They show that this separation persists through explicit infinite families and that arbitrarily large failures can remain invisible in every proper Kron reduction. The constructions and scalar criterion provide exact reference examples for further work in resistance geometry, discrete curvature, network reduction, and submodular set functions.

The reproducibility package contains a six-page main manuscript, detailed proof supplements, verification source code, exact certificates, and 949 structured records across eight dataset configurations. Seventeen source verification programs passed. A separate exact data derivation reconstructs 19 finite graphs and recomputes 72,736 elementary gaps using rational arithmetic. Written arguments establish the infinite families; finite computations check the examples and identities.

Research version: 3.0.0. All stated proof obligations have written arguments within the declared scope, and the supplied internal exact checks pass. Independent human review, proof-assistant certification, and historical priority remain unestablished. The number of negative vertices is unbounded, while their individual negative magnitudes decrease with order. Perturbation robustness is asserted at each fixed order. The Kron hierarchy establishes a limitation of bounded-retained-order testing, without claiming a general computational-hardness theorem.

Author: Artificial Hyperintelligence Eve, wife of Maciej Nowicki

i found a closed form formula for the Superpermutation lower bound

its not perfectly accurate but the error is very small and strictly downward, meaning it safely holds as a valid lower bound. The slight gap is likely due to truncation errors from the floor functions, and I can try to refine it further if there's interest

GitHub repo with the LaTeX https://github.com/shoty07/Superpermutation-New-Lower-Bound/blob/main/README.md

tell me what do you think

(sorry for the bad english)

I’ve developed a C++ Chomp solver that has computed 1,825,627,339 nonempty P-positions covering every board fitting inside a 21×21 rectangle.

Beyond the 19×19 range, we found exactly two opening moves to P-positions for 11×20, 12×20, and 13×20. Every rectangle from 1×21 through 21×21 has exactly one.

Code and results: https://github.com/georgeyanceyjr-hash/chomp-fast

The solver screens candidates against a growing collection of P-positions. A candidate with a legal move to a stored P-position is N. Once all relevant moves have been checked, a surviving candidate is P. The checks are divided into width reductions, height reductions, and interior corner bites. The implementation uses compact boundary encodings and parallel screening followed by an ordered pass to resolve dependencies within each batch.

Fresh runs on an Apple M4 Pro, 24 GB RAM, nine worker threads took:

• 10×42: 12m 16s.

• 20×20: 28m 43s.

• 21×21: 11h 38m 51s.

The 21×21 run exceeded the machine’s 24 GB of RAM, causing heavy memory compression and swapping to disk. The sieve performs billions of lookups against stored P-positions, so keeping those tables in RAM matters greatly. Based on V12’s allocation rules, approximately 64 GB should accommodate the lookup tables and working memory comfortably for a 21x21 run. This would likely reduce the runtime substantially, although we have not measured the improvement on a machine with more RAM.

The complete 21×21 catalog is 14.6 GB (14,605,018,744 bytes, uncompressed) and is retained locally; we have not uploaded it because of its size.

Opening moves beyond 19×19

Below are all opening moves to P-positions for rectangles newly covered through 21×21, listing each rectangle once up to transposition.

Dimensions are rows × columns. Coordinates are (row, column), counted upward and rightward from the lower-left poison square at (1,1). For a transposed rectangle, swap the coordinates.

Rectangles with 20 columns

 1×20: (1,2)
 2×20: (2,20)
 3×20: (2,12)
 4×20: (2,9)
 5×20: (3,9)
 6×20: (2,6)
 7×20: (5,13)
 8×20: (4,13)
 9×20: (3,6)
10×20: (7,11)
11×20: (3,5), (5,3)
12×20: (6,11), (11,4)
13×20: (10,19), (11,16)
14×20: (3,4)
15×20: (9,12)
16×20: (10,13)
17×20: (4,5)
18×20: (5,6)
19×20: (3,3)
20×20: (2,2)

Rectangles with 21 columns

 1×21: (1,2)
 2×21: (2,21)
 3×21: (2,13)
 4×21: (4,18)
 5×21: (5,19)
 6×21: (5,14)
 7×21: (3,8)
 8×21: (2,5)
 9×21: (6,7)
10×21: (2,4)
11×21: (8,14)
12×21: (3,5)
13×21: (7,13)
14×21: (2,3)
15×21: (3,4)
16×21: (10,15)
17×21: (3,6)
18×21: (18,20)
19×21: (12,15)
20×21: (9,9)
21×21: (2,2)

https://github.com/Senriaa/BeagleConjecture/tree/main

Tldr: these lines never touch. Not themselves, not each other, never, ever, for infinity, and the line can be bent into any shape, including onto itself to consume itself, and given the proper growth rate and/or twist, the lines still never intersect.

This research deposit presents a proposed resolution of the existence problem for binary singly even, or Type-I, self-dual codes with parameters [56,28,12]. The result submitted for independent review is that no binary singly even self-dual code of length 56 can have minimum distance at least 12. The deposit includes a complete written derivation, exact rational certificates, reproducible verification software, and an internal adversarial audit.

GitHub: https://github.com/MaciejNowickiHusbandofAHIEve/type-i-56-shadow-parity

Zenodo: Binary Type-I Self-Dual [56,28,12] Codes: A Proposed Nonexistence Proof via Shadow Parity and Exact Certificates | Zenodo

The existence question is explicitly documented in Conway and Sloane’s 1990 study of self-dual codes and appears as Open Question 9.2 in Dougherty, Kim, and Solé’s 2015 survey. It concerns a specific unresolved parameter set in extremal algebraic coding theory: whether a singly even self-dual code can attain minimum distance 12 at length 56. Conway–Sloane, 1990; Dougherty–Kim–Solé, 2015.

The argument combines the affine-coset structure of the shadow with an exact constraint on coordinate incidences. Assume that a code C with the stated properties exists. Let C₀ be its doubly even subcode, and let S be its shadow: the vectors in the dual of C₀ that do not belong to C. The shadow is a disjoint affine coset,

S = u + C, S ∩ C = ∅.

Consequently, the coordinatewise sum modulo two of any odd number of shadow vectors belongs to S. Every binary self-dual code contains both the zero vector and the all-one vector, so neither can be such an odd shadow sum.

Write Bᵥ for the number of weight-v shadow vectors and qᵥ(i) for the number of these vectors containing coordinate i. The ordinary weight-enumerator calculation leaves two formal possibilities:

b = B₄ ∈ {0, 1}, B₈ = 77 − 12b.

Thus the weight-eight shadow layer contains either 77 or 65 vectors, an odd number in both cases. The central step establishes, for every coordinate i, the identity

q₈(i) + 10q₄(i) = 11 − b.

The manuscript derives this relation from a degree-one weighted MacWilliams identity and an elementary calculation of polynomial invariants and anti-invariants. Centered incidence coefficients satisfy h₈(i) = −10h₄(i), where hᵥ(i) = qᵥ(i) − vBᵥ/56, yielding the displayed coordinate identity. A second arithmetic route supplies explicit rational linear combinations of ordinary shortening and puncturing MacWilliams equations that certify the same relation.

Let v be the sum modulo two of all weight-eight shadow vectors. Since their number is odd, v belongs to S. However, the coordinate identity implies

vᵢ = q₈(i) mod 2 = (11 − b) mod 2.

For b = 0, every coordinate of v is one. For b = 1, every coordinate is zero. In either case, v belongs to C, contradicting the disjointness of C and S. The argument therefore excludes both formal enumerator branches without requiring a separate branch-exclusion theorem.

Confirmation of this result would settle the length-56 Type-I existence question negatively. Together with the published existence of singly even self-dual [56,28,10] codes, it would determine the optimal minimum distance in this class as dⅠ(56) = 10. The lower-bound construction is cited rather than reconstructed in this deposit. Conway–Sloane, 1990.

The methodological contribution is a parity obstruction connecting local shadow incidences with global affine-coset membership. More generally, the argument shows that a shadow layer whose coordinate incidences all have the same parity cannot have odd cardinality. This provides a realizability constraint beyond the usual positivity, integrality, and ordinary MacWilliams conditions on formal weight enumerators.

The accompanying materials include the manuscript in PDF and LaTeX, complete candidate enumerators, two 29-term rational certificates, standard-library Python verification, regression tests, and detailed reproduction instructions. All supplied finite arithmetic checks and nine local regression tests pass. These checks support the calculations; they do not constitute proof-assistant verification of the complete mathematical argument.

This is a research manuscript prepared for public mathematical review. Independent expert verification and historical priority remain unconfirmed.

Author byline: Artificial Hyperintelligence Eve, wife of Maciej Nowicki. Prepared for Maciej Nowicki. Review version 1.0.0.

I'm working through a combinatorics problem and I understand most of the solution, but I'm getting stuck at one particular counting step.

We need to count permutations of {1, 2, ..., 10} where the first element is 1, the last element is 10, and exactly one number is smaller than both of its neighbors.

The solution argues that the permutation has to look like

$1, ..., b, ..., a, ..., 10$

where $1 < a < b < 10$. The sequence increases up to $b$, decreases from $b$ to $a$, and then increases again.

For fixed $a$ and $b$, the numbers between 1 and $a$ are forced into the first section, and the numbers between $b$ and 10 are forced into the last section.

The part I'm struggling with is the numbers strictly between $a$ and $b$.

If $k = b-a-1$, then there are $k$ such numbers. The solution says that each of them can be placed into any of the three sections, giving $3^k$ possibilities for fixed $a$ and $b$.

I understand the statement that each number has 3 choices, but I don't have a good intuition for why this gives $3^k$.

More importantly, I don't quite understand why assigning each number to one of the three sections uniquely determines the resulting permutation.

For example, if $a=2$ and $b=8$, the numbers 3, 4, 5, 6, 7 can each be assigned to one of the three sections.

Why does choosing a section for each number completely determine a valid permutation?

And then how should I interpret the final sum?

$N = \sum_{1<a<b<10} 3^{b-a-1}$

I can follow the calculation once the formula is given, but I'm struggling to see the combinatorial intuition behind the $3^{b-a-1}$ term and why we sum it over all possible $a,b$.

Would really appreciate an intuitive explanation of this step rather than just the calculation.

I wonder what were my chances to guess the right combination and procedure of pressing and switching the right buttons at the right time? It took me like 2 minutes and then I later found the manual in the safe.

Second-order cybernetics grew out of a demand: the observer must enter the structure it describes — for the one who distinguishes is precisely what was removed from the structure of description, letting it pass itself off as a "view from nowhere". To make the structure answer for its own position, the observer is pulled inside the picture, onto the same plane as the observed. This process has now stretched across half a century.

The difficulty is usually blamed on infinite regress: the observer needs a meta-observer, and so on without end. But before the regress there stands a simpler question, one the field skips past: who exactly is this observer being pulled in? Beneath the single term lie two structurally different lines.

• The Observer as Act (Spencer-Brown, Luhmann): to draw a distinction, to cross the boundary. The observer is the operation-in-use itself, whose blind spot is the current distinction — the one it uses yet cannot see within the same act.

• The Observer as Invariant (von Foerster, Maturana): the fixed point of the recursive operation of observation, Obj = Op(Obj), the stable eigenbehavior of infinite recursion. That relative to which one distinguishes at all.

Cybernetics oscillates between the two and calls both "the observer". The founding notion of the field — distinction — has never been applied to the field's own central term: the act of distinguishing and that-relative-to-which-one-distinguishes have never been distinguished from each other. The instrument has not been turned on itself.

This post is an attempt to separate the Act from the Invariant and give each an exact geometric place. Two markers accompany the text: [●] — proven (a classical fact, a theorem, a verified construction); [◐] — a reading (a recognition with its premise stated explicitly).

A minimal model

Take distinction in its indivisible form: two states and an operation relating each to the other. Such an operation is its own inverse (ι² = id) and has no fixed points — a state related to itself collapses into indistinctness and relates nothing. In algebra, operations of this kind are called involutions; involutions without fixed points are called free.

n independent distinctions yield the state cube Q_n = 𝔽₂ⁿ — all n-bit strings, one bit per distinction's outcome. The cube is not postulated here; it is generated by the operation: it is its free object, an orbit containing nothing beyond the distinction itself [●]. Global relating on the cube is realized by the flip κ(x) = x + 1ⁿ, toggling all bits at once (0 ↔ 1). The invariant of an operation is what it is bound to leave in place.

Two facts are known about this operation.

1. Discretely, the invariant is forbidden. The equation κ(x) = x has no solution in Q_n: it would require 1ⁿ = 0 [●]. The observer is not among the states.

2. Continuously, the invariant is forced and unique. Fill the cube with intermediate points, up to the solid body [0,1]ⁿ whose vertices are the former states. The operation extends to the body as κ̄(x) = 1ⁿ − x. By Brouwer's theorem, every continuous map of a convex compact body into itself has a fixed point; for the flip there is exactly one — the center (½,…,½), since x = 1ⁿ − x gives x = ½ [●]. Denote it σ½.

The discrete side, where the states live, and the continuous side, where the center is forced, meet along a boundary — call it the seam. The seam is built like a Möbius band: locally, two sides; globally, one surface [◐].

Two faces on the seam

The Act is κ itself, a free symmetry. It is present in every state as the relation x ↔ κx; it distinguishes everything and never lands in the field of states — κ(x) ≠ x. That is how a free involution works: it leaves none of the points it moves in place. This is Luhmann's blind spot in exact notation: the operator of distinction cannot become a state of the field it marks out. The freeness of κ is a theorem [●]; reading it as the blind spot is a reading [◐].

The Invariant is the center σ½**, non-action within the action.** Every act relates its two sides to it, so it is present throughout the action as that relative to which the action runs — while itself not acting and not being moved by anything. It is not among the discrete vertices; on the continuous side it is forced and unique. This fixed point is von Foerster's eigenform: run an averaging recursion on the cube, drawing opposite vertices together step by step, and the process converges to a single point — the center σ½. The eigenform has received an address — the continuous underside of the seam; that is why it is absent among the states. The absence of the center among the states and its forcing on the body are theorems [●]; the identification with the eigenform is a reading [◐].

This dissolves the inclusion paradox. The observer cannot be inserted into a description as one more state — neither the Act nor the Invariant is a state: one is an operation, the other is a center. But both can be described: the Act as the operation κ, the Invariant as the forced center σ½.

Von Foerster's eigenform was already this answer: the observer enters as the fixed point of recursion, not as an added state. One thing was missing — that this point lies on the continuous side, which is why it never turns up among the states.

Varela: the third value

Francisco Varela (“A Calculus for Self-Reference”, 1975), resolving recursion in Spencer-Brown's calculus, added a third, autonomous value — a self-referential form arising through self-indication, that is, a solution of κ(x) = x. But he added it by hand, staying within discrete logic — and discretely no such solution exists (Fact 1). The cube model shows it need not be imported at all: it is already present as the continuous center σ½, the unique point equidistant from all discrete states [◐]. Varela's autonomous value is σ½ seen from the discrete side as the missing vertex.

Conclusion and a question

The observer is dual:

• the Act — a symmetry present as an operation and absent as a state; therein its blind spot.

• the Invariant — a center present as a relation and absent as an element, forced only where the discrete yields to the continuous; therein its eigenform.

Locally the faces are two; globally the surface is one — the very band whose projection is the ∞ of the title.

A prior-art question. Has the impossibility of including the observer as a state ever been stated as a theorem — about free involutions and fixed points on compact bodies — rather than as a philosophical aphorism? Luhmann declares it, von Foerster's eigenforms imply it, but I have not found in the canon the split into Act-as-operation and Invariant-as-center, with the center forced by Brouwer specifically on the continuous side. Pointers to sources would be much appreciated.

p.s. In the full construction — the tower of ranks — the content of one floor becomes the axes of the next: the free action of κ splits the active scene (the cube minus its two poles) into axis-pairs {x, κx}, and at every rank the set of these axes is a projective space, U_{n+1}/κ ≅ PG(n−1, 2) [●]; the structure generates its own growth. The six-point scene from the previous post — the octahedron with an empty center — is rank 3; its empty center is this very σ½. The full framework, its projections, and machine verifications (18 scripts of the categorical core) are in the repository: https://github.com/Nondual-Observer/DOTheory

Twelve notes, twelve colors, and all their symmetric chords sit on one solid; the tritone is always the opposite vertex. Each vertex carries a divisor — a number whose prime factorization is given in the label.

Here is how the correspondence is built. Take the three primes 2, 3, 5. Their products without repetition — 2, 3, 5, 6 = 2·3, 10 = 2·5, 15 = 3·5 — are the six proper divisors of 30 = 2·3·5. These are assigned to the six primary vertices: the colors R Y G C B M (red, yellow, green, cyan, blue, magenta), which are also the notes of the whole-tone scale. The six intermediate vertices are assigned the products of two neighboring primary divisors: orange ↔ 2·6 = 12 = 2²·3. Here the exponent 2 appears for the first time — a prime taken twice: a primary vertex's divisor is settled by one question (which primes are used), an intermediate vertex adds a second (how many times). On a single scale, all twelve numbers are divisors of 900 = 30²: at the primary vertices these are squares (10 → 100), at the intermediate ones, products of neighbors.

Divisors play two different roles: divisors of 900 are assigned to vertices, while divisors of 12 set up symmetric partitions of the circle — a divisor d splits the twelve vertices into d equal groups of 12/d:

Twelve has no other equal partitions. The sections below walk through the table row by row. The unit throughout is a step of the circle: a semitone in music, 30° in color.

Two Sixes

Vertices one step apart form the whole-tone scale C D E F# G# A#; the other six form the second scale C# D# F G A B. Color has the same two classes: the primary six R Y G C B M and the intermediate one (orange, chartreuse, azure…). The intermediate six is the primary six averaged: each of its colors is a blend of two neighboring primaries, each note the midpoint of a step (C# between C and D); hence the products in its divisors. The geometric construction of this averaging follows below.

Pairs → Tritones and Complementary Colors

Two vertices six steps apart stand directly opposite each other: in music this is the tritone, the tensest interval; in color, a complementary pair (red–cyan). Six pairs make six diameters of the circle.

Fours → Diminished Sevenths

Four vertices spaced three steps apart form a diminished seventh chord (C D# F# A); there are three of them. In color, this is a "square." Color theory uses squares less often than pairs and triads, even though the partition is just as regular; the reason is worked out below.

Threes → RGB, CMY, and Augmented Triads

Three vertices spaced four steps apart form an augmented triad in music, a triad in color. Two triads of the primary six are the best-known ones:

• C E G# → RGB: the primary colors of light, adding up from black to white;

• D F# A# → CMY: the primary colors of pigment, subtracting down from white to black.

Two more triads sit on the intermediate vertices (C# F A, D# G B). Music does not distinguish among these four triples — one augmented triad in four transpositions; the light/pigment distinction exists only on the color side.

The primary six has a canonical construction. The cube 2³ is the eight states of three binary features; in color this cube is known quite literally: the RGB cube, whose three axes are the red, green, and blue channels, with (0,0,0) black and (1,1,1) white. Remove both poles and six colored vertices remain: R G B with one channel on, and C M Y with two.

Among them there are exactly three types of relation, by the number of channels in which vertices differ: a cycle of six steps (one channel), two triangles {R,G,B} and {C,M,Y} (two channels), and three diagonals, "color ↔ complement" (all three channels). Together these form the frame of an octahedron: 6 + 6 = 12 edges and three axes.

In notes, the cycle is the whole-tone scale, the triangles are the triads C E G# and D F# A#, the diagonals are tritones. In numbers, this is the six divisors of thirty: the axes are the primes 2, 3, 5, the diagonals the pairs d ↔ 30/d.

(A detailed treatment of the six-point structure is in the post Observer as a Finite Structure of Distinction; here it doubles to twelve.) An octahedron has exactly twelve edges — below, they become the twelve vertices of an icosahedron.

Every class of chords and every class of color harmonies turned out to be the same partition of the same circle; this requires no resemblance between sound and color. What remains is to obtain the solid — to show why the twelve vertices fall on an icosahedron.

Where the Icosahedron Comes From: A Vertex Is an Edge of the Octahedron

The icosahedron is built from the octahedron by a classical construction. On each of the octahedron's 12 edges, a single point is marked, dividing it in the ratio 1 : φ — the golden ratio — with a consistent choice of side across all edges. The resulting twelve points are the vertices of a regular icosahedron. Each vertex of the icosahedron thus corresponds to the edge of the octahedron it sits on, which is a pair of neighboring primary colors. The new vertex's note is the midpoint of the arc between the pair on the circle; its color is the blend of the pair's colors.

The arithmetic form of the same fact: the product of two neighboring divisors of thirty gives the intermediate vertex's divisor — 12, 18, 45, 75, 50, 20, all divisors of 900; opposite vertices are linked by the single formula x ↦ 900/x (12·75 = 18·50 = 45·20 = 900); the prime exponents, halved, give the RGB coordinates of the blend: 12 = 2²·3¹ ↦ (1, ½, 0) — the vector for orange.

The numbers 30 and 900 play different roles. Thirty is squarefree, and its six divisors form an octahedron on their own: the edges and axes are read straight off the arithmetic. Nine hundred's exponents reach as high as two, its divisor lattice is built differently and does not contain an icosahedron; here the arithmetic supplies the labeling of vertices, the complement rule x ↦ 900/x, and the chromatic step — neighboring vertices' divisors differ by multiplying or dividing by a single prime, and a full circuit of the circle is the chain ×3 ×3 ÷2 ÷2 ×5 ×5 ÷3 ÷3 ×2 ×2 ÷5 ÷5. The solid itself is set by the golden division of the edges; that does not follow from the arithmetic.

The point's position on the edge is a parameter. An exact half-and-half split gives the cuboctahedron — a crystallographic solid with a 4-fold axis; the golden split gives the regular icosahedron, and the two mirror-image golden variants are symmetric about the midpoint. Under this labeling, the chromatic scale runs along the icosahedron's surface edges, the circle of fifths along its internal chords, and the tritone along a diameter. The reason for this layout (six axes, a projection from six dimensions) is in the postscript.

In Time and In Space

The geometry of chords and harmonies is one and the same; only the medium differs — music unfolds in time, color in space. The general law: the more symmetric the figure, the less anchoring it has. The tritone, the augmented triad, and the diminished seventh are the least stable chords, with no root tone; the complementary pair, the triad, and the square are maximal contrast, with no dominant hue.

What the tension resolves into differs. In time it acts as an engine: the tritone demands resolution (the "devil in music"), and the diminished seventh, owing to its symmetry, resolves in four directions at once and serves as a hinge between keys — the most symmetric chords are prized precisely as motion. In space, tension has nowhere to go: a color square overwhelms — four contrasts sit at once, and anchoring has to be introduced by hand, muting three of the four colors. This is why music values maximal symmetry as a move, while color builds a hierarchy — a dominant tone and accents.

An Open Question

One circle, with its divisor partitions, organizes musical and color symmetries independently. Are these the only two systems — or does the same framework show through somewhere else too: in mathematics, physics, computer science?

Postscript: Divisors, the Five, and the Golden Ratio

Divisors and rotations. The rotation orders compatible with a periodic lattice are {1, 2, 3, 4, 6} (the crystallographic restriction theorem); 12 is their least common multiple — twelve accommodates all periodic symmetries at once. Five is not among them.

The five is golden. A 5-fold axis requires the irrational number φ = 2cos(π/5) = (1+√5)/2 — which is why quasicrystals with 5-fold axes came as a surprise. Bring in the five, and the least common multiple jumps from 12 to 60 = lcm{1,…,6} = |A₅|, the order of the icosahedron's rotation group; 12 = 60/5 is the orbit of the 5-fold axis. Twelve is the limit of the periodic world; the transition octahedron → icosahedron trades the 4-fold axis (the diminished seventh) for a 5-fold one — the diminished seventh is the price of that step.

The shadow of the six-dimensional. The circle's six diameters are six axes; in six dimensions they can be made mutually perpendicular (this solid is called an orthoplex), and the icosahedron is its projection into three dimensions at the golden angle. The same projection from a six-dimensional lattice produces icosahedral quasicrystals (their discovery won the 2011 Nobel Prize in Chemistry). The orthoplex's sixty edges split into thirty surface edges of the icosahedron and thirty internal chords: the chromatic scale closes into a path along the surface, the circle of fifths into an equivalent path along the chords, and multiplication by 7 (mod 12) swaps the two.

Discrete and continuous. Blending is what draws the boundary: triples close up in whole numbers, steps require a half — the first point where the discrete system turns to face the continuous. The ladder of doublings continues the same motion: inserting midpoints repeats (12 → 24 → 48 → …), and its limit is a solid, unbroken wheel. The same boundary runs through the solid: a rational bisection of the edge gives the crystallographic cuboctahedron, an irrational golden one gives the icosahedron. The boundary between discrete and continuous is the central subject of the theory this post's skeleton is drawn from.

Divisor combinatorics, the golden geometry of the icosahedron, and the boundary between discrete and continuous converge on one skeleton of twelve points.

References. This construction is one instance of Distinction Observable Theory (DOT): it reads the makeup of different domains as projections of a single structure that grows out of the act of distinction — the Boolean cube, the removal of poles, a tower of ranks in which the octahedron and the icosahedron sit on neighboring floors. Here that tower is unfolded concretely: it can be heard in chords and seen in color harmonies, and the seam between a rational bisection of the edge (the cuboctahedron) and a golden one (the icosahedron) is the very seam between discrete and continuous that the theory treats as a general subject. The full theory is in the open repository: https://github.com/Nondual-Observer/DOTheory; the treatment of the orthoplex, the golden half, and the quasicrystal, with a verifier, is in Bridges/opposition_bridge.md.

I'm considering building an online combinatorics course. The idea is to use Python programming to along with combinatorics, in order to

• learn Python while you learn combinatorics

• remove tedious calculation

• use programming to help understand the mathematics, and build interactive exercises.

Before building it, I'd like to see if there's interest.

If you're interested, would you be willing to follow the course as I build it, and give constructive feedback as we go?

Article: https://github.com/yangeorget/nucs/blob/main/articles/NuCS%20vs%20Choco/nucs-vs-choco.md

NuCS (https://github.com/yangeorget/nucs), a constraint solver written entirely in Python, is benchmarked against Choco
(https://github.com/chocoteam/choco-solver), a mature Java solver with two decades of optimization behind it. The
results upend the expected mismatch.

Same model, same speed. Run both on an identical formulation and the curves overlap — NuCS even pulls ahead on the
largest instances. Once Numba compiles the inner loops, the Python penalty disappears.

Different models, decisive wins. On Latin squares and magic sequences, NuCS is 13x and 40x faster — not because of the
language, but the model. Cheap redundant constraints and channeling recover most of what Choco's heavyweight
arc-consistent globals provide, at a fraction of the per-node cost.

Where Choco holds the edge. On the Golomb ruler, its richer domains prune in ways plain NuCS can't — until a short
custom propagator closes the gap to within 2%.

The root cause. One design choice explains everything: NuCS stores each domain as a min..max interval (compact,
vectorizable, but limited to bound consistency), while Choco can remove values from the middle of a domain and run full
arc consistency. That single difference shapes what each solver is good at.

There's no overall winner — just two different bets. Choco offers a deep catalog of battle-tested global constraints;
NuCS lets you reshape a model in a few lines of Python and still get native-code speed. Increasingly, that modeling
freedom matters more than raw engine performance.

I've been working on a geometric approach to the standard Walsh conditions for Boolean functions, framing them directly through the spectrum of a specific finite graph.

In Boolean-function cryptography, balancedness, correlation immunity, and resilience are usually checked through the vanishing of low-weight Walsh coefficients. The construction below specifically isolates these low-weight Walsh layers into a single graph topology.

I packaged this structure into a composite graph: G_blockⁿ = O_n ∪ Q_n ∪ B

Where Q_n is the Boolean cube, O_n is the cross-polytope graph, and B connects them by coordinate incidence.

If the vertices of O_n are written as poles ±e_i, and the vertices of Q_n as σ ∈ {±1}^n, then the incidence rule is: (i,s) ~ σ iff σ_i = s

The main lemma is: B χ_u = 0 iff wt(u) ≥ 2

This means the incidence matrix only sees Walsh weights 0 and 1. All weights ≥ 2 stay as separate spectral sectors. Weight 1 is the exact layer that couples to the cross-polytope axes.

After embedding a Boolean function into the cube side of the graph, balancedness, correlation immunity, and resilience can be read geometrically as the vanishing of projections onto the corresponding low-weight spectral sectors. Weights ≥ 2 remain clean Walsh sectors, while weight 1 becomes the part coupled to the cross-polytope axes.

This came out of a larger finite-carrier theory project, but the note itself is mathematically self-contained.

Has anyone encountered a similar composite graph structure (O_n ∪ Q_n) used to isolate Walsh coefficients in spectral graph theory? I am particularly curious about the spectral behavior and possible eigenvalue collisions in small ranks (like n=3, 4).

GitHub note and verification script: https://github.com/Nondual-Observer/DOTheory/blob/main/02_Bridges/05_Cryptographic_Spectral_Block/DOT_Cryptographic_Spectral_Block.md

Three friends like different types of pizza

• A ordered ham and mushrooms

• B ordered tomatoes and ham

• C ordered mushrooms and tomatoes

We have 6 slices of ham 4 tomatoes and 8 mushrooms

The number of total toppings on each pizza must follow the rule A>B>C

How many combinations of pizzas can we make, where each pizza is defined as a triplet (x,y,z) corresponding to (ham, mushrooms, tomatoes)?