Related papers: Splittings and robustness for the Heine-Borel theo…
We study a natural measurable selection problem for which the standard uniformisation theorems do not seem to apply directly, yet a Borel selector exists. More precisely, we consider families of finite dimensional functions that admit…
We prove, for stably computably enumerable formal systems, direct analogues of the first and second incompleteness theorems of G\"odel. A typical stably computably enumerable set is the set of Diophantine equations with no integer…
In this paper, we consider the problem of making distributionally robust, skeptical inferences for the multi-label problem, or more generally for Boolean vectors. By distributionally robust, we mean that we consider a set of possible…
Non-Hermitian but ${\cal PT}-$symmetric quantum system of an $N-$plet of bosons described by the three-parametric Bose-Hubbard Hamiltonian $H(\gamma,v,c)$ is picked up, in its special exceptional-point limit $c \to 0$ and $\gamma \to v$, as…
The history of computability theory and and the history of analysis are surprisingly intertwined since the beginning of the twentieth century. For one, \'Emil Borel discussed his ideas on computable real number functions in his introduction…
The main result is the following. Let $f \colon X \rightarrow Y$ be a continuous mapping of a completely Baire space $X$ onto a hereditary weakly Preiss-Simon regular space $Y$ such that the image of every open subset of $X$ is a resolvable…
We seek to develop a Bures (minimal monotone/statistical distinguishability) metric-based series of formulas for the moments of probability distributions over the determinants $|\rho|$ and $|\rho^{PT}|$ of $4 \times 4$ density matrices,…
We study the uniform computational content of the Vitali Covering Theorem for intervals using the tool of Weihrauch reducibility. We show that a more detailed picture emerges than what a related study by Giusto, Brown, and Simpson has…
Semi-unification is the combination of first-order unification and first-order matching. The undecidability of semi-unification has been proven by Kfoury, Tiuryn, and Urzyczyn in the 1990s by Turing reduction from Turing machine immortality…
The linear complexity and the $k$-error linear complexity of a binary sequence are important security measures for key stream strength. By studying binary sequences with the minimum Hamming weight, a new tool named as hypercube theory is…
The logic of bunched implications (BI), introduced by O'Hearn and Pym (1999), has attracted significant attention due to its elegant proof calculus, varied semantics, and close connections to the propositional fragment of separation logic.…
Hamiltonian Monte Carlo (HMC) is a Markov chain Monte Carlo method that allows to sample high dimensional probability measures. It relies on the integration of the Hamiltonian dynamics to propose a move which is then accepted or rejected…
In view of the Segal construction each category with a coherent operation gives rise to a cohomology theory. Similarly each open stable differential relation $R$ imposed on smooth maps of manifolds determines cohomology theories $k^*$ and…
We investigate singularly perturbed nonlinear complex differential systems of the form $\hbar \partial_x f = F (x, \hbar, f)$ where $\hbar$ is a small complex perturbation parameter. Under a geometric assumption on the eigenvalues of the…
The notion of computability closure has been introduced for proving the termination of the combination of higher-order rewriting and beta-reduction. It is also used for strengthening the higher-order recursive path ordering. In the present…
For a 0-dimensional scheme $\mathbb{X}$ in $\mathbb{P}^n$ over a perfect field $K$, we first embed the homogeneous coordinate ring $R$ into its truncated integral closure $\widetilde{R}$. Then we use the corresponding map from the module of…
Hohenberg-Kohn (HK) theorem is a cornerstone of modern electronic structure calculations. For interacting electrons, given that the internal part of the Hamiltonian ($\hat H_{int}$), containing the kinetic energy and Couloumb interaction of…
Continuous-time reinforcement learning offers an appealing formalism for describing control problems in which the passage of time is not naturally divided into discrete increments. Here we consider the problem of predicting the distribution…
We give, for each countable ordinal $\xi \geq 1$, an example of a ${\bf\Delta}^0_2$ countable union of Borel rectangles that cannot be decomposed into countably many ${\bf\Pi}^0_\xi$ rectangles. In fact, we provide a graph of a partial…
Let $p(t)$ be an admissible Hilbert polynomial in $\PP^n$ of degree $d$. The Hilbert scheme $\hilb^n_p(t)$ can be realized as a closed subscheme of a suitable Grassmannian $ \mathbb G$, hence it could be globally defined by homogeneous…