Related papers: On the computability of rotation sets and their en…
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 revisit the definition of effective local compactness, and propose an approach that works for arbitrary countably-based spaces extending the previous work on computable metric spaces. We use this to show that effective local compactness…
The TTE approach to Computable Analysis is the study of so-called representations (encodings for continuous objects such as reals, functions, and sets) with respect to the notions of computability they induce. A rich variety of such…
We extend the Theory of Computation on real numbers, continuous real functions, and bounded closed Euclidean subsets, to compact metric spaces $(X,d)$: thereby generically including computational and optimization problems over higher types,…
We say that a function $f:[0,1]\rightarrow \R$ is \emph{nowhere $L^q$} if, for each nonvoid open subset $U$ of $[0,1]$, the restriction $f|_U$ is not in $L^q(U)$. For a fixed $1 \leq p <\infty$, we will show that the set $$ S_p\doteq {f \in…
We prove that if two topologically free and entropy regular actions of countable sofic groups on compact metrizable spaces are continuously orbit equivalent, and each group either (i) contains a w-normal amenable subgroup which is neither…
We prove an algebraic extension theorem for the computably enumerable sets, $\mathcal{E}$. Using this extension theorem and other work we then show if $A$ and $\hat{A}$ are automorphic via $\Psi$ then they are automorphic via $\Lambda$…
A rational pseudo-rotation $f$ of the torus is a homeomorphism homotopic to the identity with a rotation set consisting of a single vector $v$ of rational coordinates. We give a classification for rational pseudo-rotations with an invariant…
We introduce the notion of finitary computable reducibility on equivalence relations on the natural numbers. This is a weakening of the usual notion of computable reducibility, and we show it to be distinct in several ways. In particular,…
For a continuous map on a topological graph containing a loop $S$ it is possible to define the degree (with respect to the loop $S$) and, for a map of degree $1$, rotation numbers. We study the rotation set of these maps and the periods of…
Given a convex function $\varphi$ and two hermitian matrices $A$ and $B$, Lewin and Sabin study in [M. Lewin, J. Sabin, {\it A Family of Monotone Quantum Relative Entropies}, Lett. Math. Phys. \textbf{104} (2014), 691-705.] the relative…
Let $\Phi$ be a concave function on $(0,\infty)$ of strictly lower type $p_{\Phi}\in(0,1]$ and $\omega\in A^{\mathop\mathrm{loc}}_{\infty}(\mathbb{R}^n)$. We introduce the weighted local Orlicz-Hardy space $h^{\Phi}_{\omega}(\mathbb{R}^n)$…
We say that a set is exhaustible if it admits algorithmic universal quantification for continuous predicates in finite time, and searchable if there is an algorithm that, given any continuous predicate, either selects an element for which…
Irreversible Port Hamiltonian Systems are departure of Port Hamiltonian Systems as they are generated not only by a Hamiltonian function but also by an entropy function and defined with respect to a quasi-Poisson bracket which embeds the…
A computably presented algebraic field $F$ has a \emph{splitting algorithm} if it is decidable which polynomials in $F[X]$ are irreducible there. We prove that such a field is computably categorical iff it is decidable which pairs of…
A notable feature of the TTE approach to computability is the representation of the argument values and the corresponding function values by means of infinitistic names. Two ways to eliminate the using of such names in certain cases are…
Symmetries corresponding to local transformations of the fundamental fields that leave the action invariant give rise to (invertible) topological defects, which obey group-like fusion rules. One can construct more general (codimension-one)…
Let G be a closed subgroup of the group of all permutations of a countably infinite set. Let X be a Polish G-space with a countable basis A of clopen sets. Each x from X defines a characteristic function f on A by f(U)=1 iff x belongs to U…
Using tools from computable analysis we develop a notion of effectiveness for general dynamical systems as those group actions on arbitrary spaces that contain a computable representative in their topological conjugacy class. Most natural…
We study the rotational behaviour on minimal sets of torus homeomorphisms and show that the associated rotation sets can be any type of line segments as well as non-convex and even plane-separating continua. This shows that restrictions…