|
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] |
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] |
Binomial Theorem
In elementary algebra, the binomial theorem (or binomial expansion) describes the algebraic expansion of powers of a binomial. According to the theorem, it is possible to expand the polynomial into a sum involving terms of the form , where the exponents and are nonnegative integers with , and the coefficient of each term is a specific positive integer depending on and . For example, for , (x+y)^4 = x^4 + 4 x^3y + 6 x^2 y^2 + 4 x y^3 + y^4. The coefficient in the term of is known as the binomial coefficient \tbinom or \tbinom (the two have the same value). These coefficients for varying and can be arranged to form Pascal's triangle. These numbers also occur in combinatorics, where \tbinom gives the number of different combinations of elements that can be chosen from an -element set. Therefore \tbinom is often pronounced as " choose ". History Special cases of the binomial theorem were known since at least the 4th century BC when Greek mathematician Euclid ment ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Fibonacci Quarterly
The ''Fibonacci Quarterly'' is a scientific journal on mathematical topics related to the Fibonacci numbers, published four times per year. It is the primary publication of The Fibonacci Association, which has published it since 1963. Its founding editors were Verner Emil Hoggatt Jr. and Alfred Brousseau; by Clark Kimberling the present editor is Professor Curtis Cooper of the Mathematics Department of the . The ''Fibonacci Quarterly'' has an editorial board of nineteen members an ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Quantum Groups
In mathematics and theoretical physics, the term quantum group denotes one of a few different kinds of noncommutative algebras with additional structure. These include Drinfeld–Jimbo type quantum groups (which are quasitriangular Hopf algebras), compact matrix quantum groups (which are structures on unital separable C*-algebras), and bicrossproduct quantum groups. Despite their name, they do not themselves have a natural group structure, though they are in some sense 'close' to a group. The term "quantum group" first appeared in the theory of quantum integrable systems, which was then formalized by Vladimir Drinfeld and Michio Jimbo as a particular class of Hopf algebra. The same term is also used for other Hopf algebras that deform or are close to classical Lie groups or Lie algebras, such as a "bicrossproduct" class of quantum groups introduced by Shahn Majid a little after the work of Drinfeld and Jimbo. In Drinfeld's approach, quantum groups arise as Hopf algebras dependi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Euler Characteristic
In mathematics, and more specifically in algebraic topology and polyhedral combinatorics, the Euler characteristic (or Euler number, or Euler–Poincaré characteristic) is a topological invariant, a number that describes a topological space's shape or structure regardless of the way it is bent. It is commonly denoted by \chi ( Greek lower-case letter chi). The Euler characteristic was originally defined for polyhedra and used to prove various theorems about them, including the classification of the Platonic solids. It was stated for Platonic solids in 1537 in an unpublished manuscript by Francesco Maurolico. Leonhard Euler, for whom the concept is named, introduced it for convex polyhedra more generally but failed to rigorously prove that it is an invariant. In modern mathematics, the Euler characteristic arises from homology and, more abstractly, homological algebra. Polyhedra The Euler characteristic \chi was classically defined for the surfaces of polyhedra, acc ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Vector Space
In mathematics and physics, a vector space (also called a linear space) is a set whose elements, often called ''vectors'', may be added together and multiplied ("scaled") by numbers called '' scalars''. Scalars are often real numbers, but can be complex numbers or, more generally, elements of any field. The operations of vector addition and scalar multiplication must satisfy certain requirements, called ''vector axioms''. The terms real vector space and complex vector space are often used to specify the nature of the scalars: real coordinate space or complex coordinate space. Vector spaces generalize Euclidean vectors, which allow modeling of physical quantities, such as forces and velocity, that have not only a magnitude, but also a direction. The concept of vector spaces is fundamental for linear algebra, together with the concept of matrix, which allows computing in vector spaces. This provides a concise and synthetic way for manipulating and studying systems of linear eq ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Projective Space
In mathematics, the concept of a projective space originated from the visual effect of perspective, where parallel lines seem to meet ''at infinity''. A projective space may thus be viewed as the extension of a Euclidean space, or, more generally, an affine space with points at infinity, in such a way that there is one point at infinity of each direction of parallel lines. This definition of a projective space has the disadvantage of not being isotropic, having two different sorts of points, which must be considered separately in proofs. Therefore, other definitions are generally preferred. There are two classes of definitions. In synthetic geometry, ''point'' and ''line'' are primitive entities that are related by the incidence relation "a point is on a line" or "a line passes through a point", which is subject to the axioms of projective geometry. For some such set of axioms, the projective spaces that are defined have been shown to be equivalent to those resulting from the fol ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Partition (number Theory)
In number theory and combinatorics, a partition of a positive integer , also called an integer partition, is a way of writing as a sum of positive integers. Two sums that differ only in the order of their summands are considered the same partition. (If order matters, the sum becomes a composition.) For example, can be partitioned in five distinct ways: : : : : : The order-dependent composition is the same partition as , and the two distinct compositions and represent the same partition as . A summand in a partition is also called a part. The number of partitions of is given by the partition function . So . The notation means that is a partition of . Partitions can be graphically visualized with Young diagrams or Ferrers diagrams. They occur in a number of branches of mathematics and physics, including the study of symmetric polynomials and of the symmetric group and in group representation theory in general. Examples The seven partitions of 5 are: * 5 * 4 + 1 * 3 + ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Symmetric Polynomial
In mathematics, a symmetric polynomial is a polynomial in variables, such that if any of the variables are interchanged, one obtains the same polynomial. Formally, is a ''symmetric polynomial'' if for any permutation of the subscripts one has . Symmetric polynomials arise naturally in the study of the relation between the roots of a polynomial in one variable and its coefficients, since the coefficients can be given by polynomial expressions in the roots, and all roots play a similar role in this setting. From this point of view the elementary symmetric polynomials are the most fundamental symmetric polynomials. A theorem states that any symmetric polynomial can be expressed in terms of elementary symmetric polynomials, which implies that every ''symmetric'' polynomial expression in the roots of a monic polynomial can alternatively be given as a polynomial expression in the coefficients of the polynomial. Symmetric polynomials also form an interesting structure by themselve ... [...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] |
Pascal's Identity
In mathematics, Pascal's rule (or Pascal's formula) is a combinatorial identity about binomial coefficients. It states that for positive natural numbers ''n'' and ''k'', + = , where \tbinom is a binomial coefficient; one interpretation of the coefficient of the term in the expansion of . There is no restriction on the relative sizes of and , since, if the value of the binomial coefficient is zero and the identity remains valid. Pascal's rule can also be viewed as a statement that the formula \frac = = solves the linear two-dimensional difference equation N_ = N_ + N_, \quad N_ = N_ = 1 over the natural numbers. Thus, Pascal's rule is also a statement about a formula for the numbers appearing in Pascal's triangle. Pascal's rule can also be generalized to apply to multinomial coefficients. Combinatorial proof Pascal's rule has an intuitive combinatorial meaning, that is clearly expressed in this counting proof. ''Proof''. Recall that \tbinom equals the number ... [...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] |
