2006
DOI: 10.1017/s0025557200179732
|View full text |Cite
|
Sign up to set email alerts
|

90.39 On a family of polynomials

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
10
0

Year Published

2009
2009
2021
2021

Publication Types

Select...
4
1

Relationship

1
4

Authors

Journals

citations
Cited by 5 publications
(10 citation statements)
references
References 2 publications
0
10
0
Order By: Relevance
“…with integer coefficients, where n = 0,1,2, ... . In [2] two formulae for these polynomials are proved. The first is the recurrence formula fp"(t)dt = -ft (9) forn = 1,2,3... .…”
Section: ^W-2^*)(tt^-(3)mentioning
confidence: 99%
See 1 more Smart Citation
“…with integer coefficients, where n = 0,1,2, ... . In [2] two formulae for these polynomials are proved. The first is the recurrence formula fp"(t)dt = -ft (9) forn = 1,2,3... .…”
Section: ^W-2^*)(tt^-(3)mentioning
confidence: 99%
“…The first few non-zero Bernoulli numbers are Bo = 1, B\ ~ -, Bo = -, BA = ,5fi = -, Bs = , It is proved in[2] that the n th derivative of the function (1) is…”
mentioning
confidence: 99%
“…The polynomial, of order 5is known in the literature as the derivative polynomial. It can be proved (see [8]) that all…”
Section: Logistic Equation and Logistic Functionmentioning
confidence: 99%
“…Independently the formula has been considered and proved, with a proof based on generating functions, by Franssens [10] (see also [17]). If a function x(t) satisfies equation (16), then the nth derivative of x(t) can be expressed by the following formula:…”
Section: Derivative Polynomialsmentioning
confidence: 99%
“…In the paper [17] (see also [4], [5], [10]) it is proved that the polynomials Q n (x) can be expressed in terms of the Stirling numbers of the second kind n k (number of the ways of partitioning a set of n elements into k nonempty subsets, see Graham et al [11]), namely…”
Section: Derivative Polynomialsmentioning
confidence: 99%