This paper uses ergodic theory to study statistical properties of smooth sequences over the odd alphabet {1,3}, defining a notion of type for those sequences and proving unique ergodicity for subshift…

This paper generalizes the Phoa principle in synthetic domain theory to transfinite cases, introduces sobriomorphisms, and proposes a hypothetical completeness theorem.

This paper introduces the concept of 'large' zeros in linear recurrence sequences and establishes that they either do not exist or are very sparse, which could lead to decidability of the Skolem Probl…

This paper identifies a technical oversight in Mossel and Peres (2005) theorem on designing Bernoulli factories for multivariable functions and provides a counterexample.

The paper introduces lazy Streett supermartingales and their lexicographic extension to certify almost-sure satisfaction of omega-regular properties with polynomial templates under a broad class of sa…

This paper proves that testing the equivalence of finite closure systems specified by implicational and intersection methods is coNP-complete.

The paper proves that the reversible elementary second order cellular automaton rule 115 is periodic when started on finite initial configurations.

The paper provides a constructive, intuitionistically valid proof of Rice's Theorem and the Halting Problem undecidability by reducing the problem to the undecidability of Hilbert's Tenth Problem (MRD…

The paper investigates the relationship between optimal proof systems and recursive jump operators, showing that while the existence of a jump operator rules out optimality, the converse is provably h…

The paper shows that syntactic separation implies computational indistinguishability in local syntactic systems, proving new derivation-length and cryptographic bounds.

This paper shows that finite unions of intersecting affine modules in one dimension are efficiently exactly learnable using equivalence and subset queries.

This paper introduces a new way to represent finite posets as subwords of finite words in categories, and characterizes the monic categories that admit this representation.

This paper unconditionally proves the Orthogonal Vectors and Monotone Orthogonal Vectors conjectures in concrete computational models, and provides stronger lower bounds for Boolean formulas and branc…

This paper proves that the satisfiability problem of existential Presburger arithmetic extended with divisibility predicates (EPAD) is PP-hard.

The paper introduces a new term expansion for a calculus with explicit substitutions, allowing the relation of a lambda-calculus with explicit substitutions to Boudol's resource aware lambda-calculus.

This paper provides a focused, preparatory introduction to sheaves and topoi, establishing the necessary structural background to understand the advanced sheaf-theoretic framework used in cryptographi…