Author

Keigo Oka

2 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Sep 2026

Two-State Max-Plus Comparison Is Decidable

Effective semilinearity of context-free Parikh images then reduces comparison to Presburger arithmetic and the two-state endpoint is resolved, ensuring that two-state max-plus comparison, equivalence, and positivity are decidable.

Keigo Oka · 0 citations

Preprint Aug 2026

Breaking the $2^n$ Barrier for Counting Linear Extensions with a Short Elementary Algorithm

A deterministic exact algorithm is given that counts the linear extensions of an arbitrary $n$-element poset in time $O^*(1.89^n)$ where $O^*(\cdot)$ suppresses polynomial factors.

Keigo Oka · 0 citations