Results 31 to 40 of about 165,977,654 (290)

NEUTROSOPHIC RINGS [PDF]

open access: yes, 2006
In this book we define the new notion of neutrosophic rings. The motivation for this study is two-fold. Firstly, the classes of neutrosophic rings defined in this book are generalization of the two well-known classes of rings: group rings and semigroup ...
Vasantha, Kandasamy   +2 more
core   +1 more source

Bounds for Coding Theory over Rings

open access: yesEntropy, 2022
Coding theory where the alphabet is identified with the elements of a ring or a module has become an important research topic over the last 30 years. It has been well established that, with the generalization of the algebraic structure to rings, there is
Niklas Gassner   +3 more
doaj   +1 more source

Smarandache rings [PDF]

open access: yes, 2002
Over the past 25 years, I have been immersed in research in Algebra and more particularly in ring theory. I embarked on writing this book on Smarandache rings (Srings) specially to motivate both ring theorists and Smarandache algebraists to develop and ...
Vasantha, Kandasamy
core   +1 more source

On some integral representations of groups and global irreducibility. [PDF]

open access: yesInternational Journal of Group Theory, 2018
Arithmetic aspects of integral representations of finite groups and their irreducibility are considered with a focus on globally irreducible representations and their generalizations to arithmetic rings.
Dmitry Malinin
doaj   +1 more source

An Algorithm for Finding Self-Orthogonal and Self-Dual Codes Over Gaussian and Eisenstein Integer Residue Rings Via Chinese Remainder Theorem

open access: yesIEEE Access, 2023
A code over Gaussian or Eisenstein integer residue ring is an additive group of vectors with entries in this integer residue ring which is closed under the action of constant multiplication by the Gaussian or Eisenstein integers. In this paper, we define
Hajime Matsui
doaj   +1 more source

SMARANDACHE NON-ASSOCIATIVE RINGS [PDF]

open access: yes, 2002
An associative ring is just realized or built using reals or complex; finite or infinite by defining two binary operations on it. But on the contrary when we want to define or study or even introduce a non-associative ring we need two separate algebraic ...
Vasantha, Kandasamy
core   +1 more source

Neutrosophic triplets in some neutrosophic rings

open access: yesCumhuriyet Science Journal, 2020
In this paper, some mistakes about the neutrosophic triplets of some neutrosophic rings in the literature are pointed out and corrected. For this purpose, the neutrosophic triplets in neutrosophic rings , and where Z, Q and R denote the ring of ...
Doğukan Ozan, Yilmaz Çeven
doaj   +1 more source

Tripotents: a class of strongly clean elements in rings

open access: yesAnalele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2018
Periodic elements in a ring generate special classes of strongly clean elements. In particular, elements b such that b = b3+, which are called tripotents and include idempotents, negative of idempotents and order 2 units, are strongly clean.
Călugăreanu Grigore
doaj   +1 more source

On structure of certain periodic rings and near-rings

open access: yesInternational Journal of Mathematics and Mathematical Sciences, 2000
The aim of this work is to study a decomposition theorem for rings satisfying either of the properties xy=xpf(xyx)xq or xy=xpf(yxy)xq, where p=p(x,y),q=q(x,y) are nonnegative integers and f(t)∈tℤ[t] vary with the pair of elements x,y, and further ...
Moharram A. Khan
doaj   +1 more source

Rings of Multisets and Integer Multinumbers [PDF]

open access: yesMathematics, 2022
In the paper, we consider a ring structure on the Cartesian product of two sets of integer multisets. In this way, we introduce a ring of integer multinumbers as a quotient of the Cartesian product with respect to a natural equivalence. We examine the properties of this ring and construct some isomorphisms to subrings of polynomials and Dirichlet ...
Yuriy Chopyuk   +2 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy