Related papers: Computability of topological pressure on compact s…
We develop a general framework for the probabilistic analysis of random finite point clouds in the context of topological data analysis. We extend the notion of a barcode of a finite point cloud to compact metric spaces. Such a barcode…
We study the computational power of the Full-Tilt model of motion planning, where slidable polyominos are moved maximally around a board by way of a sequence of directional ``tilts.'' We focus on the deterministic scenario in which the…
A multidimensional sofic shift is called countably covered if it has an SFT cover containing only countably many configurations. In contrast to the one-dimensional setting, not all countable sofic shifts are countably covered. We…
We construct Z^2-SFTs at every computable level of the hierarchy of topological completely positive entropy (TCPE), answering Barbieri and Garc\'{i}a-Ramos, who asked if there was one at level 3. Furthermore, we show the property of TCPE in…
We consider two basic problems of algebraic topology, the extension problem and the computation of higher homotopy groups, from the point of view of computability and computational complexity. The extension problem is the following: Given…
Let $S=\{s_{n}\}$ be an increasing finite or infinite subset of $\mathbb N \bigcup \{0\}$ and $X(S)$ the $S$-gap shift associated to $S$. Let $f_{S}(x)=1-\sum\frac{1}{x^{s_{n}+1}}$ be the entropy function which will be vanished at…
We investigate partial functions and computability theory from within a constructive, univalent type theory. The focus is on placing computability into a larger mathematical context, rather than on a complete development of computability…
The topological susceptibility is an important quantity in QCD, which can be computed using lattice methods. However, at a fine lattice spacing, or when using high quality chirally symmetric quarks, algorithms which proceed in small update…
The deck of a topological space $X$ is the set $\mathcal{D}(X)=\{[X \setminus \{x\}] \colon x \in X\}$, where $[Z]$ denotes the homeomorphism class of $Z$. A space $X$ is topologically reconstructible if whenever…
Given an irreducible sofic shift X, we show that an an irreducible SFT Y of lower entropy is a factor of X if and only if it is a factor of X by an open bi-continuing code. If these equivalent conditions hold and Y is mixing, then any code…
In our paper [18] we showed that a Tychonoff space $X$ is a $\Delta$-space (in the sense of [20], [30]) if and only if the locally convex space $C_{p}(X)$ is distinguished. Continuing this research, we investigate whether the class $\Delta$…
Let $S=\{s_i\in\mathbb N\cup\{0\}:0\leq s_i<s_{i+1}\}$ and let $d_{0}=s_{0}$ and $\Delta(S)=\{d_{n}\}_{n}$ where $d_{n}=s_{n}-s_{n-1}$. In this note, we show that an $S$-gap shift is subshift of finite type (SFT) if and only if $S$ is…
In quantum field theories with topological sectors, a non-perturbative quantity of interest is the topological susceptibility chi_t. In principle it seems straightforward to measure chi_t by means of Monte Carlo simulations. However, for…
To scrutinize notions of computation and time complexity, we introduce and formally define an interactive model for computation that we call it the \emph{computation environment}. A computation environment consists of two main parts: i) a…
The purpose of this article is twofold. On one hand, we reveal the equivalence of shift of finite type between a one-sided shift $X$ and its associated hom tree-shift $\mathcal{T}_{X}$, as well as the equivalence in the sofic shift. On the…
This paper studies two-variable compressions of shifts associated to rational inner functions on the bidisk; these generalize the classical compressions of the shift associated to finite Blasckhe products and are unitarily equivalent to…
In this paper, given a topological space $X$, an interval $I\subseteq {\bf R}$ and five continuous functions $\varphi, \psi, \omega :X\to {\bf R}$, $\alpha, \beta:I\to {\bf R}$, we are interested in the infimum of the function $\Phi:X\to…
The topological complexity TC(X) is a homotopy invariant which reflects the complexity of the problem of constructing a motion planning algorithm in the space X, viewed as configuration space of a mechanical system. In this paper we…
We study topological transitivity/hypercyclicity and topological (weak) mixing for weighted composition operators on locally convex spaces of scalar-valued functions which are defined by local properties. As main application of our general…
We study certain topological problems that are inspired by applications to autonomous robot manipulation. Consider a continuous map $f\colon X\to Y$, where $f$ can be a kinematic map from the configuration space $X$ to the working space $Y$…