Related papers: A Note on Computable Embeddings for Ordinals and T…
Third-order ordinary differential equations with Lie symmetry algebras isomorphic to the nonsolvable algebra $\mathfrak{sl}(2,\mathbb{R})$ admit solvable structures. These solvable structures can be constructed by using the basis elements…
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…
Theoretical results from discrete geometry suggest that normed spaces can abstractly embed finite metric spaces with surprisingly low theoretical bounds on distortion in low dimensions. In this paper, inspired by this theoretical insight,…
We consider the class of finitely generated groups which have a normal form computable in logspace. We prove that the class of such groups is closed under finite extensions, finite index subgroups, direct products, wreath products, and also…
On negatively curved compact manifolds, it is possible to associate to every closed form a bounded cocycle - hence a bounded cohomology class - via integration over straight simplices. The kernel of this map is contained in the space of…
We introduce $(k,l)$-regular maps, which generalize two previously studied classes of maps: affinely $k$-regular maps and totally skew embeddings. We exhibit some explicit examples and obtain bounds on the least dimension of a Euclidean…
We combine computable structure theory and algorithmic learning theory to study learning of families of algebraic structures. Our main result is a model-theoretic characterization of the class $\mathbf{InfEx}_{\cong}$, consisting of the…
Vector representations of graphs and relational structures, whether hand-crafted feature vectors or learned representations, enable us to apply standard data analysis and machine learning techniques to the structures. A wide range of…
This note is purely expository. In the course of the Kolmogorov-Arnold solution of Hilbert's 13th problem on superpositions there appeared the notion of basic embedding. A subset K of R^2 is basic if for each continuous function f:K->R…
The problem of embedding an ample semigroup in an inverse semigroup as a (2, 1, 1)-type subalgebra is known to be undecidable. In this article, we investigate the problem for certain classes of ample semigroups. We also give examples of…
Let A be a simple, unital, exact, and finite C*-algebra which absorbs the Jiang-Su algebra Z tensorially. We prove that the Cuntz semigroup of A admits a complete order embedding into an ordered semigroup obtained from the Elliott invariant…
In the context of Higman embeddings of recursive groups into finitely presented groups we suggest an algorithm which uses Higman operations to explicitly constructs the specific recursively enumerable sets of integer sequences arising…
We revisit the results on admissible transformations between normal linear systems of second-order ordinary differential equations with an arbitrary number of dependent variables under several appropriate gauges of the arbitrary elements…
Richter, Stephan, and Zhang asked whether every nonrecursive many-one degree contains a least finite-one degree. We solve this question in the negative, already within the class of computably enumerable many-one degrees. Positive answers…
We study integration and $L_2$-approximation on countable tensor products of function spaces of increasing smoothness. We obtain upper and lower bounds for the minimal errors, which are sharp in many cases including, e.g., Korobov, Walsh,…
The real cohomology of the space of imbeddings of S^1 into R^n, n>3, is studied by using configuration space integrals. Nontrivial classes are explicitly constructed. As a by-product, we prove the nontriviality of certain cycles of…
We define a bi-directional embedding between hypersequent calculi and a subclass of systems of rules (2-systems). In addition to showing that the two proof frameworks have the same expressive power, the embedding allows for the recovery of…
In [1] the authors showed some basic properties of a pre-order that arose in combinatorial number theory, namely the finite embeddability between sets of natural numbers, and they presented its generalization to ultrafilters, which is…
In this paper, we address computational questions surrounding the enumeration of non-isomorphic Andr\'e planes for any prime power order. We are particularly focused on providing a complete enumeration of all such planes for relatively…
Exceptional modular invariants for the Lie algebras B2 (at levels 2,3,7,12) and G2 (at levels 3,4) can be obtained from conformal embeddings. We determine the associated alge bras of quantum symmetries and discover or recover, as a…