Results 51 to 60 of about 600 (179)
Commutative rings with ideal based zero divisor graph of orders 12,13 and 14 [PDF]
An recent years, several studies have emerged on the graphs for commutative rings. Researchers have investigated ideal based zero-divisor graphs linked to commutative rings, delving into the characteristics of these graphs.
Raad Shukur, Husam Mohammad
doaj +1 more source
Converting an Integer to a Decimal String in Under Two Nanoseconds
ABSTRACT Objective Converting binary integers to variable‐length decimal strings is a fundamental operation in computing. Conventional fast approaches rely on recursive division and small lookup tables. The goal of this work is to develop a significantly faster method for this task.
Jaël Champagne Gareau, Daniel Lemire
wiley +1 more source
An Algebraic Study of Parametric Stokes Phenomena
ABSTRACT We investigate geometric aspects of co‐equational parametric resurgence, by studying physical problems whose formal asymptotic solutions give rise to Borel transforms lying on an algebraic curve. This perspective allows us to elucidate concepts unique to parametric resurgence such as singularity structures, (virtual) turning points, and the ...
Inês Aniceto, Samuel Crew
wiley +1 more source
Computing Wiener and Hyper-Wiener Indices of Zero-Divisor Graph of ℤℊ3×ℤI1I2
Let S=ℤℊ3×ℤI1I2 be a commutative ring where ℊ,I1 and I2 are positive prime integers with I1≠I2. The zero-divisor graph assigned to S is an undirected graph, denoted as YS with vertex set V(Y(S)) consisting of all Zero-divisor of the ring S and for any c,
Yonghong Liu +4 more
doaj +1 more source
The Zero-Divisor Graph of a Commutative Ring
The authors study properties of the graph \(\Gamma(R)\) of a commuting ring \(R\) (with \(1\)) defined on the set of nonzero zero-divisors with adjacency relation \((x,y)\in E\) if \(xy= 0\) noting that the class of such graphs is strongly restricted by the (commutative) ring properties of \(R\).
Anderson, David F. +1 more
openaire +1 more source
Abstract How hard is it to program n$n$ robots to move about a long narrow aisle while making a series of r−2$r-2$ intermediate stops, provided only w$w$ of the robots can fit across the width of the aisle? In this paper, we answer this question by calculating the rth$r{\text{th}}$‐sequential topological complexity of conf(n,w)$\text{conf}(n,w)$, the ...
Nicholas Wawrykow
wiley +1 more source
Exploring the properties of the zero-divisor graph of direct product of $\ast$-rings [PDF]
In this paper, we delve into the study of zero-divisor graphs in rings equipped with an involution. Specifically, we focus on abelian Rickart $\ast$-rings.
Mohd Nazim +2 more
doaj +1 more source
On Normalized Laplacian Spectra of the Weakly Zero-Divisor Graph of the Ring ℤn
For a finite commutative ring R with identity 1≠0, the weakly zero-divisor graph of R denoted as WΓ(R) is a simple undirected graph having vertex set as a set of non-zero zero-divisors of R and two distinct vertices a and b are adjacent if and only if ...
Nazim, Nadeem Ur Rehman, Ahmad Alghamdi
doaj +1 more source
On zero-divisor graphs of finite rings
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Akbari, S., Mohammadian, A.
openaire +2 more sources
On the Foundational Arguments of Sufficient Dimension Reduction
Contemporary Sufficient Dimension Reduction, a versatile method for extracting material information from data, can serve as a preprocessor for classical modeling and inference, or as a standalone theory that leads directly to statistical inference. ABSTRACT Sufficient dimension reduction (SDR) refers to supervised methods of dimension reduction that ...
R. Dennis Cook
wiley +1 more source

