|
Generating Function Transformation
In mathematics, a transformation of a sequence's generating function provides a method of converting the generating function for one sequence into a generating function enumerating another. These transformations typically involve integral formulas applied to a sequence generating function (see integral transformations) or weighted sums over the higher-order derivatives of these functions (see derivative transformations). Given a sequence, \_^, the ordinary generating function (OGF) of the sequence, denoted F(z), and the exponential generating function (EGF) of the sequence, denoted \widehat(z), are defined by the formal power series :F(z) = \sum_^\infty f_n z^n = f_0 + f_1 z + f_2 z^2 + \cdots :\widehat(z) = \sum_^\infty \frac z^n = \frac + \frac z + \frac z^2 + \cdots. In this article, we use the convention that the ordinary (exponential) generating function for a sequence \ is denoted by the uppercase function F(z) / \widehat(z) for some fixed or formal z when the context o ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Sequence
In mathematics, a sequence is an enumerated collection of objects in which repetitions are allowed and order matters. Like a set, it contains members (also called ''elements'', or ''terms''). The number of elements (possibly infinite) is called the ''length'' of the sequence. Unlike a set, the same elements can appear multiple times at different positions in a sequence, and unlike a set, the order does matter. Formally, a sequence can be defined as a function from natural numbers (the positions of elements in the sequence) to the elements at each position. The notion of a sequence can be generalized to an indexed family, defined as a function from an ''arbitrary'' index set. For example, (M, A, R, Y) is a sequence of letters with the letter 'M' first and 'Y' last. This sequence differs from (A, R, M, Y). Also, the sequence (1, 1, 2, 3, 5, 8), which contains the number 1 at two different positions, is a valid sequence. Sequences can be ''finite'', as in these examples, or ''infi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Hankel Contour
In mathematics, a Hankel contour is a path in the complex plane which extends from (+∞,δ), around the origin counter clockwise and back to (+∞,−δ), where δ is an arbitrarily small positive number. The contour thus remains arbitrarily close to the real axis but without crossing the real axis except for negative values of ''x''. The Hankel contour can also be represented by a path that has mirror images just above and below the real axis, connected to a circle of radius ε, centered at the origin, where ε is an arbitrarily small number. The two linear portions of the contour are said to be a distance of δ from the real axis. Thus, the total distance between the linear portions of the contour is 2δ. The contour is traversed in the positively-oriented sense, meaning that the circle around the origin is traversed counter-clockwise. Use of Hankel contours is one of the methods of contour integration. This type of path for contour integrals was first used by Hermann Hanke ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Continued Fraction
In mathematics, a continued fraction is an expression (mathematics), expression obtained through an iterative process of representing a number as the sum of its integer part and the multiplicative inverse, reciprocal of another number, then writing this other number as the sum of its integer part and another reciprocal, and so on. In a finite continued fraction (or terminated continued fraction), the iteration/recursion is terminated after finitely many steps by using an integer in lieu of another continued fraction. In contrast, an infinite continued fraction is an infinite expression (mathematics), infinite expression. In either case, all integers in the sequence, other than the first, must be positive number, positive. The integers a_i are called the coefficients or terms of the continued fraction. It is generally assumed that the numerator of all of the fractions is 1. If arbitrary values and/or function (mathematics), functions are used in place of one or more of the numerat ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Pochhammer K-symbol
In the mathematical theory of special functions, the Pochhammer ''k''-symbol and the ''k''-gamma function, introduced by Rafael Díaz and Eddy Pariguan are generalizations of the Pochhammer symbol and gamma function. They differ from the Pochhammer symbol and gamma function in that they can be related to a general arithmetic progression in the same manner as those are related to the sequence of consecutive integers. Definition The Pochhammer ''k''-symbol (''x'')''n,k'' is defined as : \begin (x)_ & = x(x + k)(x + 2k) \cdots (x + (n-1)k)=\prod_^n (x+(i-1)k) \\ & = k^n \times \left(\frac\right)_n,\, \end and the ''k''-gamma function Γ''k'', with ''k'' > 0, is defined as : \Gamma_k(x) = \lim_ \frac. When ''k'' = 1 the standard Pochhammer symbol and gamma function are obtained. Díaz and Pariguan use these definitions to demonstrate a number of properties of the hypergeometric function. Although Díaz and Pariguan restrict these symbols to ''k'' > 0, the Pochham ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Constant-recursive Sequence
In mathematics and theoretical computer science, a constant-recursive sequence is an infinite sequence of numbers where each number in the sequence is equal to a fixed linear combination of one or more of its immediate predecessors. A constant-recursive sequence is also known as a linear recurrence sequence, linear-recursive sequence, linear-recurrent sequence, a C-finite sequence, or a solution to a linear recurrence with constant coefficients. The most famous example of a constant-recursive sequence is the Fibonacci sequence 0, 1, 1, 2, 3, 5, 8, 13, \ldots, in which each number is the sum of the previous two. The power of two sequence 1, 2, 4, 8, 16, \ldots is also constant-recursive because each number is the sum of twice the previous number. The square number sequence 0, 1, 4, 9, 16, 25, \ldots is also constant-recursive. However, not all sequences are constant-recursive; for example, the factorial number sequence 1, 1, 2, 6, 24, 120, \ldots is not constant-recursive. Al ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Laurent Series
In mathematics, the Laurent series of a complex function f(z) is a representation of that function as a power series which includes terms of negative degree. It may be used to express complex functions in cases where a Taylor series expansion cannot be applied. The Laurent series was named after and first published by Pierre Alphonse Laurent in 1843. Karl Weierstrass may have discovered it first in a paper written in 1841, but it was not published until after his death.. Definition The Laurent series for a complex function f(z) about a point c is given by f(z) = \sum_^\infty a_n(z-c)^n, where a_n and c are constants, with a_n defined by a line integral that generalizes Cauchy's integral formula: a_n =\frac\oint_\gamma \frac \, dz. The path of integration \gamma is counterclockwise around a Jordan curve enclosing c and lying in an annulus A in which f(z) is holomorphic (analytic). The expansion for f(z) will then be valid anywhere inside the annulus. The annulus is shown in red ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Imaginary Unit
The imaginary unit or unit imaginary number () is a solution to the quadratic equation x^2+1=0. Although there is no real number with this property, can be used to extend the real numbers to what are called complex numbers, using addition and multiplication. A simple example of the use of in a complex number is 2+3i. Imaginary numbers are an important mathematical concept; they extend the real number system \mathbb to the complex number system \mathbb, in which at least one root for every nonconstant polynomial exists (see Algebraic closure and Fundamental theorem of algebra). Here, the term "imaginary" is used because there is no real number having a negative square. There are two complex square roots of −1: and -i, just as there are two complex square roots of every real number other than zero (which has one double square root). In contexts in which use of the letter is ambiguous or problematic, the letter or the Greek \iota is sometimes used instead. For example, ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Stirling Numbers Of The Second Kind
In mathematics, particularly in combinatorics, a Stirling number of the second kind (or Stirling partition number) is the number of ways to partition a set of ''n'' objects into ''k'' non-empty subsets and is denoted by S(n,k) or \textstyle \left\. Stirling numbers of the second kind occur in the field of mathematics called combinatorics and the study of partitions. Stirling numbers of the second kind are one of two kinds of Stirling numbers, the other kind being called Stirling numbers of the first kind (or Stirling cycle numbers). Mutually inverse (finite or infinite) triangular matrices can be formed from the Stirling numbers of each kind according to the parameters ''n'', ''k''. Definition The Stirling numbers of the second kind, written S(n,k) or \lbrace\textstyle\rbrace or with other notations, count the number of ways to partition a set of n labelled objects into k nonempty unlabelled subsets. Equivalently, they count the number of different equivalence relations with ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Polylogarithm
In mathematics, the polylogarithm (also known as Jonquière's function, for Alfred Jonquière) is a special function of order and argument . Only for special values of does the polylogarithm reduce to an elementary function such as the natural logarithm or a rational function. In quantum statistics, the polylogarithm function appears as the closed form of integrals of the Fermi–Dirac distribution and the Bose–Einstein distribution, and is also known as the Fermi–Dirac integral or the Bose–Einstein integral. In quantum electrodynamics, polylogarithms of positive integer order arise in the calculation of processes represented by higher-order Feynman diagrams. The polylogarithm function is equivalent to the Hurwitz zeta function — either function can be expressed in terms of the other — and both functions are special cases of the Lerch transcendent. Polylogarithms should not be confused with polylogarithmic functions nor with the offset logarithmic integral which h ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Fractional Calculus
Fractional calculus is a branch of mathematical analysis that studies the several different possibilities of defining real number powers or complex number powers of the differentiation operator D :D f(x) = \frac f(x)\,, and of the integration operator J The symbol J is commonly used instead of the intuitive I in order to avoid confusion with other concepts identified by similar I–like glyphs, such as identities. :J f(x) = \int_0^x f(s) \,ds\,, and developing a calculus for such operators generalizing the classical one. In this context, the term ''powers'' refers to iterative application of a linear operator D to a function f, that is, repeatedly composing D with itself, as in D^n(f) = (\underbrace_n)(f) = \underbrace_n (f)\cdots))). For example, one may ask for a meaningful interpretation of :\sqrt = D^\frac12 as an analogue of the functional square root for the differentiation operator, that is, an expression for some linear operator that, when applied ''twice'' to any ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Geometric Series
In mathematics, a geometric series is the sum of an infinite number of terms that have a constant ratio between successive terms. For example, the series :\frac \,+\, \frac \,+\, \frac \,+\, \frac \,+\, \cdots is geometric, because each successive term can be obtained by multiplying the previous term by 1/2. In general, a geometric series is written as a + ar + ar^2 + ar^3 + ..., where a is the coefficient of each term and r is the common ratio between adjacent terms. The geometric series had an important role in the early development of calculus, is used throughout mathematics, and can serve as an introduction to frequently used mathematical tools such as the Taylor series, the complex Fourier series, and the matrix exponential. The name geometric series indicates each term is the geometric mean of its two neighboring terms, similar to how the name arithmetic series indicates each term is the arithmetic mean of its two neighboring terms. The sequence of geometric series term ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Stirling Number Of The Second Kind
In mathematics, particularly in combinatorics, a Stirling number of the second kind (or Stirling partition number) is the number of ways to partition a set of ''n'' objects into ''k'' non-empty subsets and is denoted by S(n,k) or \textstyle \left\. Stirling numbers of the second kind occur in the field of mathematics called combinatorics and the study of partitions. Stirling numbers of the second kind are one of two kinds of Stirling numbers, the other kind being called Stirling numbers of the first kind (or Stirling cycle numbers). Mutually inverse (finite or infinite) triangular matrices can be formed from the Stirling numbers of each kind according to the parameters ''n'', ''k''. Definition The Stirling numbers of the second kind, written S(n,k) or \lbrace\textstyle\rbrace or with other notations, count the number of ways to partition a set of n labelled objects into k nonempty unlabelled subsets. Equivalently, they count the number of different equivalence relations with p ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
