Related papers: Computability of the Radon-Nikodym derivative

If $g$ is a map from a space $X$ into $\mathbb R^m$ and $z\not\in g(X)$, let $P_{2,1,m}(g,z)$ be the set of all lines $\Pi^1\subset\mathbb R^m$ containing $z$ such that $|g^{-1}(\Pi^1)|\geq 2$. We prove that for any $n$-dimensional metric…

The empty set of course contains no computable point. On the other hand, surprising results due to Zaslavskii, Tseitin, Kreisel, and Lacombe assert the existence of NON-empty co-r.e. closed sets devoid of computable points: sets which are…

We investigate the computability of the isomorphism set $\operatorname{Iso}(G_A,G_B)$ between $G_A$ and $G_B$, where $G_A$ is a subgroup of $\mathbb{Q}^n$ generated by columns of integer powers of a non-singular $n \times n$-matrix $A$ with…

We study some geometric properties of actions on nonpositively curved spaces related to complete reducibility and semisimplicity, focusing on representations of a finitely generated group in the group G of rational points of a reductive…

We consider the question as to whether the exponent of a computably presentable Lebesgue space whose dimension is at least 2 must be computable. We show this very natural conjecture is true when the exponent is at least 2 or when the space…

Encodings, that is, injective functions from words to words, have been studied extensively in several settings. In computability theory the notion of encoding is crucial for defining computability on arbitrary domains, as well as for…

Coskey, Hamkins, and Miller [CHM12] proposed two possible analogues of the class of countable Borel equivalence relations in the setting of computable reducibility of equivalence relations on the computably enumerable (c.e.) sets. The first…

Representing graphs as sets of node embeddings in certain curved Riemannian manifolds has recently gained momentum in machine learning due to their desirable geometric inductive biases, e.g., hierarchical structures benefit from hyperbolic…

By using the localized character of canonical coherent states, we give a straightforward derivation of the Bargmann integral representation of Wigner function (W). A non-integral representation is presented in terms of a quadratic form…

We characterize some major algorithmic randomness notions via differentiability of effective functions. (1) As the main result we show that a real number z in [0,1] is computably random if and only if each nondecreasing computable function…

In computable analysis typically topological spaces with countable bases are considered. The Theorem of Kreitz-Weihrauch implies that the subbase representation of a second-countable $T_0$ space is admissible with respect to the topology…

Let $F$ be a local field and $n\ge 2$ an integer. We study the Radon transform as an operator $M : \mathcal C_+ \to \mathcal C_-$ from the space of smooth $K$-finite functions on $F^n \setminus \{0\}$ with bounded support to the space of…

Suppose a finite group acts on a scheme X and a finite-dimensional Lie algebra g. The corresponding equivariant map algebra is the Lie algebra M of equivariant regular maps from X to g. We classify the irreducible finite-dimensional…

We show that if K is Rosenthal compact which can be represented by functions with countably many discontinuities then every Radon measure on K is countably determined. We also present an alternative proof of the result stating that every…

If $\mu_1,\mu_2,\dots$ are positive measures on a measurable space $(X,\Sigma)$ and $v_1,v_2, \dots$ are elements of a Banach space ${\mathbb E}$ such that $\sum_{n=1}^\infty \|v_n\| \mu_n(X) < \infty$, then $\omega (S)= \sum_{n=1}^\infty…

Let $GL_M$ be general linear Lie group over the complex field. The irreducible rational representations of the group $GL_M$ are labeled by pairs of partitions $\mu$ and $\tilde\mu$ such that the total number of non-zero parts of $\mu$ and…

We revisit Narain conformal field theories from an algebraic perspective based on finite dimensional Lie algebras $\mathbf{g}$ and representations $\mathcal{R}_{\mathbf{g}}$, and show how the root and weight lattices can encode the momenta…

Regular functions from infinite words to infinite words can be equivalently specified by MSO-transducers, streaming $\omega$-string transducers as well as deterministic two-way transducers with look-ahead. In their one-way restriction, the…

We prove that a function $f:X\to Y$ from a first-countable (more generally, Preiss-Simon) space $X$ to a regular space $Y$ is weakly discontinuous (which means that every subspace $A\subset X$ contains an open dense subset $U\subset A$ such…

We introduce new definitions of universal and superuniversal computable codes, which are based on a code's ability to approximate Kolmogorov complexity within the prescribed margin for all individual sequences from a given set. Such sets of…