Results 81 to 90 of about 7,874 (214)

Traces of Hecke operators on Drinfeld modular forms for GL2(Fq[T])$\operatorname{GL}_2(\mathbb {F}_q[T])$

open access: yesMathematika, Volume 72, Issue 2, April 2026.
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

On the genus of graphs from commutative rings

open access: yesAKCE International Journal of Graphs and Combinatorics, 2017
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 Zero-Divisor Graphs of Variation Monogenic Semigroups

open access: yesScientific Journal of King Faisal University: Basic and Applied Sciences, 2020
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

Efficient Scheduling Algorithms for Multicore Cyclic Executives With Precedence and Exclusion Relations

open access: yesConcurrency and Computation: Practice and Experience, Volume 38, Issue 5, March 2026.
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 Congruence-Based Zero-Divisor Graph

open access: yes, 2015
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  

Simplification of exponential factors of irregular connections on P1${\mathbb {P}}^1$

open access: yesBulletin of the London Mathematical Society, Volume 58, Issue 3, March 2026.
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

Zero-Divisor Graph of Commutative Ring ℤp1q1 x ℤp2q2

open access: yes, 2023
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  

Hosoya and Wiener Index of Zero-Divisor Graph of Z pm q2

open access: yesZanco Journal of Pure and Applied Sciences, 2019
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

The DNA of Calabi–Yau Hypersurfaces

open access: yesFortschritte der Physik, Volume 74, Issue 2, February 2026.
Abstract Genetic Algorithms are implemented for triangulations of four‐dimensional reflexive polytopes, which induce Calabi–Yau threefold hypersurfaces via Batyrev's construction. These algorithms are shown to efficiently optimize physical observables such as axion decay constants or axion–photon couplings in string theory compactifications.
Nate MacFadden   +2 more
wiley   +1 more source

Adjacency spectra and Laplacian integrality of zero divisor graphs over some rings

open access: yesKuwait Journal of Science
Let 𝑅 be a commutative ring and let 𝑍∗ (𝑅) denote the set of non-zero zero divisors of 𝑅. The zero divisor graph 𝛤(𝑅) is defined as the simple graph with vertex set 𝑍∗ (𝑅), where two distinct vertices 𝑥, 𝑦 ∈ 𝑍∗ (𝑅) are adjacent if and only if 𝑥𝑦 = 0.
Bilal Ahmad Rather   +3 more
doaj   +1 more source

Home - About - Disclaimer - Privacy