Related papers: Generalized Descriptive Set Theory and Classificat…
Isomorphisms are constructed between generalized Schur algebras in different degrees. The construction covers both the classical case (of general linear groups over infinite fields of arbitrary characteristic) and the quantized case (in…
Countably infinite groups (with a fixed underlying set) constitute a Polish space $G$ with a suitable metric, hence the Baire category theorem holds in $G$. We study isomorphism invariant subsets of $G$, which we call group properties. We…
This paper illustrates the richness of the concept of regular sets of time bounds and demonstrates its application to problems of computational complexity. There is a universe of bounds whose regular subsets allow to represent several time…
In this note, we analyze the classification problem for compact metrizable $G$-ambits for a countable discrete group $G$ from the point of view of descriptive set theory. More precisely, we prove that the topological conjugacy relation on…
A quantum set is defined to be simply a set of nonzero finite-dimensional Hilbert spaces. Together with binary relations, essentially the quantum relations of Weaver, quantum sets form a dagger compact category. Functions between quantum…
We introduce and study Polish topologies on various spaces of countable enumerated groups, where an enumerated group is simply a group whose underlying set is the set of natural numbers. Using elementary tools and well known examples from…
The main goal of this paper is to develop a concept of approximate differentiability of higher order for subsets of the Euclidean space that allows to characterize higher order rectifiable sets, extending somehow well known facts for…
We use generalizations of concepts from descriptive set theory to study combinatorial objects of uncountable regular cardinality, focussing on higher Kurepa trees and the representation of the sets of cofinal branches through such trees as…
The generalized recurrence plot is a modern tool for quantification of complex spatial patterns. Its application spans the analysis of trabecular bone structures, Turing patterns, turbulent spatial plankton patterns, and fractals.…
The concept of ``countable set'' is attributed to Georg Cantor, who set the boundary between countable and uncountable sets in 1874. The concept of ``computable set'' arose in the study of computing models in the 1930s by the founders of…
Generalised indiscernibles highlight a strong link between model theory and structural Ramsey theory. In this paper, we use generalised indiscernibles as tools to prove results in both these areas. More precisely, we first show that a…
We study integralgeometric representations of variations of general sets $A$ in the Euclidean n-space without any regularity assumptions. If we assume, for example, that just one partial derivative of its characteristic function $\chi^A$ is…
Let A be an associative algebra over a field, and let M be a finite family of right A-modules. Study of the noncommutative deformation functor of the family M leads to the construction of the algebra of observables and the Generalized…
We study uncountable structures similar to the Fra\"iss\'e limits. The standard inductive arguments from the Fra\"iss\'e theory are replaced by forcing, so the structures we obtain are highly sensitive to the universe of set theory. In…
This paper proposes a new notion of typical sequences on a wide class of abstract alphabets (so-called standard Borel spaces), which is based on approximations of memoryless sources by empirical distributions uniformly over a class of…
We consider various collections of functions from the Baire space X into itself naturally arising in (effective) descriptive set theory and general topology, including computable (equivalently, recursive) functions, contraction mappings,…
One way of studying a relational structure is to investigate functions which are related to that structure and which leave certain aspects of the structure invariant. Examples are the automorphism group, the self-embedding monoid, the…
In "Object generators, relaxed sets, and a foundation for mathematics", we introduced ``object generators'', a logical environment much more general than set theory. Inside this we found a `relaxed' version of set theory. That paper is…
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…
We initiate the effective metric structure theory of Keisler randomizations. We show that a classical countable structure $\mathcal{M}$ has a decidable presentation if and only if its Borel randomization $\mathcal{M}^{[0,1)}$ has a…