Results 81 to 90 of about 969 (214)
Abstract In this paper, we study traces of Hecke operators on Drinfeld modular forms of level 1 in the case A=Fq[T]$A = \mathbb {F}_q[T]$. We deduce closed‐form expressions for traces of Hecke operators corresponding to primes of degree at most 2 and provide algorithms for primes of higher degree.
Sjoerd de Vries
wiley +1 more source
τ-IRREDUCIBLE DIVISOR GRAPHS IN COMMUTATIVE RINGS WITH ZERO-DIVISORS
In this paper, we continue the program initiated by I. Beck's now classical paper concerning zero-divisor graphs of commutative rings. After the success of much research regarding zero-divisor graphs, many authors have turned their attention to studying divisor graphs of non-zero elements in integral domains.
openaire +4 more sources
On endomorphism-regularity of zero-divisor graphs
Let \(G\) be a graph and \(\text{End}(G)\) the semigroup consisting of all the endomorphisms of \(G\). An element \(a\) of a semigroup \(S\) is called regular if \(a=aba\) for some \(b\in S\), and \(S\) is called regular if every element in \(S\) is regular. A graph \(G\) is called end-regular if \(\text{End}(G)\) is regular.
Dancheng Lu, Tongsuo Wu
openaire +1 more source
On the genus of graphs from commutative rings
Let be a commutative ring with non-zero identity. The cozero-divisor graph of , denoted by , is a graph with vertex-set , which is the set of all non-zero non-unit elements of , and two distinct vertices and in are adjacent if and only if and , where for
S. Kavitha, R. Kala
doaj +1 more source
The Congruence-Based Zero-Divisor Graph
Let R be a commutative ring with nonzero identity and ~ a multiplicative congruence relation on R. Then, R/~ is a semigroup with multiplication [x][y] = [xy], where [x] is the congruence class of an element x of R.
Lewis, Elizabeth Fowler
core
ABSTRACT Cyclic executives (CEs) offer the advantage of ensuring complete determinism with minimal runtime overhead, often making them the preferred choice for safety‐critical real‐time systems. However, generating CEs for multicore processors while addressing task precedence and exclusion relations presents significant challenges.
Bruno Nogueira +4 more
wiley +1 more source
The Zero-Divisor Graphs of Variation Monogenic Semigroups
The undirected graph Γ(〖VS〗_Mn) is the zero-divisor graph of the monogenic semigroup SM with zero. The non-zero vertices xi and xj of this graph are adjacent whenever i + j > n and gcd(i,j)=1, where n is the order of Γ(〖VS〗_Mn).
Bana Jawid Al Subaiei +1 more
doaj +1 more source
Zero-Divisor Graph of Commutative Ring ℤp1q1 x ℤp2q2
A commutative ring R with zero-divisor Z(R), represented into the zero-divisor graph r(R) whose vertices consist of x,yeZ(R), with distinct vertices x and y adjacent if and only if xy=0.
Siregar, Husna Zahidah Slawat
core
Simplification of exponential factors of irregular connections on P1${\mathbb {P}}^1$
Abstract We give an explicit algorithm to reduce the ramification order of any exponential factor of an irregular connection on P1$\mathbb {P}^1$, using the same types of basic operations as in the Katz–Deligne–Arinkin algorithm for rigid irregular connections.
Jean Douçot
wiley +1 more source
Hosoya and Wiener Index of Zero-Divisor Graph of Z pm q2
In this work, we study zero-divisor graph of the ring Zpmq2 and give some properties of this graph. Furthermore we find Hosoya polynomial and Wiener index for this graph.
Nazar H. Shuker +2 more
doaj +1 more source

