Related papers: Bar recursion is not computable via iteration
Several classes of DNR functions are characterized in terms of Kolmogorov complexity. In particular, a set of natural numbers A can wtt-compute a DNR function iff there is a nontrivial recursive lower bound on the Kolmogorov complexity of…
A recursion operator is constructed for a new integrable system of coupled Korteweg - de Vries equations by the method of gauge-invariant description of zero-curvature representations. This second-order recursion operator is characterized…
It is shown explicitly that the correlation functions of Conformal Field Theories (CFT) with the logarithmic operators are invariant under the differential realization of Borel subalgebra of $\W_\infty$-algebra. This algebra is constructed…
By the sometimes so-called MAIN THEOREM of Recursive Analysis, every computable real function is necessarily continuous. Weihrauch and Zheng (TCS'2000), Brattka (MLQ'2005), and Ziegler (ToCS'2006) have considered different relaxed notions…
We extend the theory of topological recursion by considering Airy structures whose partition functions are highest weight vectors of particular $\mathcal{W}$-algebra representations. Such highest weight vectors arise as partition functions…
Harer and Zagier proved a recursion to enumerate gluings of a $2d$-gon that result in an orientable genus $g$ surface, in their work on Euler characteristics of moduli spaces of curves. Analogous results have been discovered for other…
Structural recursion is a common technique used by programmers in modern languages and is taught to introductory computer science students. But what about its dual, structural corecursion? Structural corecursion is an elegant technique,…
Recently a strong connection has been shown between the tractability of integer programming (IP) with bounded coefficients on the one side and the structure of its constraint matrix on the other side. To that end, integer linear programming…
The elementary arithmetic operations $+,\cdot,\le$ on integers are well-known to be computable in the weak complexity class $\mathrm{TC}^0$, and it is a basic question what properties of these operations can be proved using only…
This paper studies the limits of recursive classifications in proof theory and program extraction, using the refined $A$-translation as a central example. The refined $A$-translation, due to Berger, Buchholz, and Schwichtenberg, is based on…
Reversible computing is motivated by both pragmatic and foundational considerations arising from a variety of disciplines. We take a particular path through the development of reversible computation, emphasizing compositional reversible…
Many theorems of mathematics have the form that for a certain problem, e.g. a differential equation or polynomial (in)equality, there exists a solution. The sequential version then states that for a sequence of problems, there is a sequence…
Cantor's first set theory paper (1874) establishes the uncountability of $\mathbb{R}$. We study this most basic mathematical fact formulated in the language of higher-order arithmetic. In particular, we investigate the logical and…
We prove Wigner-Eckart theorem for the irreducible tensor operators for arbitrary Hopf algebras, provided that tensor product of their irreducible representation is completely reducible. The proof is based on the properties of the…
A decomposition of a higher order linear differential operator with polynomial coefficients into a direct sum of two factor operators is obtained. This leads to a lower echelon matrix representation for operators of the above mentioned type…
We investigate the computational properties of basic mathematical notions pertaining to $\mathbb{R}\rightarrow \mathbb{R}$-functions and subsets of $\mathbb{R}$, like finiteness, countability, (absolute) continuity, bounded variation,…
We estimate the Boolean complexity of multiplication of structured matrices by a vector and the solution of nonsingular linear systems of equations with these matrices. We study four basic most popular classes, that is, Toeplitz, Hankel,…
We study a fine hierarchy of Borel-piecewise continuous functions, especially, between closed-piecewise continuity and $G_\delta$-piecewise continuity. Our aim is to understand how a priority argument in computability theory is connected to…
Kontsevich and Soibelman reformulated and slightly generalised the topological recursion of math-ph/0702045, seeing it as a quantization of certain quadratic Lagrangians in $T^*V$ for some vector space $V$. KS topological recursion is a…
We present a fully abstract model of a call-by-value language with higher-order functions, recursion and natural numbers, as an exponential ideal in a topos. Our model is inspired by the fully abstract models of O'Hearn, Riecke and…