Related papers: The classification problem for finitely generated …
Classes of Banach spaces that are finitely, strongly finitely or elementary equivalent are introduced. On sets of these classes topologies are defined in such a way that sets of defined classes become compact totally disconnected…
The TTE approach to Computable Analysis is the study of so-called representations (encodings for continuous objects such as reals, functions, and sets) with respect to the notions of computability they induce. A rich variety of such…
We show that the first order theory of the homeomorphism group of a compact manifold interprets the full second order theory of countable groups of homeomorphisms of the manifold. The interpretation is uniform across manifolds of bounded…
We initiate the study of computable presentations of real and complex C*-algebras under the program of effective metric structure theory. With the group situation as a model, we develop corresponding notions of recursive presentations and…
On finite dimensional spaces, it is apparent that an operator is the product of two positive operators if and only if it is similar to a positive operator. Here, the class ${\mathcal L}^{+2}$ of bounded operators on separable infinite…
Decomposable models and Bayesian networks can be defined as sequences of oligo-dimensional probability measures connected with operators of composition. The preliminary results suggest that the probabilistic models allowing for effective…
We prove that the isomorphism problem for finitely generated fully residually free groups is decidable. We also show that each finitely generated fully residually free group G has a decomposition that is invariant under automorphisms of G,…
Finite-order invariants of knots in arbitrary 3-manifolds (including non-orientable ones) are constructed and studied by methods of the topology of discriminant sets. Obstructions to the integrability of admissible weight systems to…
A computably presented algebraic field $F$ has a \emph{splitting algorithm} if it is decidable which polynomials in $F[X]$ are irreducible there. We prove that such a field is computably categorical iff it is decidable which pairs of…
The rationality and C_2-cofiniteness of the orbifold vertex operator algebra V_{L_{2}}^{A_{4}} are established and all the irreducible modules are constructed and classified. This is part of classification of rational vertex operator…
This paper establishes some of the fundamental barriers in the theory of computations and finally settles the long-standing computational spectral problem. That is to determine the existence of algorithms that can compute spectra…
The explicit description of irreducible homogeneous operators in the Cowen-Douglas class and the localization of Hilbert modules naturally leads to the definition of a smaller class of Cowen-Douglas operators possessing a flag structure.…
We say that a finite almost simple $G$ with socle $S$ is admissible (with respect to the spectrum) if $G$ and $S$ have the same sets of orders of elements. Let $L$ be a finite simple linear or unitary group of dimension at least three over…
We prove the undecidability of determining whether a Turing machine yields an eventually periodic trajectory. From this, we deduce the undecidability of orbit finiteness in the polynomial dynamical system on infinite tuples of integers.
We introduce a class of operators on $L_1$ that is stable under taking sums of pointwise unconditionally convergent series, contains all compact operators and does not contain isomorphic embeddings. It follows that any operator from $L_1$…
A real finite-dimensional space with indefinite scalar product having v- negative squares and v+ positive ones is considered. The paper presents a classification of operators that are normal with respect to this product for the cases…
Given a computable sequence of natural numbers, it is a natural task to find a G\"odel number of a program that generates this sequence. It is easy to see that this problem is neither continuous nor computable. In algorithmic learning…
A vector subspace $\cls$ of $\IM_n(\IC)$ is called unital operator system if $x \in \cls$ if and only if $x^* \in \cls$ and the identity operator $I_n \in \cls$, where $n$ is any fixed positive integer. Let $C^*(\cls)$ be the $C^*$…
This is the second installment in a series of papers applying descriptive set theoretic techniques to both analyze and enrich classical functors from homological algebra and algebraic topology. In it, we show that the \v{C}ech cohomology…
We use Arveson's notion of strongly peaking representation to generalize uniqueness theorems for free spectrahedra and matrix convex sets which admit minimal presentations. A fully compressed separable operator system necessarily generates…