Results 31 to 40 of about 120,359 (315)

Certain Properties and Characterizations of Multivariable Hermite-Based Appell Polynomials via Factorization Method

open access: yesFractal and Fractional, 2023
This paper introduces a new type of polynomials generated through the convolution of generalized multivariable Hermite polynomials and Appell polynomials.
Mohra Zayed   +2 more
doaj   +1 more source

Probabilistic recurrence relations revisited

open access: yesTheoretical Computer Science, 1995
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chaudhuri, S., Dubhashi, D.
openaire   +5 more sources

On Global Convergence of Third-Order Chebyshev-Type Method under General Continuity Conditions

open access: yesFractal and Fractional, 2022
There are very few papers that talk about the global convergence of iterative methods with the help of Banach spaces. The main purpose of this paper is to discuss the global convergence of third order iterative method.
Fouad Othman Mallawi   +2 more
doaj   +1 more source

The mathematics of generalized Fibonacci sequences: Binet's formula and identities [PDF]

open access: yesMathematica Moravica
This article considers a generalized Fibonacci sequence {Vn} with general initial conditions, V0 = a, V1 = b, and a versatile recurrence relation Vn = pVn-1 + qVn-2, where n ≥ 2 and a, b, p and q are any non-zero real numbers. The generating function and
Verma K.L.
doaj   +1 more source

From omics to AI—mapping the pathogenic pathways in type 2 diabetes

open access: yesFEBS Letters, EarlyView.
Integrating multi‐omics data with AI‐based modelling (unsupervised and supervised machine learning) identify optimal patient clusters, informing AI‐driven accurate risk stratification. Digital twins simulate individual trajectories in real time, guiding precision medicine by matching patients to targeted therapies.
Siobhán O'Sullivan   +2 more
wiley   +1 more source

Recurrence relations for the midpoint method

open access: yesTamkang Journal of Mathematics, 2000
In this paper, we present a new convergence analysis and error estimates for the Midpoint method in Banach spaces by using Newton-Kantorovich-type assumptions and a technique based on a new system of recurrence relations. Finally, we give three examples where we improve the error bounds are better given by other authors.
Ezquerro Fernández, José Antonio   +2 more
openaire   +5 more sources

Microbial exopolysaccharide production by polyextremophiles in the adaptation to multiple extremes

open access: yesFEBS Letters, EarlyView.
Polyextremophiles are microorganisms that endure multiple extreme conditions by various adaptation strategies that also include the production of exopolysaccharides (EPSs). This review provides an integrated perspective on EPS biosynthesis, function, and regulation in these organisms, emphasizing their critical role in survival and highlighting their ...
Tracey M Gloster, Ebru Toksoy Öner
wiley   +1 more source

On hypergeometric Cauchy numbers of higher grade

open access: yesAIMS Mathematics, 2021
In 1875, Glaisher gave several interesting determinant expressions of numbers, including Bernoulli, Cauchy, and Euler numbers. Cauchy numbers can be generalized to the hypergeometric Cauchy numbers. Recently, Barman et al.
Takao Komatsu, Ram Krishna Pandey
doaj   +1 more source

From lactation to malignancy: A comparison between healthy and cancerous breast gland at single‐cell resolution reveals new issues for tumorigenesis

open access: yesFEBS Letters, EarlyView.
Single‐cell RNA sequencing reveals an opposite role of SLPI in basal tumors based on metastatic spread, along with shared activation of specific regulons in cancer cells and mature luminal lactocytes, as well as downregulation of MALAT1 and NEAT1 in the latter.
Pietro Ancona   +4 more
wiley   +1 more source

Recurrence relations based on minimization

open access: yesJournal of Mathematical Analysis and Applications, 1974
AbstractThis paper investigates solutions of the general recurrence M(0) = g(0), M(n + 1) = g(n + 1) + min0⩽k⩽n(αM(k) + βM(n − k)) for various choices of α, β, and g(n). In a large number of cases it is possible to prove that M(n) is a convex function whose values can be computed much more efficiently than would be suggested by the defining recurrence.
Michael L. Fredman, Donald E. Knuth
openaire   +3 more sources

Home - About - Disclaimer - Privacy