Results 91 to 100 of about 1,460,755 (212)
An Algebraic Study of Parametric Stokes Phenomena
Studies 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
Bulletin 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
τ-IRREDUCIBLE DIVISOR GRAPHS IN COMMUTATIVE RINGS WITH ZERO-DIVISORS
International Electronic Journal of Algebra, 2015 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 the genus of graphs from commutative rings
AKCE 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
On the Foundational Arguments of Sufficient Dimension Reduction
WIREs 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
Generalizations and Variations of the Zero-Divisor Graph [PDF]
, 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
Zero-divisor graphs of idealizations
, 2006 We consider zero-divisor graphs of idealizations of commutative rings. Specifically, we look at the preservation, or lack thereof, of the diameter and girth of the zero-divisor graph of a ring when extending to idealizations of the ...
Stickles, Joe, Axtell, Michael
core +1 more source
Annals 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
Adjacency spectra and Laplacian integrality of zero divisor graphs over some rings
Kuwait Journal of ScienceLet 𝑅 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
The N‐prime graph and the Subgroup Isomorphism Problem
Journal of the London Mathematical Society, Volume 113, Issue 6, June 2026.Abstract We introduce a directed graph related to a group G$G$, which we call the N‐prime graph ΓN(G)$\Gamma _{\rm {N}}(G)$ of G$G$ and is a refinement of the classical Gruenberg–Kegel graph. The vertices of ΓN(G)$\Gamma _{\rm {N}}(G)$ are the primes p$p$ such that G$G$ has an element of order p$p$, and, for distinct vertices p$p$ and q$q$, the arc q→p$
Emanuele Pacifici +2 more
wiley +1 more source