Related papers: A Note on Computable Embeddings for Ordinals and T…

Working in the framework of Borel reducibility, we study various notions of embeddability between groups. We prove that the embeddability between countable groups, the topological embeddability between (discrete) Polish groups, and the…

A class of neural networks that gained particular interest in the last years are neural ordinary differential equations (neural ODEs). We study input-output relations of neural ODEs using dynamical systems theory and prove several results…

We show that diagrammatic sets, a topologically sound alternative to polygraphs and strict $\omega$-categories, admit an internal notion of equivalence in the sense of coinductive weak invertibility. We prove that equivalences have the…

A cohesive power of a computable structure is an effective ultrapower where a cohesive set acts as an ultrafilter. Let $\omega$, $\zeta$, and $\eta$ denote the respective order-types of the natural numbers, the integers, and the rationals.…

Let $F$ be a global field, $A$ a central simple algebra over $F$ and $K$ a finite (separable or not) field extension of $F$ with degree $[K:F]$ dividing the degree of $A$ over $F$. An embedding of $K$ in $A$ over $F$ exists implies an…

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 study the computably enumerable sets in terms of the: (a) Kolmogorov complexity of their initial segments; (b) Kolmogorov complexity of finite programs when they are used as oracles. We present an extended discussion of the existing…

We introduce two notions of coarse embeddability between operator spaces: almost complete coarse embeddability of bounded subsets and spherically-complete coarse embeddability. We provide examples showing that these notions are strictly…

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…

We show that every countable group H with solvable word problem (=computable group) can be subnormally embedded into a 2-generated group G which also has solvable word problem. Moreover, the membership problem for H < G is also solvable. We…

We answer a question of Downey and Kurtz on left-orderable groups by showing that there is a computable left-orderable group which is not classically isomorphic to a computable group with a computable left-order.

We study general properties of holomorphic isometric embeddings of complex unit balls $\mathbb B^n$ into bounded symmetric domains of rank $\ge 2$. In the first part, we study holomorphic isometries from $(\mathbb B^n,kg_{\mathbb B^n})$ to…

Let $K$ be a $k$-dimensional simplicial complex having $n$ faces of dimension $k$, and $M$ a closed $(k-1)$-connected PL $2k$-dimensional manifold. We prove that for $k\ge3$ odd $K$ embeds into $M$ if and only if there are $\bullet$ a…

In this paper, by using Gr\"obner-Shirshov bases, we show that in the following classes, each (resp. countably generated) algebra can be embedded into a simple (resp. two-generated) algebra: associative differential algebras, associative…

Given a bounded sequence \omega of positive numbers and its associated unilateral weighted shift W_{\omega} acting on the Hilbert space \ell^2(\mathbb{Z}_+), we consider natural representations of W_{\omega} as a 2-variable weighted shift,…

We give a characterization of the strong degrees of categoricity of computable structures greater or equal to $\mathbf 0''$. They are precisely the \emph{treeable} degrees -- the least degrees of paths through computable trees -- that…

One of the important features of an interconnection network is its ability to efficiently simulate programs or parallel algorithms written for other architectures. Such a simulation problem can be mathematically formulated as a graph…

For a given measure space $(X,{\mathscr B},\mu)$ we construct all measure spaces $(Y,{\mathscr C},\lambda)$ in which $(X,{\mathscr B},\mu)$ is embeddable. The construction is modeled on the ultrafilter construction of the Stone--\v{C}ech…

By a regular embedding of a graph K in a surface we mean a 2-cell embedding of K in a compact connected surface such that the automorphism group acts regularly on flags. In this paper, we classify the nonorientable regular embeddings of the…

Embedding models trained separately on similar data often produce representations that encode stable information but are not directly interchangeable. This lack of interoperability raises challenges in several practical applications, such…