|
Q-difference Polynomial
In combinatorial mathematics, the ''q''-difference polynomials or ''q''-harmonic polynomials are a polynomial sequence defined in terms of the ''q''-derivative. They are a generalized type of Brenke polynomial, and generalize the Appell polynomials. See also Sheffer sequence. Definition The q-difference polynomials satisfy the relation :\left(\frac \right)_q p_n(z) = \frac = \frac p_(z)= qp_(z) where the derivative symbol on the left is the q-derivative. In the limit of q\to 1, this becomes the definition of the Appell polynomials: :\fracp_n(z) = np_(z). Generating function The generalized generating function for these polynomials is of the type of generating function for Brenke polynomials, namely :A(w)e_q(zw) = \sum_^\infty \frac w^n where e_q(t) is the q-exponential: :e_q(t)=\sum_^\infty \frac= \sum_^\infty \frac. Here, q! is the q-factorial and :(q;q)_n=(1-q^n)(1-q^)\cdots (1-q) is the q-Pochhammer symbol In the mathematical field of combinatorics, the ''q''-P ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Combinatorics
Combinatorics is an area of mathematics primarily concerned with counting, both as a means and as an end to obtaining results, and certain properties of finite structures. It is closely related to many other areas of mathematics and has many applications ranging from logic to statistical physics and from evolutionary biology to computer science. Combinatorics is well known for the breadth of the problems it tackles. Combinatorial problems arise in many areas of pure mathematics, notably in algebra, probability theory, topology, and geometry, as well as in its many application areas. Many combinatorial questions have historically been considered in isolation, giving an ''ad hoc'' solution to a problem arising in some mathematical context. In the later twentieth century, however, powerful and general theoretical methods were developed, making combinatorics into an independent branch of mathematics in its own right. One of the oldest and most accessible parts of combinatorics ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mathematics
Mathematics is a field of study that discovers and organizes methods, Mathematical theory, theories and theorems that are developed and Mathematical proof, proved for the needs of empirical sciences and mathematics itself. There are many areas of mathematics, which include number theory (the study of numbers), algebra (the study of formulas and related structures), geometry (the study of shapes and spaces that contain them), Mathematical analysis, analysis (the study of continuous changes), and set theory (presently used as a foundation for all mathematics). Mathematics involves the description and manipulation of mathematical object, abstract objects that consist of either abstraction (mathematics), abstractions from nature orin modern mathematicspurely abstract entities that are stipulated to have certain properties, called axioms. Mathematics uses pure reason to proof (mathematics), prove properties of objects, a ''proof'' consisting of a succession of applications of in ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Polynomial Sequence
In mathematics, a polynomial sequence is a sequence of polynomials indexed by the nonnegative integers 0, 1, 2, 3, ..., in which each index is equal to the degree of the corresponding polynomial. Polynomial sequences are a topic of interest in enumerative combinatorics and algebraic combinatorics, as well as applied mathematics. Examples Some polynomial sequences arise in physics and approximation theory as the solutions of certain ordinary differential equations: * Laguerre polynomials * Chebyshev polynomials * Legendre polynomials * Jacobi polynomials Others come from statistics: * Hermite polynomials Many are studied in algebra and combinatorics: * Monomials * Rising factorials * Falling factorials * All-one polynomials * Abel polynomials * Bell polynomials * Bernoulli polynomials * Cyclotomic polynomials * Dickson polynomials * Fibonacci polynomials * Lagrange polynomials * Lucas polynomials * Spread polynomials * Touchard polynomials * Rook polynomial ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Q-derivative
In mathematics, in the area of combinatorics and quantum calculus, the ''q''-derivative, or Jackson derivative, is a ''q''-analog of the ordinary derivative, introduced by Frank Hilton Jackson. It is the inverse of Jackson's ''q''-integration. For other forms of q-derivative, see . Definition The ''q''-derivative of a function ''f''(''x'') is defined as :\left(\frac\right)_q f(x)=\frac. It is also often written as D_qf(x). The ''q''-derivative is also known as the Jackson derivative. Formally, in terms of Lagrange's shift operator in logarithmic variables, it amounts to the operator :D_q= \frac ~ \frac ~, which goes to the plain derivative, D_q \to \frac as q \to 1. It is manifestly linear, :\displaystyle D_q (f(x)+g(x)) = D_q f(x) + D_q g(x)~. It has a product rule analogous to the ordinary derivative product rule, with two equivalent forms :\displaystyle D_q (f(x)g(x)) = g(x)D_q f(x) + f(qx)D_q g(x) = g(qx)D_q f(x) + f(x)D_q g(x). Similarly, it satisfies a quotient r ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Brenke Polynomial
William Charles Brenke (April 12, 1874, Berlin – 1964) was an American mathematician who introduced Brenke polynomials and wrote several undergraduate textbooks. He received his PhD in mathematics at Harvard under Maxime Bôcher. Brenke taught at the University of Nebraska A university () is an educational institution, institution of tertiary education and research which awards academic degrees in several Discipline (academia), academic disciplines. ''University'' is derived from the Latin phrase , which roughly ... mathematics department from 1908 to 1944 and was chair of the department from 1934 to 1944. He retired in 1943 but his successor, Ralph Hull, was put on official leave to do war work and returned from leave in 1945. Publications * * References External links * 1874 births 1964 deaths 20th-century American mathematicians Harvard Graduate School of Arts and Sciences alumni University of Nebraska–Lincoln faculty Emigrants from the German Empire to ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Appell Polynomial
In mathematics, an Appell sequence, named after Paul Émile Appell, is any polynomial sequence \_ satisfying the identity :\frac p_n(x) = np_(x), and in which p_0(x) is a non-zero constant. Among the most notable Appell sequences besides the trivial example \ are the Hermite polynomials, the Bernoulli polynomials, and the Euler polynomials. Every Appell sequence is a Sheffer sequence, but most Sheffer sequences are not Appell sequences. Appell sequences have a probabilistic interpretation as systems of moments. Equivalent characterizations of Appell sequences The following conditions on polynomial sequences can easily be seen to be equivalent: * For n = 1, 2, 3,\ldots, ::\frac p_n(x) = n p_(x) :and p_0(x) is a non-zero constant; * For some sequence \_^ of scalars with c_0 \neq 0, ::p_n(x) = \sum_^n \binom c_k x^; * For the same sequence of scalars, ::p_n(x) = \left(\sum_^\infty \frac D^k\right) x^n, :where ::D = \frac; * For n=0,1,2,\ldots, ::p_n(x+y) = \sum_^n \b ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Sheffer Sequence
In mathematics, a Sheffer sequence or poweroid is a polynomial sequence, i.e., a sequence of polynomials in which the index of each polynomial equals its degree, satisfying conditions related to the umbral calculus in combinatorics. They are named for Isador M. Sheffer. Definition Fix a polynomial sequence (''p''''n''). Define a linear operator ''Q'' on polynomials in ''x'' by Qp_n(x) = np_(x)\, . This determines ''Q'' on all polynomials. The polynomial sequence ''p''''n'' is a ''Sheffer sequence'' if the linear operator ''Q'' just defined is ''shift-equivariant''; such a ''Q'' is then a delta operator. Here, we define a linear operator ''Q'' on polynomials to be ''shift-equivariant'' if, whenever ''f''(''x'') = ''g''(''x'' + ''a'') = ''T''''a'' ''g''(''x'') is a "shift" of ''g''(''x''), then (''Qf'')(''x'') = (''Qg'')(''x'' + ''a''); i.e., ''Q'' commutes with every shift operator: ''T''''a''''Q'' = ''QT''''a''. Properties The set of all Sheffer sequences is a group unde ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Generating Function
In mathematics, a generating function is a representation of an infinite sequence of numbers as the coefficients of a formal power series. Generating functions are often expressed in closed form (rather than as a series), by some expression involving operations on the formal series. There are various types of generating functions, including ordinary generating functions, exponential generating functions, Lambert series, Bell series, and Dirichlet series. Every sequence in principle has a generating function of each type (except that Lambert and Dirichlet series require indices to start at 1 rather than 0), but the ease with which they can be handled may differ considerably. The particular generating function, if any, that is most useful in a given context will depend upon the nature of the sequence and the details of the problem being addressed. Generating functions are sometimes called generating series, in that a series of terms can be said to be the generator of its sequence ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Q-exponential
The term ''q''-exponential occurs in two contexts. The q-exponential distribution, based on the Tsallis q-exponential is discussed in elsewhere. In combinatorial mathematics, a ''q''-exponential is a ''q''-analog of the exponential function, namely the eigenfunction of a ''q''-derivative. There are many ''q''-derivatives, for example, the classical ''q''-derivative, the Askey–Wilson operator, etc. Therefore, unlike the classical exponentials, ''q''-exponentials are not unique. For example, e_q(z) is the ''q''-exponential corresponding to the classical ''q''-derivative while \mathcal_q(z) are eigenfunctions of the Askey–Wilson operators. The ''q''-exponential is also known as the quantum dilogarithm. Definition The ''q''-exponential e_q(z) is defined as :e_q(z)= \sum_^\infty \frac = \sum_^\infty \frac = \sum_^\infty z^n\frac where _q is the ''q''-factorial and :(q;q)_n=(1-q^n)(1-q^)\cdots (1-q) is the ''q''-Pochhammer symbol. That this is the ''q''-analog ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Q-factorial
In the mathematical field 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, numbe ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Q-analogs
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. ''q''-analogs 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 dynamical systems. The relationship to fractals and dynamical systems results from the fact that many fractal patterns have the symme ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
