Grisha Pochuev

Audited Structural Results for the Two-Player 3n ± 1 Game

This is a revised and audited version of the work originally published on 8 August 2026. The original version claimed a proof that the two-player 3n ± 1 game has no DRAW positions. Subsequent adversarial auditing revealed gaps in the global proof architecture, and that claim is t...

Polylogarithmic Genus Does Not Increase the Power of Constant-Width Polynomial-Size Circuits

Allender, Datta, and Roy claimed that constant-width polynomial-size Boolean circuits of polylogarithmic orientable genus compute exactly ACC^0. The published proof of the upper bound was later found to contain an incorrect topological assertion, and Eric Allender subsequently li...

Polylogarithmic Genus Does Not Increase the Power of Constant-Width Polynomial-Size Circuits

Allender, Datta, and Roy claimed that constant-width polynomial-size Boolean circuits of polylogarithmic orientable genus compute exactly ACC^0. The published proof of the upper bound was later found to contain an incorrect topological assertion, and Eric Allender subsequently li...

Termination under Optimal Play in the Two-Player 3n+/-1 Game

We address the two-player 3n+/-1 problem stated at https://althofer.de/collatz-prizes.html. The game is played on positive odd integers: a move replaces n > 1 by the odd part of either 3n-1 or 3n+1, and the player who reaches 1 wins. Arbitrary play need not terminate. We give a b...

Polylogarithmic Genus Does Not Increase the Power of Constant-Width Polynomial-Size Circuits: A Separator-Based Candidate Proof

ZENODO METADATA - ALLENDER POLYLOGARITHMIC GENUS PREPRINT, VERSION 1Prepared: 7 August 2026 RESOURCE TYPEPublication -> Preprint (choose "Publication" and, if the interface asks for a subtype, choose "Preprint") TITLEPolylogarithmic Genus Does Not Increase the Power of Constant-W...