Results 11 to 20 of about 1,616,014 (220)

Finite Commutative Chain Rings [PDF]

open access: yesFinite Fields and Their Applications, 2001
A commutative ring with unit is called a chain ring if all its ideals form a chain under inclusion. All finite chain rings can be obtained in the following way: Let \(p\) be a prime, \(n,r>0\), \(f\in \mathbb{Z}_{p^n}[X]\) a monic polynomial, \(\deg(f)=r\) whose image in \(\mathbb{Z}_p[X]\) is irreducible and let \(\text{GR} (p^n,r): =\mathbb{Z}_{p^n ...
Hou, Xiang-dong, Xiang-dong Hou
openaire   +2 more sources

Polynomial orbits in finite commutative rings [PDF]

open access: yesCzechoslovak Mathematical Journal, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Konečná, Petra
openaire   +3 more sources

Interpretability and Representability of Commutative Algebra, Algebraic Topology, and Topological Spectral Theory for Real-World Data. [PDF]

open access: yesAdv Intell Discov
This article investigates how persistent homology, persistent Laplacians, and persistent commutative algebra reveal complementary geometric, topological, and algebraic invariants or signatures of real‐world data. By analyzing shapes, synthetic complexes, fullerenes, and biomolecules, the article shows how these mathematical frameworks enhance ...
Ren Y, Wei GW.
europepmc   +2 more sources

The Mathematical Safe Problem and Its Solution (Part 2)

open access: yesКібернетика та комп'ютерні технології, 2021
Introduction. The problem of mathematical safe arises in the theory of computer games and cryptographic applications. The article considers numerous variations of the mathematical safe problem and examples of its solution using systems of linear ...
Sergii Kryvyi, Hryhorii Hoherchak
doaj   +1 more source

On generalized probability in finite commutative rings

open access: yesInternational Electronic Journal of Algebra, 2023
Let $R$ be a finite commutative ring with unity and $x\in R$. We study the probability that the product of two randomly chosen elements (with replacement) of $R$ equals $x$. We denote this probability by $Prob_x (R)$. We determine some bounds for this probability and also obtain some characterizations of finite commutative rings based on this ...
REHMAN, Shafiq Ur   +1 more
openaire   +2 more sources

Some Examples of BL-Algebras Using Commutative Rings

open access: yesMathematics, 2022
BL-algebras are algebraic structures corresponding to Hajek’s basic fuzzy logic. The aim of this paper is to analyze the structure of BL-algebras using commutative rings. Due to computational considerations, we are interested in the finite case.
Cristina Flaut, Dana Piciu
doaj   +1 more source

Finite rings in which commutativity is transitive [PDF]

open access: yesMonatshefte für Mathematik, 2009
Let \(R\) denote a ring with Jacobson radical \(J(R)\) and center \(Z(R)\). Define \(R\) to be commutative transitive (CT) if commutativity is a transitive relation on \(R\setminus\{0\}\) and weakly commutative transitive (wCT) if commutativity is transitive on \(R\setminus Z(R)\).
Dolžan, David   +2 more
openaire   +2 more sources

Enumeration of Neutrosophic Involutions over Finite Commutative Neutrosophic Rings [PDF]

open access: yesNeutrosophic Sets and Systems, 2023
A finite commutative ring involution is the multiplicative inverse of the element attribute R is the element itself. This classical characteristic of a finite commutative ring makes Neutrosophic involutions possible, which are counted, listed and ...
T. Chalapathi   +2 more
doaj   +1 more source

Planar, Outerplanar, and Toroidal Graphs of the Generalized Zero-Divisor Graph of Commutative Rings

open access: yesJournal of Mathematics, 2021
Let A be a commutative ring with unity and let set of all zero divisors of A be denoted by ZA. An ideal ℐ of the ring A is said to be essential if it has a nonzero intersection with every nonzero ideal of A. It is denoted by ℐ≤eA.
Abdulaziz M. Alanazi   +2 more
doaj   +1 more source

Definability of linear equation systems over groups and rings [PDF]

open access: yesLogical Methods in Computer Science, 2013
Motivated by the quest for a logic for PTIME and recent insights that the descriptive complexity of problems from linear algebra is a crucial aspect of this problem, we study the solvability of linear equation systems over finite groups and rings from ...
Anuj Dawar   +4 more
doaj   +1 more source

Home - About - Disclaimer - Privacy