Results 41 to 50 of about 362 (137)

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

Bulletin 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

The DNA of Calabi–Yau Hypersurfaces

Fortschritte 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, Andreas Schachner, Elijah Sheridan   +2 more
wiley   +1 more source

A New Type of Zero Divisor Graphs of a Lattice, t-Zero Divisor Graphs

Turkish Journal of Mathematics and Computer Science
In this paper, we introduce the t-zero divisor graph $\Gamma_{T}(L)$, which is a generalization of the zero divisor graph of a lattice $\Gamma(L)$, where $t$ is a triangular norm on $L$. We investigate which properties hold in $t$-zero divisor graphs for special $t$-norms while giving some additional properties of the zero divisor graph.
openaire   +2 more sources

Generalized zero-divisor graph of ∗-rings

Asian-European Journal of Mathematics
A ∗-ring [Formula: see text] is a ring with an involution ∗. Let [Formula: see text] denote the set of all nonzero zero-divisors of [Formula: see text]. We associate a simple (undirected) graph [Formula: see text] with vertex set [Formula: see text] and two distinct vertices [Formula: see text] and [Formula: see text] are adjacent in [Formula: see text]
Anita Lande, Anil Khairnar
openaire   +2 more sources

On zero-divisor graphs of infinite posets

Soft Computing
AbstractIt is known that the so-called Beck’s conjecture, i.e. the equality of the finite clique and chromatic numbers of a zero-divisor graph, holds for partially ordered sets Halaš and Jukl (Discrete Math 309(13):4584–4589, 2009). In this paper we present a simple direct proof of this fact.
Radomír Halas, Jozef Pócs
openaire   +1 more source

A Study on the Structure of Ideal-Based Non-Zero Divisor Graphs Associated with <i>Z</i> _<i>n</i>. [PDF]

F1000Res
Kadem S, Abd Aubad A.
europepmc   +1 more source

Harary index of the zero divisor graph of upper triangular matrices. [PDF]

Sci Rep
Alshanqiti O, Sharma S, Bhat VK.
europepmc   +1 more source

Integrating Artificial intelligence within sustainable smart analytical chemistry for analyzing the divisor impact on UV-spectrophotometric efficiency of solifenacin and mirabegron combination. [PDF]

Sci Rep
Lotfy HM, Obaydo RH, Tantawy MA, Mouhamed AA.   +3 more
europepmc   +1 more source

Development and validation of ratio spectra manipulation methods for the determination of etoricoxib and tramadol in binary mixtures. [PDF]

Sci Rep
Al Kamaly O, Sayedahmed M, Abdelzaher AM.   +2 more
europepmc   +1 more source

Artificial intelligence versus traditional approaches in multicomponent spectral analysis. [PDF]

Sci Rep
Fahmy NM, Obaydo RH, Lotfy HM.
europepmc   +1 more source