Related papers: The classification problem for finitely generated …
In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…
The well-known difficulties arising in a classification which is not set-theoretically trivial---involving what is sometimes called a non-smooth quotient---have been overcome in a striking way in the theory of operator algebras by the use…
We assess the descriptive complexity of *bisimilarity* or "equality of behavior" on a family of Markov decision processes over uncountable standard Borel spaces, namely *nondeterministic labelled Markov processes* (NLMP). We show that…
We show that finitely generated cohomology is invariant under separable equivalences for all algebras. As a result, we obtain a proof of the finite generation of cohomology for finite symmetric tensor categories in characteristic zero, as…
Uniformly finite homology is a coarse invariant for metric spaces; in particular, it is a quasi-isometry invariant for finitely generated groups. In this article, we study uniformly finite homology of finitely generated amenable groups and…
Simplicial arrangements are classical objects in discrete geometry. Their classification remains an open problem but there is a list conjectured to be complete at least for rank three. A further important class in the theory of hyperplane…
Universality has been an important concept in computable structure theory. A class $\mathcal{C}$ of structures is universal if, informally, for any structure, of any kind, there is a structure in $\mathcal{C}$ with the same…
Classification is an important goal in many branches of mathematics. The idea is to describe the members of some class of mathematical objects, up to isomorphism or other important equivalence in terms of relatively simple invariants. Where…
Composition operators with analytic symbols on some reproducing kernel Hilbert spaces of entire functions on a complex Hilbert space are studied. The questions of their boundedness, seminormality and positivity are investigated. It is…
We study orbit-finite systems of linear equations, in the setting of sets with atoms. Our principal contribution is a decision procedure for solvability of such systems. The procedure works for every field (and even commutative ring) under…
Complexity and decidability of logics is a major research area involving a huge range of different logical systems. This calls for a unified and systematic approach for the field. We introduce a research program based on an algebraic…
A density operator of a bipartite quantum system is called robustly separable if it has a neighborhood of separable operators. Given a bipartite density matrix, its property to be robustly separable is reduced, using the continuous ensemble…
We investigate the descriptive set-theoretic complexity of the solvability of a Borel family of linear equations over a finite field. Answering a question of Thornton, we show that this problem is already hard, namely $\Sigma^1_2$-complete.…
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…
We demonstrate new abstract characterizations for unital and non-unital operator spaces. We characterize unital operator spaces in terms of the cone of accretive operators (operators whose real part is positive). Defining the gauge of an…
Based on the success of a well-known method for solving higher order linear differential equations, a study of two of the most important mathematical features of that method, viz. the null spaces and commutativity of the product of…
We provide a complete classification, up to order-isomorphism, of all possible Wadge hierarchies on zero-dimensional Polish spaces using (essentially) countable ordinals as complete invariants. We also observe that although our assignment…
This is an expository paper about the Borel complexity of structure and classification theorems. It sorts several classical problems relative to known benchmarks of complexity. As a corollary various problems proposed by people such as von…
A computable structure $\mathcal{A}$ is decidable if, given a formula $\varphi(\bar{x})$ of elementary first-order logic, and a tuple $\bar{a} \in \mathcal{A}$, we have a decision procedure to decide whether $\varphi$ holds of $\bar{a}$. We…
Functional analysis, especially the theory of Hilbert spaces and of operators on these, form an important area in mathematics. We formalized the Isabelle/HOL library Complex_Bounded_Operators containing a large amount of theorems about…