|
Bernoulli Polynomials Of The Second Kind
The Bernoulli polynomials of the second kind , also known as the Fontana-Bessel polynomials, are the polynomials defined by the following generating function: : \frac= \sum_^\infty z^n \psi_n(x) ,\qquad , z, -1 and :\gamma=\sum_^\infty\frac\Big\, \quad a>-1 where is Euler's constant. Furthermore, we also have : \Psi(v)= \frac\left\,\qquad \Re(v)>-a, where is the gamma function. The Hurwitz and Riemann zeta functions may be expanded into these polynomials as follows : \zeta(s,v)= \frac + \sum_^\infty (-1)^n \psi_(a) \sum_^ (-1)^k \binom (k+v)^ and : \zeta(s)= \frac + \sum_^\infty (-1)^n \psi_(a) \sum_^ (-1)^k \binom (k+1)^ and also : \zeta(s) =1 + \frac + \sum_^\infty (-1)^n \psi_(a) \sum_^ (-1)^k \binom (k+2)^ The Bernoulli polynomials of the second kind are also involved in the following relationship : \big(v+a-\tfrac\big)\zeta(s,v) = -\frac + \zeta(s-1,v) + \sum_^\infty (-1)^n \psi_(a) \sum_^ (-1)^k \binom (k+v)^ between the zeta functions, a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Antiderivative
In calculus, an antiderivative, inverse derivative, primitive function, primitive integral or indefinite integral of a function is a differentiable function whose derivative is equal to the original function . This can be stated symbolically as . The process of solving for antiderivatives is called antidifferentiation (or indefinite integration), and its opposite operation is called ''differentiation'', which is the process of finding a derivative. Antiderivatives are often denoted by capital Roman letters such as and . Antiderivatives are related to definite integrals through the second fundamental theorem of calculus: the definite integral of a function over a closed interval where the function is Riemann integrable is equal to the difference between the values of an antiderivative evaluated at the endpoints of the interval. In physics, antiderivatives arise in the context of rectilinear motion (e.g., in explaining the relationship between position, velocity an ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Stieltjes Constants
In mathematics, the Stieltjes constants are the numbers \gamma_k that occur in the Laurent series expansion of the Riemann zeta function: :\zeta(s)=\frac+\sum_^\infty \frac \gamma_n (s-1)^n. The constant \gamma_0 = \gamma = 0.577\dots is known as the Euler–Mascheroni constant. Representations The Stieltjes constants are given by the limit : \gamma_n = \lim_ \left\ = \lim_ . (In the case ''n'' = 0, the first summand requires evaluation of 00, which is taken to be 1.) Cauchy's differentiation formula leads to the integral representation :\gamma_n = \frac \int_0^ e^ \zeta\left(e^+1\right) dx. Various representations in terms of integrals and infinite series are given in works of Jensen, Franel, Hermite, Hardy, Ramanujan, Ainsworth, Howell, Coppo, Connon, Coffey, Choi, Blagouchine and some other authors. In particular, Jensen-Franel's integral formula, often erroneously attributed to Ainsworth and Howell, states that : \gamma_n = \frac\delta_+\frac\int_0^\infty ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mittag-Leffler Polynomials
In mathematics, the Mittag-Leffler polynomials are the polynomials ''g''''n''(''x'') or ''M''''n''(''x'') studied by . ''M''''n''(''x'') is a special case of the Meixner polynomial ''M''''n''(''x;b,c'') at ''b = 0, c = -1''. Definition and examples Generating functions The Mittag-Leffler polynomials are defined respectively by the generating functions : \displaystyle \sum_^ g_n(x)t^n :=\frac\Bigl(\frac \Bigr)^x and : \displaystyle \sum_^ M_n(x)\frac:=\Bigl(\frac \Bigr)^x=(1+t)^x(1-t)^=\exp(2x\text t). They also have the bivariate generating function : \displaystyle \sum_^\sum_^ g_n(m)x^my^n =\frac. Examples The first few polynomials are given in the following table. The coefficients of the numerators of the g_n(x) can be found in the OEIS, though without any references, and the coefficients of the M_n(x) are in the OEIS as well. : Properties The polynomials are related by M_n(x)=2\cdot \, g_n(x) and we have g_n(1)=1 for n\geqslant 1 . Also g_(\frac12)=g_(\frac12)=\frac12\ ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Poly-Bernoulli Number
In mathematics, poly-Bernoulli numbers, denoted as B_^, were defined by M. Kaneko as :=\sum_^B_^ where ''Li'' is the polylogarithm. The B_^ are the usual Bernoulli numbers. Moreover, the Generalization of Poly-Bernoulli numbers with a,b,c parameters defined as follows :c^=\sum_^B_^(t;a,b,c) where ''Li'' is the polylogarithm. Kaneko also gave two combinatorial formulas: :B_^=\sum_^(-1)^m!S(n,m)(m+1)^, :B_^=\sum_^ (j!)^S(n+1,j+1)S(k+1,j+1), where S(n,k) is the number of ways to partition a size n set into k non-empty subsets (the Stirling number of the second kind). A combinatorial interpretation is that the poly-Bernoulli numbers of negative index enumerate the set of n by k (0,1)-matrices uniquely reconstructible from their row and column sums. Also it is the number of open tours by a biased rook on a board \underbrace_\underbrace_ (see A329718 for definition). The Poly-Bernoulli number B_^ satisfies the following asymptotic:. B_^ \sim (k!)^2 \sqrt\left( \frac \right) ^, ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Difference Polynomials
In mathematics, in the area of complex analysis, the general difference polynomials are a polynomial sequence, a certain subclass of the Sheffer polynomials, which include the Newton polynomials, Selberg's polynomials, and the Stirling interpolation polynomials as special cases. Definition The general difference polynomial sequence is given by :p_n(z)=\frac where is the binomial coefficient. For \beta=0, the generated polynomials p_n(z) are the Newton polynomials :p_n(z)= = \frac. The case of \beta=1 generates Selberg's polynomials, and the case of \beta=-1/2 generates Stirling's interpolation polynomials. Moving differences Given an analytic function f(z), define the moving difference of ''f'' as :\mathcal_n(f) = \Delta^n f (\beta n) where \Delta is the forward difference operator. Then, provided that ''f'' obeys certain summability conditions, then it may be represented in terms of these polynomials as :f(z)=\sum_^\infty p_n(z) \mathcal_n(f). The conditions for sum ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Bernoulli Numbers
In mathematics, the Bernoulli numbers are a sequence of rational numbers which occur frequently in analysis. The Bernoulli numbers appear in (and can be defined by) the Taylor series expansions of the tangent and hyperbolic tangent functions, in Faulhaber's formula for the sum of ''m''-th powers of the first ''n'' positive integers, in the Euler–Maclaurin formula, and in expressions for certain values of the Riemann zeta function. The values of the first 20 Bernoulli numbers are given in the adjacent table. Two conventions are used in the literature, denoted here by B^_n and B^_n; they differ only for , where B^_1=-1/2 and B^_1=+1/2. For every odd , . For every even , is negative if is divisible by 4 and positive otherwise. The Bernoulli numbers are special values of the Bernoulli polynomials B_n(x), with B^_n=B_n(0) and B^+_n=B_n(1). The Bernoulli numbers were discovered around the same time by the Swiss mathematician Jacob Bernoulli, after whom they are named, and inde ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Stirling Polynomials
In mathematics, the Stirling polynomials are a family of polynomials that generalize important sequences of numbers appearing in combinatorics and analysis, which are closely related to the Stirling numbers, the Bernoulli numbers, and the generalized Bernoulli polynomials. There are multiple variants of the ''Stirling polynomial'' sequence considered below most notably including the Sheffer sequence form of the sequence, S_k(x), defined characteristically through the special form of its exponential generating function, and the ''Stirling (convolution) polynomials'', \sigma_n(x), which also satisfy a characteristic ''ordinary'' generating function and that are of use in generalizing the Stirling numbers (of both kinds) to arbitrary complex-valued inputs. We consider the "''convolution polynomial''" variant of this sequence and its properties second in the last subsection of the article. Still other variants of the Stirling polynomials are studied in the supplementary links to the a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Bernoulli Polynomials
In mathematics, the Bernoulli polynomials, named after Jacob Bernoulli, combine the Bernoulli numbers and binomial coefficients. They are used for series expansion of functions, and with the Euler–MacLaurin formula. These polynomials occur in the study of many special functions and, in particular, the Riemann zeta function and the Hurwitz zeta function. They are an Appell sequence (i.e. a Sheffer sequence for the ordinary derivative operator). For the Bernoulli polynomials, the number of crossings of the ''x''-axis in the unit interval does not go up with the degree. In the limit of large degree, they approach, when appropriately scaled, the sine and cosine functions. A similar set of polynomials, based on a generating function, is the family of Euler polynomials. Representations The Bernoulli polynomials ''B''''n'' can be defined by a generating function. They also admit a variety of derived representations. Generating functions The generating function for the Be ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Riemann Zeta Function
The Riemann zeta function or Euler–Riemann zeta function, denoted by the Greek letter (zeta), is a mathematical function of a complex variable defined as \zeta(s) = \sum_^\infty \frac = \frac + \frac + \frac + \cdots for \operatorname(s) > 1 and its analytic continuation elsewhere. The Riemann zeta function plays a pivotal role in analytic number theory, and has applications in physics, probability theory, and applied statistics. Leonhard Euler first introduced and studied the function over the reals in the first half of the eighteenth century. Bernhard Riemann's 1859 article " On the Number of Primes Less Than a Given Magnitude" extended the Euler definition to a complex variable, proved its meromorphic continuation and functional equation, and established a relation between its zeros and the distribution of prime numbers. This paper also contained the Riemann hypothesis, a conjecture about the distribution of complex zeros of the Riemann zeta function that is cons ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Binomial Coefficient
In mathematics, the binomial coefficients are the positive integers that occur as coefficients in the binomial theorem. Commonly, a binomial coefficient is indexed by a pair of integers and is written \tbinom. It is the coefficient of the term in the polynomial expansion of the binomial power ; this coefficient can be computed by the multiplicative formula :\binom nk = \frac, which using factorial notation can be compactly expressed as :\binom = \frac. For example, the fourth power of is :\begin (1 + x)^4 &= \tbinom x^0 + \tbinom x^1 + \tbinom x^2 + \tbinom x^3 + \tbinom x^4 \\ &= 1 + 4x + 6 x^2 + 4x^3 + x^4, \end and the binomial coefficient \tbinom =\tfrac = \tfrac = 6 is the coefficient of the term. Arranging the numbers \tbinom, \tbinom, \ldots, \tbinom in successive rows for n=0,1,2,\ldots gives a triangular array called Pascal's triangle, satisfying the recurrence relation :\binom = \binom + \binom. The binomial coefficients occur in many areas of mathematics, a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Hurwitz Zeta Function
In mathematics, the Hurwitz zeta function is one of the many zeta functions. It is formally defined for complex variables with and by :\zeta(s,a) = \sum_^\infty \frac. This series is absolutely convergent for the given values of and and can be extended to a meromorphic function defined for all . The Riemann zeta function is . The Hurwitz zeta function is named after Adolf Hurwitz, who introduced it in 1882. Integral representation The Hurwitz zeta function has an integral representation :\zeta(s,a) = \frac \int_0^\infty \frac dx for \operatorname(s)>1 and \operatorname(a)>0. (This integral can be viewed as a Mellin transform.) The formula can be obtained, roughly, by writing :\zeta(s,a)\Gamma(s) = \sum_^\infty \frac \int_0^\infty x^s e^ \frac = \sum_^\infty \int_0^\infty y^s e^ \frac and then interchanging the sum and integral. The integral representation above can be converted to a contour integral representation :\zeta(s,a) = -\Gamma(1-s)\frac \int_C \frac dz wher ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Gamma Function
In mathematics, the gamma function (represented by , the capital letter gamma from the Greek alphabet) is one commonly used extension of the factorial function to complex numbers. The gamma function is defined for all complex numbers except the non-positive integers. For every positive integer , \Gamma(n) = (n-1)!\,. Derived by Daniel Bernoulli, for complex numbers with a positive real part, the gamma function is defined via a convergent improper integral: \Gamma(z) = \int_0^\infty t^ e^\,dt, \ \qquad \Re(z) > 0\,. The gamma function then is defined as the analytic continuation of this integral function to a meromorphic function that is holomorphic in the whole complex plane except zero and the negative integers, where the function has simple poles. The gamma function has no zeroes, so the reciprocal gamma function is an entire function. In fact, the gamma function corresponds to the Mellin transform of the negative exponential function: \Gamma(z) = \mat ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
