English
Related papers

Related papers: Turing Degrees of Isomorphism Types of Algebraic O…

200 papers

To what extent does the maximal subfield spectrum of a division algebra determine the isomorphism class of that algebra? It has been shown that over some fields a quaternion division algebra's isomorphism class is largely if not entirely…

Rings and Algebras · Mathematics 2014-08-14 Jeffrey S. Meyer

Let $A$ and $B$ be two connected graded algebras finitely generated in degree one. If $A$ is isomorphic to $B$ as ungraded algebras, then they are also isomorphic to each other as graded algebras.

Rings and Algebras · Mathematics 2015-09-30 Jason Bell , James J. Zhang

We prove that there is a structure, indeed a linear ordering, whose degree spectrum is the set of all non-hyperarithmetic degrees. We also show that degree spectra can distinguish measure from category.

Logic · Mathematics 2011-10-11 Noam Greenberg , Antonio Montalban , Theodore Slaman

Classification is an important goal in many branches of mathematics. The idea is to describe the members of some class of mathematical objects, up to isomorphism or other important equivalence in terms of relatively simple invariants. Where…

Logic · Mathematics 2008-03-25 Wesley Calvert , Julia F. Knight

Given a countable o-minimal theory T, we characterize the Borel complexity of isomorphism for countable models of T up to two model-theoretic invariants. If T admits a nonsimple type, then it is shown to be Borel complete by embedding the…

Logic · Mathematics 2015-10-19 Richard Rast , Davender Singh Sahota

We show that there are Turing complete computably enumerable sets of arbitrarily low non-trivial initial segment prefix-free complexity. In particular, given any computably enumerable set $A$ with non-trivial prefix-free initial segment…

Logic · Mathematics 2013-11-28 George Barmpalias

Recent results on initial segments of the Turing degrees are presented, and some conjectures about initial segments that have implications for the existence of non-trivial automorphisms of the Turing degrees are indicated.

Logic · Mathematics 2016-06-27 Bjørn Kjos-Hanssen

We classify, up to isomorphism, the group gradings on the non-exceptional classical simple Lie superalgebras, except for type A(1,1), over an algebraically closed field of characteristic zero. To this end, we study graded-simple and…

Rings and Algebras · Mathematics 2025-07-01 Caio De Naday Hornhardt , Mikhail Kochetov

We describe the graded isomorphisms of rings of endomorphisms of graded flags over graded division algebras. As a consequence describe the isomorphism classes of upper block triangular matrix algebras (over an algebraically closed field of…

Rings and Algebras · Mathematics 2021-07-26 Alex Ramos , Claudemir Fidelis , Diogo Diniz

We study connections between classical asymptotic density and c.e. sets. We prove that a c.e. Turing degree d is not low if and only if d contains a c.e. set A of density 1 which has no computable subsets of density 1, giving a natural…

Logic · Mathematics 2013-07-02 Rodney G. Downey , Carl G. Jockusch , Paul E. Schupp

In this work, we classify the group gradings on finite-dimensional incidence algebras over a field, where the field has characteristic zero, or the characteristic is greater than the dimension of the algebra, or the grading group is…

Rings and Algebras · Mathematics 2024-02-06 Ednei A. Santulo , Jonathan P. Souza , Felipe Y. Yasumura

The classification, both up to isomorphism or up to equivalence, of the gradings on a finite dimensional nonassociative algebra A over an algebraically closed field F, such that its group scheme of automorphisms is smooth, is shown to be…

Rings and Algebras · Mathematics 2014-07-03 Alberto Elduque

An amorphic association scheme has the property that any of its fusion is also an association scheme. In this paper we generalize the property to be amorphic to an arbitrary C-algebra and prove that any amorphic C-algebra is determined up…

Combinatorics · Mathematics 2007-05-23 Ilia Ponomarenko , A. Rahnamai Barghi

In previous work, we have combined computable structure theory and algorithmic learning theory to study which families of algebraic structures are learnable in the limit (up to isomorphism). In this paper, we measure the computational power…

Logic · Mathematics 2021-06-29 Nikolay Bazhenov , Luca San Mauro

We are studying the degrees in which a computable structure is relatively computably categoricity, i.e., computably categorcial among all non-computable copies of the structure. Unlike the degrees of computable categoricity we can bound the…

Logic · Mathematics 2023-04-07 I. Sh. Kalimullin

Using new techniques for controlling the categoricity spectrum of a structure, we construct a structure with degree of categoricity but infinite spectral dimension, answering a question of Bazhenov, Kalimulin and Yamaleev. Using the same…

Logic · Mathematics 2020-01-29 Dan Turetsky

Let $R$ be a finite-dimensional algebra over an algebraically closed field $F$ graded by an arbitrary group $G$. We prove that $R$ is a graded division algebra if and only if it is isomorphic to a twisted group algebra of some finite…

Rings and Algebras · Mathematics 2007-05-23 Y. A. Bahturin , S. K. Sehgal , M. V. Zaicev

We classify all division algebras that are principal Albert isotopes of a cyclic Galois field extension of degree $n>2$ up to isomorphisms. We achieve a ``tight'' classification when the cyclic Galois field extension is cubic. The…

Rings and Algebras · Mathematics 2025-02-28 Susanne Pumpluen

For a given abelian group G, we classify the isomorphism classes of G-gradings on the simple Lie algebras of types A_n (n >= 1), B_n (n >= 2), C_n (n >= 3) and D_n (n > 4), in terms of numerical and group-theoretical invariants. The ground…

Rings and Algebras · Mathematics 2012-12-04 Yuri Bahturin , Mikhail Kotchetov

We study algebras k[x_1,...,x_n]/I which admit a grading by a subsemigroup of N^d such that every graded component is a one-dimensional k-vector space. V.I.~Arnold and coworkers proved that for d = 1 and n <= 3 there are only finitely many…

alg-geom · Mathematics 2008-02-03 Bernd Sturmfels