|
Dixon's Identity
In mathematics, Dixon's identity (or Dixon's theorem or Dixon's formula) is any of several different but closely related identities proved by A. C. Dixon, some involving finite sums of products of three binomial coefficients, and some evaluating a hypergeometric sum. These identities famously follow from the MacMahon Master theorem, and can now be routinely proved by computer algorithms . Statements The original identity, from , is :\sum_^(-1)^^3 =\frac. A generalization, also sometimes called Dixon's identity, is :\sum_(-1)^k = \frac where ''a'', ''b'', and ''c'' are non-negative integers . The sum on the left can be written as the terminating well-poised hypergeometric series :_3F_2(-2a,-a-b,-a-c;1+b-a,1+c-a;1) and the identity follows as a limiting case (as ''a'' tends to an integer) of Dixon's theorem evaluating a well-poised 3''F''2 generalized hypergeometric series at 1, from : :\;_3F_2 (a,b,c;1+a-b,1+a-c;1)= \frac . This holds for Re(1 + ''a'' − ''b'' &minus ... [...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] |
Alfred Cardew Dixon
Sir Alfred Cardew Dixon, 1st Baronet Warford FRS (22 May 1865 – 4 May 1936) was an English mathematician. Biography Dixon was born on 22 May 1865 in Northallerton, Yorkshire, England. He studied at the University of London and graduated with an MA. He entered Trinity College, Cambridge, in 1883 and graduated as Senior Wrangler in the Mathematical Tripos in 1886. In 1888, Dixon was awarded the second Smith's Prize, and also appointed a Fellow of Trinity College, Cambridge. He took the degree of Sc.D. at Cambridge University in 1897. He was Professor of Mathematics at Queen's College, Galway, from 1893 to 1901. In 1901 he was appointed to the chair at Queen's University Belfast, which he held till 1930, receiving the title of Emeritus Professor on retirement. Dixon was elected to the Royal Society in 1904 and after he retired from Queen's University Belfast, he served as president of the London Mathematical Society from 1931 until 1933. Queen's University Belfast conferred ... [...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] |
Hypergeometric Sum
In mathematics, a generalized hypergeometric series is a power series in which the ratio of successive coefficients indexed by ''n'' is a rational function of ''n''. The series, if convergent, defines a generalized hypergeometric function, which may then be defined over a wider domain of the argument by analytic continuation. The generalized hypergeometric series is sometimes just called the hypergeometric series, though this term also sometimes just refers to the Gaussian hypergeometric series. Generalized hypergeometric functions include the (Gaussian) hypergeometric function and the confluent hypergeometric function as special cases, which in turn have many particular special functions as special cases, such as elementary functions, Bessel functions, and the classical orthogonal polynomials. Notation A hypergeometric series is formally defined as a power series :\beta_0 + \beta_1 z + \beta_2 z^2 + \dots = \sum_ \beta_n z^n in which the ratio of successive coefficients is a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
MacMahon Master Theorem
In mathematics, MacMahon's master theorem (MMT) is a result in enumerative combinatorics and linear algebra. It was discovered by Percy MacMahon and proved in his monograph ''Combinatory analysis'' (1916). It is often used to derive binomial identities, most notably Dixon's identity. Background In the monograph, MacMahon found so many applications of his result, he called it "a master theorem in the Theory of Permutations." He explained the title as follows: "a Master Theorem from the masterly and rapid fashion in which it deals with various questions otherwise troublesome to solve." The result was re-derived (with attribution) a number of times, most notably by I. J. Good who derived it from his multilinear generalization of the Lagrange inversion theorem. MMT was also popularized by Carlitz who found an exponential power series version. In 1962, Good found a short proof of Dixon's identity from MMT. In 1969, Cartier and Foata found a new proof of MMT by combining alg ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Generalized Hypergeometric Series
In mathematics, a generalized hypergeometric series is a power series in which the ratio of successive coefficients indexed by ''n'' is a rational function of ''n''. The series, if convergent, defines a generalized hypergeometric function, which may then be defined over a wider domain of the argument by analytic continuation. The generalized hypergeometric series is sometimes just called the hypergeometric series, though this term also sometimes just refers to the Gaussian hypergeometric series. Generalized hypergeometric functions include the (Gaussian) hypergeometric function and the confluent hypergeometric function as special cases, which in turn have many particular special functions as special cases, such as elementary functions, Bessel functions, and the classical orthogonal polynomials. Notation A hypergeometric series is formally defined as a power series :\beta_0 + \beta_1 z + \beta_2 z^2 + \dots = \sum_ \beta_n z^n in which the ratio of successive coefficients is a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Selberg Integral
In mathematics, the Selberg integral is a generalization of Euler beta function to ''n'' dimensions introduced by . Selberg's integral formula When Re(\alpha) > 0, Re(\beta) > 0, Re(\gamma) > -\min \left(\frac 1n , \frac, \frac\right), we have : \begin S_ (\alpha, \beta, \gamma) & = \int_0^1 \cdots \int_0^1 \prod_^n t_i^(1-t_i)^ \prod_ , t_i - t_j , ^\,dt_1 \cdots dt_n \\ & = \prod_^ \frac \end Selberg's formula implies Dixon's identity for well poised hypergeometric series, and some special cases of Dyson's conjecture In mathematics, the Dyson conjecture is a conjecture about the constant term of certain Laurent polynomials, proved independently in 1962 by Wilson and Gunson. Andrews generalized it to the q-Dyson conjecture, proved by Zeilberger and Bressou .... This is a corollary of Aomoto. Aomoto's integral formula proved a slightly more general integral formula. With the same conditions as Selberg's formula, : \int_0^1 \cdots \int_0^1 \left(\prod_^k t_i\right) ... [...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] |
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 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] |
Messenger Of Mathematics
The ''Messenger of Mathematics'' is a defunct British mathematics journal. The founding editor-in-chief was William Allen Whitworth with Charles Taylor and volumes 1–58 were published between 1872 and 1929. James Whitbread Lee Glaisher was the editor-in-chief after Whitworth. In the nineteenth century, foreign contributions represented 4.7% of all pages of mathematics in the journal. History The journal was originally titled ''Oxford, Cambridge and Dublin Messenger of Mathematics''. It was supported by mathematics students and governed by a board of editors composed of members of the universities of Oxford, Cambridge and Dublin (the last being its sole constituent college, Trinity College Dublin). Volumes 1–5 were published between 1862 and 1871. It merged with ''The Quarterly Journal of Pure and Applied Mathematics'' to form the ''Quarterly Journal of Mathematics''. References Further reading * External links''Messenger of Mathematics'', vols. 1–30 (1871&ndas ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Enumerative Combinatorics
Enumerative combinatorics is an area of combinatorics that deals with the number of ways that certain patterns can be formed. Two examples of this type of problem are counting combinations and counting permutations. More generally, given an infinite collection of finite sets ''S''''i'' indexed by the natural numbers, enumerative combinatorics seeks to describe a ''counting function'' which counts the number of objects in ''S''''n'' for each ''n''. Although counting the number of elements in a set is a rather broad mathematical problem, many of the problems that arise in applications have a relatively simple combinatorial description. The twelvefold way provides a unified framework for counting permutations, combinations and partitions. The simplest such functions are ''closed formulas'', which can be expressed as a composition of elementary functions such as factorials, powers, and so on. For instance, as shown below, the number of different possible orderings of a deck of '' ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
