Related papers: Computable dyadic subbases and $\mathbf{T}^\omega$…
We investigate the complexity of the lattice of local clones over a countably infinite base set. In particular, we prove that this lattice contains all algebraic lattices with at most countably many compact elements as complete sublattices,…
Specifying a computational problem requires fixing encodings for input and output: encoding graphs as adjacency matrices, characters as integers, integers as bit strings, and vice versa. For such discrete data, the actual encoding is…
By [R. Bautista, P. Gabriel, A.V Roiter., L. Salmeron, Representation-finite algebras and multiplicative basis. Invent. Math. 81 (1985) 217-285.], a finite-dimensional algebra having finitely many isoclasses of indecomposable…
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,…
Answering a question raised by V. V. Tkachuk, we present several examples of $\sigma$-compact spaces, some only consistent and some in ZFC, that are not countably tight but in which the closure of any discrete subset is countably tight. In…
Finite and Infinite-dimensional representations of symmetry algebras play a significant role in determining the spectral properties of physical Hamiltonians. In this paper, we introduce and apply a practical method to construct infinite…
Given a coloring of the k-element subsets of an uncountable separable metric space, we show that there exists an infinite monochromatic subset which contains its limit point.
We associate Popa systems (= standard invariants of subfactors) to the finite dimensional representations of compact quantum groups. We characterise the systems arising in this way: these are the ones which can be ``represented'' on finite…
Conceptual spaces are geometric representations of conceptual knowledge, in which entities correspond to points, natural properties correspond to convex regions, and the dimensions of the space correspond to salient features. While…
A reduction of properties (invariants) of compact sets of real numbers to properties of countable orders is presented here. Discussed here is also an embedding property of some compact sets that are called t$\mathbb R$-sets. Among others,…
We investigate compact quantum group actions on unital $C^*$-algebras by analyzing invariant subsets and invariant states. In particular, we come up with the concept of compact quantum group orbits and use it to show that countable compact…
We show in detail that every compact countable subset of a metric space is homeomorphic to a countable ordinal number, which extends a result given by Mazurkiewicz and Sierpinski for finite-dimensional Euclidean spaces. In order to achieve…
A metric space $\mathbf{X}$ is called densely complete if there exists a dense set $D$ in $\mathbf{X}$ such that every Cauchy sequence of points of $D $ converges in $\mathbf{X}$. One of the main aims of this work is to prove that the…
For a compact group $\mathbb{G}$, the functor from unital Banach algebras with contractive morphisms to metric spaces with 1-Lipschitz maps sending a Banach algebra $A$ to the space of $\mathbb{G}$-representations in $A$ preserves filtered…
Computable reducibility is a well-established notion that allows to compare the complexity of various equivalence relations over the natural numbers. We generalize computable reducibility by introducing degree spectra of reducibility and…
We prove, assuming Souslin's Hypothesis, that each uncountable subspace of each zero-dimensional monotonically normal compact space contains an uncountable subset of the real line with either the metric, the Sorgenfrey, or the discrete…
In this paper we consider representations of certain combinatorial categories, including the poset $\D$ of positive integers and division, the Young lattice $\mathscr{Y}$ of partitions of finite sets, the opposite category of the orbit…
We study the topology of metric spaces which are definable in o-minimal expansions of ordered fields. We show that a definable metric space either contains an infinite definable discrete set or is definably homeomorphic to a definable set…
We study directed sets definable in o-minimal structures, showing that in expansions of ordered fields these admit cofinal definable curves, as well as a suitable analogue in expansions of ordered groups, and furthermore that no analogue…
The study of automorphisms of computable and other structures connects computability theory with classical group theory. Among the noncomputable countable structures, computably enumerable structures are one of the most important objects of…