Results 111 to 120 of about 1,179,667 (236)

Computably Enumerable Semisimple Rings

Mathematics
The theory of semisimple rings plays a fundamental role in noncommutative algebra. We study the complexity of the problem of semisimple rings using the tools of computability theory. Following the general idea of computably enumerable (c.e.
Huishan Wu
doaj   +1 more source

On the M2-Brane Index on Noncommutative Crepant Resolutions. [PDF]

Lett Math Phys, 2022
Cirafici M.
europepmc   +1 more source

The Mass Formula for Self-Orthogonal and Self-Dual Codes over a Non-Unitary Non-Commutative Ring

Mathematics
In this paper, we derive a mass formula for the self-orthogonal codes and self-dual codes over a non-commutative non-unitary ring, namely, Ep=a,b|pa=pb=0,a2=a,b2=b,ab=a,ba=b, where a≠b and p is any odd prime.
Adel Alahmadi, Altaf Alshuhail, Rowena Alma Betty, Lucky Galvez, Patrick Solé   +4 more
doaj   +1 more source

The build up construction for codes over a non-commutative non-unitary ring of order 9

AIMS Mathematics
The build-up method is a powerful class of propagation rules that generate self-dual codes over finite fields and unitary rings. Recently, it was extended to non-unitary rings of order four to generate quasi self-dual codes.
Adel Alahmadi, Tamador Alihia , Patrick Solé   +2 more
doaj   +1 more source

The theory of ${\frak O}$-ideals of noncommutative rings [PDF]

, 1962
Oldřich Kowalski
openalex   +1 more source

Book Review: Noncommutative rings [PDF]

, 1969
María J. Wonenburger
openalex   +1 more source

On the relation between one-sided duoness and commutators

Open Mathematics
This article studies the structure of rings RR over which the 2×22\times 2 upper triangular matrix rings with the same diagonal are right duo, denoted by D2(R){D}_{2}\left(R).
Kim Nam Kyun, Lee Yang
doaj   +1 more source

Gorenstein homomorphisms of noncommutative rings

Journal of Algebra, 1999
AS-Gorenstein ...
openaire   +2 more sources

Categorical Torelli theorems: results and open problems. [PDF]

Rend Circ Mat Palermo, 2023
Pertusi L, Stellari P.
europepmc   +1 more source

The Computational Complexity of Subclasses of Semiperfect Rings

Mathematics
This paper studies the computational complexity of subclasses of semiperfect rings from the perspective of computability theory. A ring is semiperfect if the identity can be expressed as a sum of mutually orthogonal local idempotents.
Huishan Wu
doaj   +1 more source