Related papers: On computable field embeddings and difference clos…

Learning faithful graph representations as sets of vertex embeddings has become a fundamental intermediary step in a wide range of machine learning applications. The quality of the embeddings is usually determined by how well the geometry…

The image of a polynomial map is a constructible set. While computing its closure is standard in computer algebra systems, a procedure for computing the constructible set itself is not. We provide a new algorithm, based on algebro-geometric…

We show that for both the unary relation of transcendence and the finitary relation of algebraic independence on a field, the degree spectra of these relations may consist of any single computably enumerable Turing degree, or of those c.e.…

Let n be a positive integer, and let R be a finitely presented (but not necessarily finite dimensional) associative algebra over a computable field. We examine algorithmic tests for deciding (1) if every n-dimensional representation of R is…

After briefly reviewing the methods that allow us to derive consistently new Lie (super)algebras from given ones, we consider enlarged superspaces and superalgebras, their relevance and some possible applications.

In this paper we study injective modules over universal enveloping algebras of finite-dimensional Lie algebras over fields of arbitrary characteristic. Most of our results are dealing with fields of prime characteristic but we also…

We introduce and study a new class of differential fields in positive characteristic. We call them separably differentially closed fields and demonstrate that they are the differential analogue of separably closed fields. We prove several…

We prove a differential analog of a theorem of Chevalley on extending homomorphisms for rings with commuting derivations, generalizing a theorem of Kac. As a corollary, we establish that, under suitable hypotheses, the image of a…

We investigate the complexity of isomorphism relations for classes of finitely generated and n-generated computably enumerable (c.e.) algebras, presented via c.e. presentations -- that is, as quotients of term algebras over decidable sets…

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,…

We deal with the existing problem of filtered multiplicative bases of finite-dimensional associative algebras. For an associative algebra A over a field, we investigate when the property of having a filtered multiplicative basis is…

Rationally convex topological embeddings of compact surfaces (closed or with boundary) into $\mathbb{C}^2$ are constructed.

We prove a triangulation theorem for semi-algebraic sets over a p-adically closed field, quite similar to its real counterpart. We derive from it several applications like the existence of flexible retractions and splitting for…

We study valued fields equipped with an automorphism. We prove that all of them have an extension admitting an equivariant cross-section of the valuation. In residual characteristic zero, and in the presence of such a cross-section, we show…

A new approach is suggested to characterize algebraically automorphisms of the category of free algebras of a given variety. It gives in many cases an answer to the problem set by the first of authors, if automorphisms of such a category…

The purpose of this article is to relate coarse cohomology of metric spaces with a more computable cohomology. We introduce a notion of boundedly supported cohomology and prove that coarse cohomology of many spaces are isomorphic to the…

A compact set has computable type if any homeomorphic copy of the set which is semicomputable is actually computable. Miller proved that finite-dimensional spheres have computable type, Iljazovi\'c and other authors established the property…

Cluster automorphisms have been shown to have links to the mapping class groups of surfaces, maximal green sequences and to exchange graph automorphisms for skew-symmetric cluster algebras. In this paper we aim to generalise these results…

This paper is primarily intended as an introduction for the mathematically inclined to some of the rich algebraic combinatorics arising in for instance CFT. It is essentially self-contained, apart from some of the background motivation and…

Let $\mathcal M=\langle K;O\rangle$ be a real closed valued field and let $k$ be its residue field. We prove that every interpretable field in $\mathcal M$ is definably isomorphic to either $K$, $K(\sqrt{-1})$, $k$, or $k(\sqrt{-1})$. The…