Q-factorial
In mathematical area of combinatorics, the ''q''-Pochhammer symbol, also called the ''q''-shifted factorial, is the product (a;q)_n = \prod_^ (1-aq^k)=(1-a)(1-aq)(1-aq^2)\cdots(1-aq^), with (a;q)_0 = 1. It is a ''q''-analog of the Pochhammer symbol (x)_n = x(x+1)\dots(x+n-1), in the sense that \lim_ \frac = (x)_n. The ''q''-Pochhammer symbol is a major building block in the construction of ''q''-analogs; for instance, in the theory of basic hypergeometric series, it plays the role that the ordinary Pochhammer symbol plays in the theory of generalized hypergeometric series. Unlike the ordinary Pochhammer symbol, the ''q''-Pochhammer symbol can be extended to an infinite product: (a;q)_\infty = \prod_^ (1-aq^k). 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 \phi(q) = (q;q)_\infty=\prod_^\infty (1-q^k) is known as Euler's function, and is important in combinatorics, number theory ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Q-gamma Function
In q-analog theory, the q-gamma function, or basic gamma function, is a generalization of the ordinary gamma function closely related to the double gamma function. It was introduced by . It is given by \Gamma_q(x) = (1-q)^\prod_^\infty \frac=(1-q)^\,\frac when , q, 1. Here (\cdot;\cdot)_\infty is the infinite q-Pochhammer symbol. The q-gamma function satisfies the functional equation \Gamma_q(x+1) = \frac\Gamma_q(x)= q\Gamma_q(x) In addition, the q-gamma function satisfies the q-analog of the Bohr–Mollerup theorem, which was found by Richard Askey (). For non-negative integers ''n'', \Gamma_q(n)= -1q! where cdotq is the q-factorial function. Thus the q-gamma function can be considered as an extension of the q-factorial function to the real numbers. The relation to the ordinary gamma function is made explicit in the limit \lim_ \Gamma_q(x) = \Gamma(x). There is a simple proof of this limit by Gosper. See the appendix of (). Transformation properties The q-gamma function satisfies ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Q-analog
In mathematics, a ''q''-analog of a theorem, identity or expression is a generalization involving a new parameter ''q'' that returns the original theorem, identity or expression in the limit as . Typically, mathematicians are interested in ''q''-analogs that arise naturally, rather than in arbitrarily contriving ''q''-analogs of known results. The earliest ''q''-analog studied in detail is the basic hypergeometric series, which was introduced in the 19th century.Exton, H. (1983), ''q-Hypergeometric Functions and Applications'', New York: Halstead Press, Chichester: Ellis Horwood, 1983, , , ''q''-analogues are most frequently studied in the mathematical fields of combinatorics and special functions. In these settings, the limit is often formal, as is often discrete-valued (for example, it may represent a prime power). ''q''-analogs find applications in a number of areas, including the study of fractals and multi-fractal measures, and expressions for the entropy of chaotic ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Permutation
In mathematics, a permutation of a set is, loosely speaking, an arrangement of its members into a sequence or linear order, or if the set is already ordered, a rearrangement of its elements. The word "permutation" also refers to the act or process of changing the linear order of an ordered set. Permutations differ from combinations, which are selections of some members of a set regardless of order. For example, written as tuples, there are six permutations of the set , namely (1, 2, 3), (1, 3, 2), (2, 1, 3), (2, 3, 1), (3, 1, 2), and (3, 2, 1). These are all the possible orderings of this three-element set. Anagrams of words whose letters are different are also permutations: the letters are already ordered in the original word, and the anagram is a reordering of the letters. The study of permutations of finite sets is an important topic in the fields of combinatorics and group theory. Permutations are used in almost every branch of mathematics, and in many other fields of scie ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Mathematics
Mathematics is an area of knowledge that includes the topics of numbers, formulas and related structures, shapes and the spaces in which they are contained, and quantities and their changes. These topics are represented in modern mathematics with the major subdisciplines of number theory, algebra, geometry, and analysis, respectively. There is no general consensus among mathematicians about a common definition for their academic discipline. Most mathematical activity involves the discovery of properties of abstract objects and the use of pure reason to prove them. These objects consist of either abstractions from nature orin modern mathematicsentities that are stipulated to have certain properties, called axioms. A ''proof'' consists of a succession of applications of deductive rules to already established results. These results include previously proved theorems, axioms, andin case of abstraction from naturesome basic properties that are considered true starting points of ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Series (mathematics)
In mathematics, a series is, roughly speaking, a description of the operation of adding infinitely many quantities, one after the other, to a given starting quantity. The study of series is a major part of calculus and its generalization, mathematical analysis. Series are used in most areas of mathematics, even for studying finite structures (such as in combinatorics) through generating functions. In addition to their ubiquity in mathematics, infinite series are also widely used in other quantitative disciplines such as physics, computer science, statistics and finance. For a long time, the idea that such a potentially infinite summation could produce a finite result was considered paradoxical. This paradox was resolved using the concept of a limit during the 17th century. Zeno's paradox of Achilles and the tortoise illustrates this counterintuitive property of infinite sums: Achilles runs after a tortoise, but when he reaches the position of the tortoise at the beginning of ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Theta Function
In mathematics, theta functions are special functions of several complex variables. They show up in many topics, including Abelian varieties, moduli spaces, quadratic forms, and solitons. As Grassmann algebras, they appear in quantum field theory. The most common form of theta function is that occurring in the theory of elliptic functions. With respect to one of the complex variables (conventionally called ), a theta function has a property expressing its behavior with respect to the addition of a period of the associated elliptic functions, making it a quasiperiodic function. In the abstract theory this quasiperiodicity comes from the cohomology class of a line bundle on a complex torus, a condition of descent. One interpretation of theta functions when dealing with the heat equation is that "a theta function is a special function that describes the evolution of temperature on a segment domain subject to certain boundary conditions". Throughout this article, (e^)^ should b ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Elliptic Gamma Function
In mathematics, the elliptic gamma function is a generalization of the q-gamma function, which is itself the q-analog of the ordinary gamma function. It is closely related to a function studied by , and can be expressed in terms of the triple gamma function. It is given by :\Gamma (z;p,q) = \prod_^\infty \prod_^\infty \frac. It obeys several identities: :\Gamma(z;p,q)=\frac\, :\Gamma(pz;p,q)=\theta (z;q) \Gamma (z; p,q)\, and :\Gamma(qz;p,q)=\theta (z;p) \Gamma (z; p,q)\, where θ is the q-theta function. When p=0, it essentially reduces to the infinite q-Pochhammer symbol In mathematical area of combinatorics, the ''q''-Pochhammer symbol, also called the ''q''-shifted factorial, is the product (a;q)_n = \prod_^ (1-aq^k)=(1-a)(1-aq)(1-aq^2)\cdots(1-aq^), with (a;q)_0 = 1. It is a ''q''-analog of the Pochhammer symb ...: :\Gamma(z;0,q)=\frac. Multiplication Formula Define :\tilde(z;p,q):=\frac(\theta(q;p))^\prod_^\infty \prod_^\infty \frac. Then the following formula hol ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Basic Hypergeometric Series
In mathematics, basic hypergeometric series, or ''q''-hypergeometric series, are ''q''-analogue generalizations of generalized hypergeometric series, and are in turn generalized by elliptic hypergeometric series. A series ''x''''n'' is called hypergeometric if the ratio of successive terms ''x''''n''+1/''x''''n'' is a rational function of ''n''. If the ratio of successive terms is a rational function of ''q''''n'', then the series is called a basic hypergeometric series. The number ''q'' is called the base. The basic hypergeometric series _2\phi_1(q^,q^;q^;q,x) was first considered by . It becomes the hypergeometric series F(\alpha,\beta;\gamma;x) in the limit when base q =1. Definition There are two forms of basic hypergeometric series, the unilateral basic hypergeometric series φ, and the more general bilateral basic hypergeometric series ψ. The unilateral basic hypergeometric series is defined as :\;_\phi_k \left begin a_1 & a_2 & \ldots & a_ \\ b_1 & b_2 & \ldots & ... [...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) = \mathcal M \ (z ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Gaussian Binomial Coefficient
In mathematics, the Gaussian binomial coefficients (also called Gaussian coefficients, Gaussian polynomials, or ''q''-binomial coefficients) are ''q''-analogs of the binomial coefficients. The Gaussian binomial coefficient, written as \binom nk_q or \beginn\\ k\end_q, is a polynomial in ''q'' with integer coefficients, whose value when ''q'' is set to a prime power counts the number of subspaces of dimension ''k'' in a vector space of dimension ''n'' over \mathbb_q, a finite field with ''q'' elements; i.e. it is the number of points in the finite Grassmannian \mathrm(k, \mathbb_q^n). Definition The Gaussian binomial coefficients are defined by: :_q = \frac where ''m'' and ''r'' are non-negative integers. If , this evaluates to 0. For , the value is 1 since both the numerator and denominator are empty products. Although the formula at first appears to be a rational function, it actually is a polynomial, because the division is exact in Z ''q''.html" ;"title="/nowiki>''q' ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Field With One Element In mathematics, the field with one element is a suggestive name for an object that should behave similarly to a finite field with a single element, if such a field could exist. This object is denoted F1, or, in a French–English pun, Fun. The name "field with one element" and the notation F1 are only suggestive, as there is no field with one element in classical abstract algebra. Instead, F1 refers to the idea that there should be a way to replace sets and operations, the traditional building blocks for abstract algebra, with other, more flexible objects. Many theories of F1 have been proposed, but it is not clear which, if any, of them give F1 all the desired properties. While there is still no field with a single element in these theories, there is a field-like object whose characteristic is one. Most proposed theories of F1 replace abstract algebra entirely. Mathematical objects such as vector spaces and polynomial ri |