Related papers: Feasible Proofs of Matrix Properties with Csanky's…
Linearizability is a commonly accepted notion of correctness for libraries of concurrent algorithms, and recent years have seen a number of proposals of program logics for proving it. Although these logics differ in technical details, they…
We show that time complexity analysis of higher-order functional programs can be effectively reduced to an arguably simpler (although computationally equivalent) verification problem, namely checking first-order inequalities for validity.…
Let $K$ be an infinite field of characteristic different from two and let $U_1$ be the Lie algebra of the derivations of the algebra of Laurent polynomials $K[t,t^{-1}]$. The algebra $U_1$ admits a natural $\mathbb{Z}$-grading. We provide a…
We extend Kolchin's results on linear dependence over projective varieties in the constants, to linear dependence over arbitrary complete differential varieties. We show that in this more general setting, the notion of linear dependence…
We present a formally verified framework for patent analysis as a hybrid AI + Lean 4 pipeline. The DAG-coverage core (Algorithm 1b) is fully machine-verified once bounded match scores are fixed. Freedom-to-operate, claim-construction…
We define an analogue of the Fox derivatives for differential polynomial algebras and give a criterion for differential algebraic dependence of a finite system of elements. In particular, we prove that differential algebraic dependence of a…
Abstract separation logics are a family of extensions of Hoare logic for reasoning about programs that manipulate resources such as memory locations. These logics are "abstract" because they are independent of any particular concrete…
We consider the feasibility problem of integer linear programming (ILP). We show that solutions of any ILP instance can be naturally represented by an FO-definable class of graphs. For each solution there may be many graphs representing it.…
Let k be a field of characteristic p>0, and G be a finite group. The first result of this paper is an explicit formula for the determinant of the Cartan matrix of the Mackey algebra mu_k(G) of G over k. The second one is a formula for the…
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem is either contained in one out of six classes and can be solved in…
We confront two integrability criteria for rational mappings. The first is the singularity confinement based on the requirement that every singularity, spontaneously appearing during the iteration of a mapping, disappear after some steps.…
In his famous theorem (1982), Douglas Leonard characterized the $q$-Racah polynomials and their relatives in the Askey scheme from the duality property of $Q$-polynomial distance-regular graphs. In this paper we consider a nonsymmetric (or…
We consider a hierarchy of many particle systems on the line with polynomial potentials separable in parabolic coordinates. Using the Lax representation, written in terms of $2\times 2$ matrices for the whole hierarchy, we construct the…
Proof by coupling is a classical proof technique for establishing probabilistic properties of two probabilistic processes, like stochastic dominance and rapid mixing of Markov chains. More recently, couplings have been investigated as a…
The standard definition of PAC learning (Valiant 1984) requires learners to succeed under all distributions -- even ones that are intractable to sample from. This stands in contrast to samplable PAC learning (Blum, Furst, Kearns, and Lipton…
Complex classifiers may exhibit "embarassing" failures in cases where humans can easily provide a justified classification. Avoiding such failures is obviously of key importance. In this work, we focus on one such setting, where a label is…
Algebraic independence is an advanced notion in commutative algebra that generalizes independence of linear polynomials to higher degree. Polynomials {f_1, ..., f_m} \subset \F[x_1, ..., x_n] are called algebraically independent if there is…
We generalize two main theorems of matching polynomials of undirected simple graphs, namely, real-rootedness and the Heilmann-Lieb root bound. Viewing the matching polynomial of a graph $G$ as the independence polynomial of the line graph…
Pearl and Verma developed d-separation as a widely used graphical criterion to reason about the conditional independencies that are implied by the causal structure of a Bayesian network. As acyclic ground probabilistic logic programs…
Modern statistical learning theory and deep learning characterize generalization primarily in terms of continuous capacity control (e.g., norm-based regularization, margin maximization, low-rank bias). While highly successful in continuous…