Related papers: Computable embeddings for pairs of linear orders

We propose a quantum computer structure based on coupled asymmetric single-electron quantum dots. Adjacent dots are strongly coupled by means of electric dipole-dipole interactions enabling rapid computation rates. Further, the asymmetric…

We introduce a novel embedding method diverging from conventional approaches by operating within function spaces of finite dimension rather than finite vector space, thus departing significantly from standard knowledge graph embedding…

We explore in depth how categorical data can be processed with embeddings in the context of claim severity modeling. We develop several models that range in complexity from simple neural networks to state-of-the-art attention based…

While every matrix admits a singular value decomposition, in which the terms are pairwise orthogonal in a strong sense, higher-order tensors typically do not admit such an orthogonal decomposition. Those that do have attracted attention…

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 deal with some aspects of the theory of conformal embeddings of affine vertex algebras, providing a new proof of the Symmetric Space Theorem and a criterion for conformal embeddings of equal rank subalgebras. We finally study some…

An algebraic variety X is embedded to the order k via a line bundle L if the global sections of L generate all (simultaneous) jets of order k on X or if they separate all zero-dimensional subschemes of length at most k+1. Even though we…

We study open equivariant projective embeddings of homogeneous spaces such that the complement of the open orbit does not contain divisors. Criterions of existence of such an embedding are considered and finiteness of isomorphism classes of…

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…

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…

A rectangular partition is the partition of an (axis-aligned) rectangle into interior-disjoint rectangles. We ask whether a rectangular partition permits a "nice" drawing of its dual, that is, a straight-line embedding of it such that each…

Quantum steering describes the ability of one observer to nonlocally affect the other observer's state through local measurements, which represents a new form of quantum nonlocal correlation and has potential applications in quantum…

We consider the problem of computing the integrable sub-distributions of the non-integrable Vessiot distribution of multi-dimensional second order partial differential equations (PDEs). We use Vessiot theory and solvable structures to find…

In this paper, the class of all linearly ordered topological spaces (LOTS) quasi-ordered by the embeddability relation is investigated. In ZFC it is proved that for countable LOTS this quasi-order has both a maximal (universal) element and…

We prove that the isometric embedding of any metric of differentiability class C1 in E3 exists. We use simplified notation for the given metric, namely geodesic parameters, and level parameters for the embedded surface in E3. Central to our…

We show that unital simple C*-algebras with tracial topological rank zero which are locally approximated by subhomogeneous C^-algebras can be classified by their ordered $K$-theory. We apply this classification result to show that certain…

We prove optimal bounds for the convergence rate of ordinal embedding (also known as non-metric multidimensional scaling) in the 1-dimensional case. The examples witnessing optimality of our bounds arise from a result in additive number…

This paper investigates some issues arising in categorical models of reversible logic and computation. Our claim is that the structural (coherence) isomorphisms of these categorical models, although generally overlooked, have decidedly…

Louveau and Rosendal [5] have shown that the relation of bi-embeddability for countable graphs as well as for many other natural classes of countable structures is complete under Borel reducibility for analytic equivalence relations. This…

Consider a finite-dimensional real vector space equipped with a finite group acting unitarily on it. We address the general problem of constructing Euclidean stable embeddings of the quotient space of orbits. Our approach is based on…