Related papers: On computable field embeddings and difference clos…
We present here algorithms for efficient computation of linear algebra problems over finite fields.
In this short note, we give a new sufficient condition for a linear map from a product of copies of a field to endomorphisms of a finite dimensional vector space over the same field to be an algebra homomorphism. We expect that this result…
We study the algorithmic complexity of embeddings between bi-embeddable equivalence structures. We define the notions of computable bi-embeddable categoricity, (relative) $\Delta^0_\alpha$ bi-embeddable categoricity, and degrees of…
It is shown that there is a computable conformal map of the unit disk onto a domain $D$ that has a computable extension to the closure of the unit disk even though the boundary of $D$ is not effectively locally connected. The proof encodes…
In this work, we study the computability of topological graphs, which are obtained by gluing arcs and rays together at their endpoints. We prove that every semicomputable graph in a computable metric space can be approximated, with…
This paper focuses on the derivations and automorphism groups of certain finite-dimensional associative algebras over the field of complex numbers. Using classification results for algebras of dimensions two, three, and four, along with…
We construct a fully faithful functor from the category of graphs to the category of fields. Using this functor, we resolve a longstanding open problem in computable model theory, by showing that for every nontrivial countable structure S,…
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…
The notion of hidden symmetry algebra used in the context of exactly solvable systems is re-examined from the purely algebraic way, analyzing subspaces of commuting polynomials that generate finite-dimensional quadratic algebras. By…
The classification, both up to isomorphism or up to equivalence, of the gradings on a finite dimensional nonassociative algebra A over an algebraically closed field F, such that its group scheme of automorphisms is smooth, is shown to be…
We propose a definition of computable manifold by introducing computability as a structure that we impose to a given topological manifold, just in the same way as differentiability or piecewise linearity are defined for smooth and PL…
An algorithm for embedding finite dimensional Lie algebras into Lie algebras of vector fields (and Lie superalgebras into Lie superalgebras of vector fields) is offered in a way applicable over ground fields of any characteristic. The…
The first aim of this paper is to show that any finite-dimensional reductive Lie algebra and its finite-dimensional completely reducible representation can be embedded into some PC Lie algebra. The second aim is to find the structure of a…
In this paper, we prove that every iterative differential embedding problem over an algebraic function field in positive characteristic with an algebraically closed field of constants has a proper solution.
Class field theory furnishes an intrinsic description of the abelian extensions of a number field that is in many cases not of an immediate algorithmic nature. We outline the algorithms available for the explicit computation of such…
Adapting a result of Bazhenov, Kalimullin, and Yamaleev, we show that if a Turing degree $\textbf{d}$ is the degree of categoricity of a computable structure $\mathcal{M}$ and is not the strong degree of categoricity of any computable…
We prove that an infinite field interpretable in a $p$-adically closed field $K$ is definably isomorphic to a finite extension of $K$. The result remains true in any $P$-minimal field where definable functions are generically…
The irreducible alternative superbimodules are studied. The complete classification is obtained for even bimodules of arbitrary dimension and for finite-dimensional irreducible superbimodules over an algebraically closed field.
We establish a computable version of Gelfand Duality. Under this computable duality, computably compact presentations of metrizable spaces uniformly effectively correspond to computable presentations of unital commutative $C^*$ algebras.
We construct a computable, computably categorical field of infinite transcendence degree over the rational numbers, using the Fermat polynomials and assorted results from algebraic geometry. We also show that this field has an intrinsically…