Results 101 to 110 of about 325,732 (181)
Key drivers of at‐vessel mortality in demersal sharks
Abstract Chondrichthyans are highly vulnerable to fisheries overexploitation, and postcapture mortality poses a significant threat to most species. Global bycatch mitigation guidelines recommend adopting hierarchical decision‐making approaches tailored to species‐specific vulnerabilities and socioeconomic and regulatory contexts.
David Ruiz‐García +3 more
wiley +1 more source
A Family of Hybrid Functions Generated by the Composition of Bessel and Mittag–Leffler Functions
In this paper, we employ a symbolic technique to introduce a new family of Mittag–Leffler–Bessel functions (MLBFs), formed by compositionally combining the classical Bessel functions of the first kind with the three‐parameter Mittag–Leffler function.
Maged G. Bin-Saad +2 more
wiley +1 more source
An introduction to Umbral Calculus
The aim of these lectures is to give an introduction to combinatorial aspects of Umbral Calculus. Seen in this light, Umbral Calculus is a theory of polynomials that count combinatorial objects.
A. Di Bucchianico
core
Umbral calculus, binomial enumeration and chromatic polynomials
We develop the concept of partition categories, in order to extend the Mullin-Rota theory of binomial enumeration, and simultaneously to provide a natural setting for recent applications of the Roman-Rota umbral calculus to computations in algebraic ...
Nigel Ray
core +1 more source
Multiple Binomial‐Type Operators and Their Approximation Properties
In this paper, we introduce multiple binomial‐type operators (multiple Bernstein–Sheffer operators) and investigate their approximation properties. These properties are analyzed by means of a Korovkin‐type theorem. Furthermore, by using the first and second modulus of continuity together with Peetre’s κ‐functional, we establish the rate of convergence ...
Mehmet Ali Özarslan +3 more
wiley +1 more source
Recursive matrices and umbral calculus
Two major objectives can be seen to guide much recent work in enumeration: (1) to single out a limited variety of recurrences for numerical sequences which will encompass counting problems of wide-enough type; (2) to recover from empirical data an underlying set-theoretic structure which would reveal the source of the given recursion.
Barnabei, Marilena +2 more
openaire +2 more sources
A new discretization of the Euler equation via the finite operator theory [PDF]
We propose a novel discretization procedure for the classical Euler equation, based on the theory of Galois differential algebras and the finite operator calculus developed by G.C. Rota and collaborators.
Miguel A. Rodríguez +1 more
doaj +1 more source
In this article, a new q-generalization of the Apostol-Euler polynomials is introduced using the usual q-exponential function. We make use of such a generalization to derive several properties arising from the q-umbral calculus.
S. Araci +3 more
semanticscholar +1 more source
Approximation operators constructed by means of Sheffer sequences
In this paper we introduce a class of positive linear operators by using the "umbral calculus", and we study some approximation properties of it. Let \( Q \) be a delta operator, and \(S\) an invertible shift invariant operator. For \(f\in C[0,1]\) we
Maria Crăciun
doaj +2 more sources
Identities related to the Stirling numbers and modified Apostol-type numbers on Umbral Calculus
By using umbral calculus and umbral algebra methods, we derive several interesting identities and relations related to the modi ed and uni cation of the Bernoulli, Euler and Genocchi polynomials and numbers and the generalized (β-) Stirling numbers of ...
T. Komatsu, Y. Simsek
semanticscholar +1 more source

