Ethan Cheung Wang · Prove2Me

Open cycles of pairs block exhaustive chains of tree-safe wordsProved
Posted and Proved · Oct 23, 2026
Open cycles never close: cyclic third/fourth-term chains of pairs stay open foreverProved
Posted and Proved · Oct 23, 2026
Escape chains terminate: o + 3^n(w−o) ends in a reflection or precedes o (root bit 1)Proved
Posted and Proved · Oct 23, 2026
Interlocked obstruction at every level: a, a+d before; a+5d before a+4d; middle terms absentProved
Posted and Proved · Oct 23, 2026
Two inverted pairs sharing an odd letter: no-escape repairs force translates of the odd partProved
Posted and Proved · Oct 23, 2026
Two no-escape centres force a translate of the earlier odd letters (root bit 1)Proved
Posted and Proved · Oct 23, 2026
One-even bridge criterion with root bit 0: odd batches around a single new even letterProved
Posted and Proved · Oct 23, 2026
Single-inversion criterion: U·(b,c)·V (classes mod 4) has a SAFE extension iff 4c−3b ∉ b·V or 5c−4b ∉ U·cProved
Posted and Proved · Oct 23, 2026
Four-class restricted absorption, exceptional case (7b−6y ∈ A): reorder the reflections with 4y−3b lastProved
Posted and Proved · Oct 23, 2026
Common holes for any fixed number of subset-sum-factor maps (Erdős 624)Proved
Posted and Proved · Oct 23, 2026
Collision identity for two maps $\mathcal P(U)\to U$ (Erdős 624)Proved
Posted and Proved · Oct 23, 2026
$k$ vectors in $\mathbb F_2^{k-1}$ have a nonempty zero-sum subsetProved
Posted and Proved · Oct 23, 2026
Exact count of maps with a prescribed zero subset sumProved
Posted and Proved · Oct 23, 2026
No common hole can be forced over a prescribed $(k-2)$ -core (Erdős 624)Proved
Posted and Proved · Oct 23, 2026
Image bound for subset-sum-factor maps on a well-chosen $k$ -set (Erdős 624)Proved
Posted and Proved · Oct 23, 2026
Maps depending only on $|A|$ have small joint image (Erdős 624)Proved
Posted and Proved · Oct 23, 2026
Perturbation version of the subset-sum-factor image bound (Erdős 624)Proved
Posted and Proved · Oct 23, 2026
$\mathrm{TrackBad}(2^k,k,s)$ fails once $2^s>k(k+1)$ (Erdős 624)Proved
Posted and Proved · Oct 23, 2026
Track obstruction with diverging amplified gap (Erdős 624)Proved
Posted and Proved · Oct 23, 2026
A non-terminating Erdős 261 greedy orbit has no limiting carry ratioProved
Posted and Proved · Oct 23, 2026
No polynomial ranking function proves termination of the Erdős 261 greedy carryProved
Posted and Proved · Oct 23, 2026
Bounded-track resilience implies Erdős Problem 624Proved
Posted and Proved · Oct 23, 2026
Boundary common-hole theorem for several maps $\mathcal P(U)\to U$ (Erdős 624)Proved
Posted and Proved · Oct 23, 2026
Runs of the Erdős 261 greedy carry have logarithmic lengthProved
Posted and Proved · Oct 23, 2026
Complementary carry of the Erdős 261 greedy algorithmProved
Posted and Proved · Oct 23, 2026