English
Related papers

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

200 papers

We study degree spectra of structures with respect to the bi-embeddability relation. The bi-embeddability spectrum of a structure is the family of Turing degrees of its bi-embeddable copies. To facilitate our study we introduce the notions…

Logic · Mathematics 2019-04-03 Ekaterina Fokina , Dino Rossegger , Luca San Mauro

A set A of natural numbers is finitely embeddable in another such set B if every finite subset of A has a rightward translate that is a subset of B. This notion of finite embeddability arose in combinatorial number theory, but in this paper…

Logic · Mathematics 2015-12-11 Andreas Blass , Mauro Di Nasso

We prove that over an algebraically closed field there is a representation embedding from the category of classical Kronecker-modules without the simple injective into the category of finite-dimensional modules over any…

Representation Theory · Mathematics 2023-05-30 Klaus Bongartz

Friedman and Stanley developed the notion of Borel reducibility and illustrated its use in comparing classification problems for some familiar classes of countable structures. For many embeddings, the fact that the embedding is $1-1$ on…

Logic · Mathematics 2026-05-07 David Gonzalez , Julia Knight

The structure of non-compactness of optimal Sobolev embeddings of $m$-th order into the class of Lebesgue spaces and into that of all rearrangement-invariant function spaces is quantitatively studied. Sharp two-sided estimates of Bernstein…

Functional Analysis · Mathematics 2023-03-01 Jan Lang , Zdeněk Mihula

A closed algebraic embedding of $\mathbb{C}^*=\mathbb{C}^1\setminus\{0\}$ into $\mathbb{C}^2$ is 'sporadic' if for every curve $A\subseteq \mathbb{C}^2$ isomorphic to an affine line the intersection with $\mathbb{C}^*$ is at least $2$.…

Algebraic Geometry · Mathematics 2019-04-30 Mariusz Koras , Karol Palka , Peter Russell

Let A,B be finite dimensional G-graded algebras over an algebraically closed field K with char(K)=0, where G is an abelian group, and let Id_G(A) be the set of graded identities of A (res. Id_G(B)). We show that if A,B are G-simple then…

Rings and Algebras · Mathematics 2012-12-04 Ofir David

Given a nonempty set $\mathcal{L}$ of linear orders, we say that the linear order $L$ is $\mathcal{L}$-convex embeddable into the linear order $L'$ if it is possible to partition $L$ into convex sets indexed by some element of $\mathcal{L}$…

Logic · Mathematics 2025-05-06 Martina Iannella , Alberto Marcone , Luca Motto Ros , Vadim Weinstein

A computable ring is a ring equipped with mechanical procedure to add and multiply elements. In most natural computable integral domains, there is a computational procedure to determine if a given element is prime/irreducible. However,…

Logic · Mathematics 2014-07-23 Leigh Evron , Joseph R. Mileti , Ethan Ratliff-Crain

We give a~detailed construction of the complete ordered field of real numbers by means of infinite decimal expansions. We prove that in the canonical encoding of decimals neither addition nor multiplication is {\em computable}, but that…

Logic · Mathematics 2021-08-05 Martin Klazar

Let $B$ be a central simple algebra of degree 3 over a number field $F$ and $K/F$ be a finite extension of degree 3. For an order $S$ of $K$, we determine exactly when $S$ cannot be optimally embedded into all maximal orders of $B$.…

Number Theory · Mathematics 2026-05-06 Yuxuan Yang

The study of graph drawings on 2-surfaces is an active area of mathematical research. Our main results are criteria for integer and modulo 2 embeddability of graphs to surfaces.

Combinatorics · Mathematics 2021-11-17 Arthur Bikeev

While there is a well-established notion of what a computable ordinal is, the question which functions on the countable ordinals ought to be computable has received less attention so far. We propose a notion of computability on the space of…

Logic in Computer Science · Computer Science 2017-04-11 Arno Pauly

We show that, for each ordinal $\alpha<\omega_1$, the space $C([0,\omega^\alpha])$ does not embed into $C(K)$ with distortion strictly less than $2$ unless $K^{(\alpha)}\neq \emptyset$.

Functional Analysis · Mathematics 2014-08-04 Antonín Procházka , Luis Sánchez-González

We show that there is an order-preserving embedding of the additive group of rational numbers $\mathbb{Q}$ into a 2-generator group $G$. The group $G$ can be chosen to be a solvable group $G$ of length 3, which is a minimal result in the…

Group Theory · Mathematics 2012-01-27 Arman Darbinyan , Vahagn H. Mikaelian

We prove a necessary and sufficient condition for embeddability of an operator system into $\mathcal{O}_2$. Using Kirchberg's theorems on a tensor product of $\mathcal{O}_2$ and $\mathcal{O}_{\infty}$, we establish results on their operator…

Operator Algebras · Mathematics 2017-03-02 Preeti Luthra , Ajay Kumar

We show that in $K$-theory-like categories many corner embeddings into a discrete algebra of compact operators are invertible, and consequently functors on splitexact algebraic $KK$-theory are faithful if and only if they are faithful on…

K-Theory and Homology · Mathematics 2025-01-22 Bernhard Burgstaller

For any even natural number $r \ge 2$, we construct an irreducible rigid non-cohomologically rigid complex local system of rank $r$ on a smooth projective variety depending on $r$. For $r=2$, we construct an irreducible rigid…

Algebraic Geometry · Mathematics 2022-08-30 Johan de Jong , Hélène Esnault , Michael Groechenig

We prove that an arbitrary countable dimensional Lie algebra over a field of characteristic $\neq 2$ that is locally of subexponential growth is embeddable in a finitely generated Lie algebra of subexponential growth.

Rings and Algebras · Mathematics 2017-12-21 Adel Alahmadi , Hamed Alsulami

Intrinsic complexity of a relation on a given computable structure is captured by the notion of its degree spectrum - the set of Turing degrees of images of the relation in all computable isomorphic copies of that structure. We investigate…

Logic · Mathematics 2021-10-05 Nikolay Bazhenov , Dariusz Kalociński , Michał Wrocławski