enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Formal power series - Wikipedia

    en.wikipedia.org/wiki/Formal_power_series

    A formal power series can be loosely thought of as an object that is like a polynomial, but with infinitely many terms.Alternatively, for those familiar with power series (or Taylor series), one may think of a formal power series as a power series in which we ignore questions of convergence by not assuming that the variable X denotes any numerical value (not even an unknown value).

  3. Generating function - Wikipedia

    en.wikipedia.org/wiki/Generating_function

    Unlike an ordinary series, the formal power series is not required to converge: in fact, the generating function is not actually regarded as a function, and the "variable" remains an indeterminate. One can generalize to formal power series in more than one indeterminate, to encode information about infinite multi-dimensional arrays of numbers.

  4. Factorial - Wikipedia

    en.wikipedia.org/wiki/Factorial

    In mathematical analysis, factorials are used in power series for the exponential function and other functions, and they also have applications in algebra, number theory, probability theory, and computer science. Much of the mathematics of the factorial function was developed beginning in the late 18th and early 19th centuries.

  5. q-Pochhammer symbol - Wikipedia

    en.wikipedia.org/wiki/Q-Pochhammer_symbol

    This is an analytic function of q in the interior of the unit disk, and can also be considered as a formal power series in q. The special case ϕ ( q ) = ( q ; q ) ∞ = ∏ k = 1 ∞ ( 1 − q k ) {\displaystyle \phi (q)=(q;q)_{\infty }=\prod _{k=1}^{\infty }(1-q^{k})} is known as Euler's function , and is important in combinatorics , number ...

  6. Probability-generating function - Wikipedia

    en.wikipedia.org/.../Probability-generating_function

    The probability generating function is an example of a generating function of a sequence: see also formal power series. It is equivalent to, and sometimes called, the z-transform of the probability mass function.

  7. Unique factorization domain - Wikipedia

    en.wikipedia.org/wiki/Unique_factorization_domain

    The ring of formal power series over the complex numbers is a UFD, but the subring of those that converge everywhere, in other words the ring of entire functions in a single complex variable, is not a UFD, since there exist entire functions with an infinity of zeros, and thus an infinity of irreducible factors, while a UFD factorization must be ...

  8. Bell series - Wikipedia

    en.wikipedia.org/wiki/Bell_series

    In mathematics, the Bell series is a formal power series used to study properties of arithmetical functions. Bell series were introduced and developed by Eric Temple Bell . Given an arithmetic function f {\displaystyle f} and a prime p {\displaystyle p} , define the formal power series f p ( x ) {\displaystyle f_{p}(x)} , called the Bell series ...

  9. Formal calculation - Wikipedia

    en.wikipedia.org/wiki/Formal_calculation

    More generally, formal power series can include series with any finite (or countable) number of variables, and with coefficients in an arbitrary ring. Rings of formal power series are complete local rings, which supports calculus-like methods in the purely algebraic framework of algebraic geometry and commutative algebra. They are analogous to ...