Maryia Kapytka | Searcharxiv

arXiv2026

Lower Bounds on Inverse Cellular Automata via Proof Complexity

We study the complexity of inverse cellular automata on configurations of bounded size. Deciding injectivity in this setting is co-NP-complete by a theorem of Durand. We give a simpler proof of this theorem by a direct reduction from UNSAT to this problem, avoiding more complicated intermediate constructions. We also show that one direction of the reduction can be formalized in the weak theory of bounded arithmetic $V^0$. Durand's coNP-completeness result allows one to view inverse cellular automata acting on bounded size configurations as propositional proofs, cf. Cavagnetto, and we prove lower bounds on their size. The proof uses known lower bounds for bounded-depth Frege systems together with the Paris--Wilkie translation of arithmetic proofs into propositional proofs, which allows us to transfer proof complexity lower bounds to our setting.

math.LO↗

arXiv2024

Multisorted Boolean Clones Determined by Binary Relations up to Minion Homomorphisms

We describe the ordering of a class of clones by minion homomorphisms, also known as minor preserving maps or height 1 clone homomorphisms. The class consists of all clones on finite sets determined by binary relations whose projections to both coordinates have at most two elements. This class can be alternatively described up to minion homomorphisms as the class of multisorted Boolean clones determined by binary relations. We also introduce and apply the concept of a minion core which provides canonical representatives for equivalence classes of clones, more generally minions, on finite sets.

math.CO↗