Independent researcher · est. in public repositories

Finite mathematics, where every claim knows exactly how proved it is.

My name is Oleksiy Babanskyy. I am an independent researcher working in finite geometry, algebraic combinatorics and computational mathematics. My research explores symmetric groups, posets, root systems, incidence structures and centered operators, combining mathematical proofs with exact computation and reproducible certificates.

34public works
31repositories
CL0–6one ladder of proof
01

The Method

the paper behind every other paper on this page

Gate-Disciplined Computational Mathematics

Computational mathematics has a quiet failure mode: finite evidence drifts into “theorem”. This paper builds the discipline that stops it — a twelve-level claim ladder (CL0–CL6, plus blocked · open · negative · watch · metadata), five forbidden promotions, and ledgers that outrank prose.

Every work below was produced under it. Read this one first.

Repository ↗
CL0–1 observation · evidence
CL2 finite replay
CL3 certified finite result
CL4 exact theorem import
CL5 internal theorem, full proof
CL6 formally verified

A result may climb the ladder. It may never be pushed.

06

Patronage

independent means independent — including the funding

This research has no institution, no grant, and no paywall behind it. Every paper, certificate and replay script is public. If this work is useful to you — or you simply want more of it to exist — you can become a patron.

Patrons fund computing time, open-access hosting, and the slow, unfashionable work of verifying things properly.

100% Download PDF Open ↗
Download .pptx
slide