Related papers: The Rice-Shapiro theorem in Computable Topology
We study the position of the computable setting in the "common theory of locality" developed in arXiv:2106.02066 and arXiv:2204.09329 for local problems on $\Delta$-regular trees, $\Delta \in \omega$. We show that such a problem admits a…
We develop tame topology over dp-minimal structures equipped with definable uniformities satisfying certain assumptions. Our assumptions are enough to ensure that definable sets are tame: there is a good notion of dimension on definable…
A space $X$ has countable $(F)$-property if it has countable point network satisfying the Collins-Roscoe structuring mechanism. Some sufficient conditions for $C_p(X)$ having countable $(F)$-property are obtained. As a corollary, we prove…
An \'{e}tale space over a topological space $Y$ is defined as a local homeomorphism from a topological space $X$ into $Y$. They often come up in topos theory because of the equivalence between sheaves and \'{e}tale spaces over a space. In…
We study the computational content of the Radon-Nokodym theorem from measure theory in the framework of the representation approach to computable analysis. We define computable measurable spaces and canonical representations of the measures…
We prove group existence and structure theorems in a general setting of tame topological theories. More precisely, we identify a linear/non-linear dividing line -- called topological 1-basedness -- among the class of t-minimal theories with…
We prove that the existence of finite combinatorial objects such as affine planes, mutually orthogonal Latin squares, and resolvable balanced incomplete block designs can be reformulated as the existence of certain algorithmic reductions…
We prove that to any smooth vector field of a closed manifold it can be assigned a nonnegative number called {\em rescaled topological entropy} satisfying the following properties: it is an upper bound for both the topological entropy and…
Rational conformal field theories produce a tower of finite-dimensional representations of surface mapping class groups, acting on the conformal blocks of the theory. We review this formalism. We show that many recent mathematical…
The class of uniformly computable real functions with respect to a small subrecursive class of operators computes the elementary functions of calculus, restricted to compact subsets of their domains. The class of conditionally computable…
We study the computational content of various theorems with reverse mathematical strength around Arithmetical Transfinite Recursion ($\mathsf{ATR}_0$) from the point of view of computability-theoretic reducibilities, in particular Weihrauch…
William Thurston (1946-2012) gave a combinatorial characterization for generic branched self-coverings of the two-sphere by associating a planar graph to them 10.48550/arXiv.1502.04760. By generalizing the notion of local balancing, the…
We demonstrate that the Weihrauch lattice can be used to classify the uniform computational content of computability-theoretic properties as well as the computational content of theorems in one common setting. The properties that we study…
Using methods from coarse topology we show that fundamental classes of closed enlargeable manifolds map non-trivially both to the rational homology of their fundamental groups and to the K-theory of the corresponding reduced C*-algebras.…
We prove Wigner-Eckart theorem for the irreducible tensor operators for arbitrary Hopf algebras, provided that tensor product of their irreducible representation is completely reducible. The proof is based on the properties of the…
In a recent work [1] we consider the topological expansion for the non-mixed observables (including the free energy) for the formal Cauchy matrix model. The only restriction in [1] was the fact that all the branch points have to be simple.…
We show that products of sufficiently thick Cantor sets generate trees in the plane with constant distance between adjacent vertices. Moreover, we prove that the set of choices for this distance has non-empty interior. We allow our trees to…
In this paper, continuous binary operations of a topological space are studied and a criterion of their invertibility is proved. The classification problem of groups of invertible continuous binary operations of locally compact and locally…
We demonstrate how category theory provides specifications that can efficiently be implemented via imperative algorithms and apply this to the field of graph rewriting. By examples, we show how this paradigm of software development makes it…
We consider the satisfiability problem for the two-variable fragment of first-order logic over finite unranked trees. We work with signatures consisting of some unary predicates and the binary navigational predicates child, right sibling,…