Related papers: A Deterministic Separation Lemma
Agentic theorem provers often introduce intermediate lemmas, proof sketches, or subgoal decompositions before returning to tactic-level search. This can look like an expensive detour: if proving lemmas is itself hard, why should a learned…
Randomized higher-order computation can be seen as being captured by a lambda calculus endowed with a single algebraic operation, namely a construct for binary probabilistic choice. What matters about such computations is the probability of…
We propose a decomposition framework for the parallel optimization of the sum of a differentiable {(possibly nonconvex)} function and a nonsmooth (possibly nonseparable), convex one. The latter term is usually employed to enforce structure…
In this paper we study a very general finite Ramsey theorem, where both the sets being colored and the homogeneous set must satisfy some largeness notion. For the homogeneous set this has already been done using the notion of…
Due to the undecidability of most type-related properties of System F like type inhabitation or type checking, restricted polymorphic systems have been widely investigated (the most well-known being ML-polymorphism). In this paper we…
Introduced by Korman, Kutten, and Peleg (Distributed Computing 2005), a \emph{proof labeling scheme (PLS)} is a system dedicated to verifying that a given configuration graph satisfies a certain property. It is composed of a centralized…
In automata theory, while determinisation provides a standard route to solving many common problems in automata theory, some weak forms of nondeterminism can be dealt with in some problems without costly determinisation. For example, the…
In this article, we propose a new method for the fundamental task of testing for dependence between two groups of variables. The response densities under the null hypothesis of independence and the alternative hypothesis of dependence are…
Matching mechanisms play a central role in operations management across diverse fields including education, healthcare, and online platforms. However, experimentally comparing a new matching algorithm against a status quo presents some…
We provide an elementary proof of Y. Peres' lemma on the existence in certain dynamical systems of what we term heavy points, points whose ergodic averages consistently dominate the expected value of the ergodic averages. We also derive…
This paper establishes the existence and uniqueness of solutions for rough differential equations driven by reduced rough paths with low regularity, specifically in the roughness regime $\frac{1}{3} < \alpha \leq \frac{1}{2}$. While the…
In the binary hypothesis testing problem, it is well known that sequentiality in taking samples eradicates the trade-off between two error exponents, yet implementing the optimal test requires the knowledge of the underlying distributions,…
We consider strong external difference families (SEDFs); these are external difference families satisfying additional conditions on the patterns of external diferences that occur, and were first defined in the context of classifying optimal…
We prove a complexity dichotomy theorem for all non-negative weighted counting Constraint Satisfaction Problems (CSP). This caps a long series of important results on counting problems including unweighted and weighted graph homomorphisms…
The paper considers the claim that quantum theories with a deterministic dynamics of objects in ordinary space-time, such as Bohmian mechanics, contradict the assumption that the measurement settings can be freely chosen in the EPR…
Given a hypergraph $H$ and a weight function $w: V \rightarrow \{1, \dots, M\}$ on its vertices, we say that $w$ is isolating if there is exactly one edge of minimum weight $w(e) = \sum_{i \in e} w(i)$. The Isolation Lemma is a…
Reasoning is a fundamentally algorithmic task. Yet current work on LLM-based reasoning relies on free-form generation whose theoretical guarantees (soundness, completeness, complexity, optimality) remain poorly understood. We argue that we…
The restricted isometry property (RIP) is a well-known matrix condition that provides state-of-the-art reconstruction guarantees for compressed sensing. While random matrices are known to satisfy this property with high probability,…
Most automated verifiers for separation logic target the symbolic-heap fragment, disallowing both the magic-wand operator and the application of classical Boolean operators to spatial formulas. This is not surprising, as support for the…
At least two, different approaches to define and solve statistical models for the analysis of economic systems exist: the typical, econometric one, interpreting the Gravity Model specification as the expected link weight of an arbitrary…