Related papers: Computably discrete represented spaces
It is introduced the concept of a quasi-king space, which is a natural generalisation of a king space. In the realm of suborderable spaces, king spaces are precisely the compact spaces, so are the quasi-king spaces. In contrast, quasi-king…
A metric space $X$ is quasisymmetrically co-Hopfian if every quasisymmetric embedding of $X$ into itself is onto. We construct the first examples of metric spaces homeomorphic to the universal Menger curve and higher dimensional…
Every topological space has a Kolmogorov quotient that is obtained by identifying topologically indistinguishable points, that is, points that are contained in exactly the same open sets. In this survey, we look at the relationship between…
A topological space $X$ is called almost discretely Lindel\"of if every discrete set $D \subset X$ is included in a Lindel\"of subspace of $X$. We say that the space $X$ is {\em $\mu$-sequential} if for every non-closed set $A \subset X$…
We prove that the locally convex space $C_{p}(X)$ of continuous real-valued functions on a Tychonoff space $X$ equipped with the topology of pointwise convergence is distinguished if and only if $X$ is a $\Delta$-space in the sense of \cite…
We define and study a class of finite topological spaces, which model the cell structure of a space obtained by gluing finitely many Euclidean convex polyhedral cells along congruent faces. We call these finite topological spaces,…
We initiate the computability-theoretic study of ringed spaces and schemes. In particular, we show that any Turing degree may occur as the least degree of an isomorphic copy of a structure of these kinds. We also show that these structures…
We give several new examples of computable structures of high Scott rank. For earlier known computable structures of Scott rank $\omega_1^{CK}$, the computable infinitary theory is $\aleph_0$-categorical. Millar and Sacks asked whether this…
A topological group G is profinite if it is compact and totally disconnected. Equivalently, G is the inverse limit of a surjective system of finite groups carrying the discrete topology. We discuss how to represent a countably based…
The Bodirsky-Pinsker conjecture asserts a P vs. NP-complete dichotomy for the computational complexity of Constraint Satisfaction Problems (CSPs) of first-order reducts of finitely bounded homogeneous structures. Prominently, two structures…
Spectrahedra are sets defined by linear matrix inequalities. Projections of spectrahedra are called semidefinitely representable sets. Both kinds of sets are of practical use in polynomial optimization, since they occur as feasible sets in…
We investigate the extrinsic geometry of causal sets in $(1+1)$-dimensional Minkowski spacetime. The properties of boundaries in an embedding space can be used not only to measure observables, but also to supplement the discrete action in…
Quantum Euclidean spaces, as Moyal deformations of Euclidean spaces, are the model examples of noncompact noncommutative manifold. In this paper, we study the quantum Euclidean space equipped with partial derivatives satisfying canonical…
We study notions of generic and coarse computability in the context of computable structure theory. Our notions are stratified by the $\Sigma_\beta$ hierarchy. We focus on linear orderings. We show that at the $\Sigma_1$ level all linear…
Computational models are quantitative representations of systems. By analyzing and comparing the outputs of such models, it is possible to gain a better understanding of the system itself. Though as the complexity of model outputs…
Some notions in mathematics can be considered relative. Relative is a term used to denote when the variation in the position of an observer implies variation in properties or measures on the observed object. We know, from Skolem theorem,…
We give an overview of the representation theory of restricted rational Cherednik algebras. These are certain finite-dimensional quotients of rational Cherednik algebras at t=0. Their representation theory is connected to the geometry of…
Representations of domains mean in a general way representing a domain as a suitable family endowed with set-inclusion order of some mathematical structures. In this paper, representations of domains via CF-approximation spaces are…
A space $X$ is called {\it selectively pseudocompact} if for each sequence $(U_{n})_{n\in \mathbb{N}}$ of pairwise disjoint nonempty open subsets of $X$ there is a sequence $(x_{n})_{n\in \mathbb{N}}$ of points in $X$ such that $cl_X(\{x_n…
We introduce a notion of computable randomness for infinite sequences that generalises the classical version in two important ways. First, our definition of computable randomness is associated with imprecise probability models, in the sense…