Results 71 to 80 of about 1,397,791 (213)

Algebraic Structure Graphs over the Commutative Ring Zm: Exploring Topological Indices and Entropies Using M-Polynomials

open access: yesMathematics, 2023
The field of mathematics that studies the relationship between algebraic structures and graphs is known as algebraic graph theory. It incorporates concepts from graph theory, which examines the characteristics and topology of graphs, with those from ...
Amal S. Alali   +5 more
doaj   +1 more source

The asymptotic Mahler measure of Gaussian periods

open access: yesProceedings of the London Mathematical Society, Volume 133, Issue 2, August 2026.
Abstract We construct a sequence of cyclotomic integers (Gaussian periods) of particularly small Mahler measure/height. We study the asymptotics of their Mahler measure as a function of their conductor, to find that the growth rate is the (multivariate) Mahler measure of a family of log Calabi–Yau varieties of increasing dimension.
Gunther Cornelissen   +2 more
wiley   +1 more source

Generalizations and Variations of the Zero-Divisor Graph [PDF]

open access: yes, 2017
We explore generalizations and variations of the zero-divisor graph on commutative rings with identity. A zero-divisor graph is a graph whose vertex set is the nonzero zero-divisors of a ring, wherein two distinct vertices are adjacent if their product ...
McClurkin, Grace Elizabeth
core  

An Algebraic Study of Parametric Stokes Phenomena

open access: yesStudies in Applied Mathematics, Volume 157, Issue 1, July 2026.
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

On Join Graph Of Zero-Divisor Graphs Of Direct Product Of Finite Fields

open access: yes, 2023
I. Beck introduced the concept of Zero-divisor graph of a commutative ring R with all the elements of ring R as vertices and two distinct vertices x, y are adjacent if and only if x · y = 0.
Subhash Mallinath Gaded   +1 more
core   +1 more source

The sequential (distributional) topological complexity of the ordered configuration space of disks in a strip

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

Strong zero-divisor graph of p.q.-Baer $*$-rings [PDF]

open access: yes
In this paper, we study the strong zero-divisor graph of a p.q.-Baer $*$-ring. We determine the condition on a p.q.-Baer $*$-ring (in terms of the smallest central projection in a lattice of central projections of a $*$-ring), so that its strong zero ...
Waphare, B. N.   +2 more
core   +1 more source

On the Foundational Arguments of Sufficient Dimension Reduction

open access: yesWIREs Computational Statistics, Volume 18, Issue 2, June 2026.
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

On endomorphism-regularity of zero-divisor graphs

open access: yesDiscrete Mathematics, 2008
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

Enhancing Preclinical Rigor: Evaluating Robustness and Numerical Stability in a Chronic Pancreatitis Mouse Model

open access: yesAnnals of the New York Academy of Sciences, Volume 1560, Issue 1, June 2026.
In a modified cerulein‐induced chronic pancreatitis (CP) mouse model, key hallmarks of CP were robustly induced in male and female C57BL/6J (BL6) and BALB/c mice, whereas cytokine responses varied partly according to strain and sex. The RORγt inhibitor GSK805 reduced Il23r expression in the BL6 strain, significantly decreased collagen I deposition and ...
Annika Thämlitz   +5 more
wiley   +1 more source

Home - About - Disclaimer - Privacy