Related papers: On the equivalence of two quantifier elimination t…
Given a countable transitive model of set theory and a partial order contained in it, there is a natural countable Borel equivalence relation on generic filters over the model; two are equivalent if they yield the same generic extension. We…
In this paper, we introduce the model of quantum Mealy machines and study the equivalence checking and minimisation problems of them. Two efficient algorithms are developed for checking equivalence of two states in the same machine and for…
We undertake a comprehensive study of measure equivalence between general locally compact, second countable groups, providing operator algebraic and ergodic theoretic reformulations, and complete the classification of amenable groups within…
In mutation testing the question whether a mutant is equivalent to its program is important in order to compute the correct mutation score. Unfortunately, answering this question is not always possible and can hardly be obtained just by…
The existence and uniqueness of quantizations that are equivariant with respect to conformal and projective Lie algebras of vector fields were recently obtained by Duval, Lecomte and Ovsienko. In order to do so, they computed spectra of…
In this short note, we will prove the equivalence of the isocapacitary notions of mass. This family also includes G. Huisken's isoperimetric mass and J. L. Jauregui's isocapacitary mass.
In their paper 'p-adic and real subanalytic sets, J. Denef and L. van den Dries prove that the theory of the ring of p-adic integers admits the elimination of quantifiers in the language of p-adic restricted analytic functions expanded by a…
In this paper we prove the equivalence of the questions of B.A. Pasynkov and V.V. Uspenskij. We also get some partial results answering these questions in affirmative. As a corollary to these results we get an extention of the Hurewicz…
Equivalence testing, a fundamental problem in the field of distribution testing, seeks to infer if two unknown distributions on $[n]$ are the same or far apart in the total variation distance. Conditional sampling has emerged as a powerful…
We investigate the equational theory of Kleene algebra terms with variable complements -- (language) complement where it applies only to variables -- w.r.t. languages. While the equational theory w.r.t. languages coincides with the language…
We investigate possible quantifications of the Dunford-Pettis property. We show, in particular, that the Dunford-Pettis property is automatically quantitative in a sense. Further, there are two incomparable mutually dual stronger versions…
The goal of two-sample tests is to assess whether two samples, $S_P \sim P^n$ and $S_Q \sim Q^m$, are drawn from the same distribution. Perhaps intriguingly, one relatively unexplored method to build two-sample tests is the use of binary…
We provide a new simple and transparent proof of the version of Kummer's test given in [Tong, J. (1994). Amer. Math. Monthly. 101(5): 450--452]. Our proof is based on an application of a Hardy--Littlewood Tauberian theorem.
We prove the existence and the uniqueness of a conformally equivariant symbol calculus and quantization on any conformally flat pseudo-Riemannian manifold $(M,\rg)$. In other words, we establish a canonical isomorphism between the spaces of…
We give partial affirmative answers to Landis conjecture in all dimensions for two different types of linear, second order, elliptic operators in a domain $\Omega\subset \mathbb{R}^N$. In particular, we provide a sharp decay criterion that…
We show that polynomial time Turing equivalence and a large class of other equivalence relations from computational complexity theory are universal countable Borel equivalence relations. We then discuss ultrafilters on the invariant Borel…
We interpret ontological models for finite-dimensional quantum theory as functors from the category of finite-dimensional Hilbert spaces and bounded linear maps to the category of measurable spaces and Markov kernels. This uniformises…
Continuing the study of complexity theory of Koepke's Ordinal Turing Machines (OTMs) that was started by Rin, L\"owe and the author, we prove the following results: (1) An analogue of Ladner's theorem for OTMs holds: That is, there are…
Completely solved the equivalence problem for the "`Painleve 34"' equation.
I examine Pan and Home's reply to my Comment on their proposal for testing noncontextual models. I show that the Kochen-Specker model for a qubit does explain all outcomes of a test based on such a proposal, so that it would be inconclusive…