q-analog

From Wikipedia, the free encyclopedia

In mathematics, in the area of combinatorics and special functions, a q-analog is, roughly speaking, a theorem or identity for a q-series that gives back a known result in the limit, as q → 1 (from inside the complex unit circle in most situations). The earliest q-analog studied in detail is the basic hypergeometric series, which was introduced in the 19th century.

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 symmetries of Fuchsian groups in general (see, for example Indra's pearls and the Apollonian gasket) and the modular group in particular. The connection passes through hyperbolic geometry and ergodic theory, where the elliptic integrals and modular forms play a prominent role; the q-series themselves are closely related to elliptic integrals.

q-analogs also appear in the study of quantum groups and in q-deformed superalgebras. The connection here is similar, in that much of string theory is set in the language of Riemann surfaces, resulting in connections to elliptic curves, which in turn relate to q-series.

1 Introductory examples
2 Combinatorial q-analogs
3 See also
4 References

[edit] Introductory examples

Noticing that

$\lim_{q\rightarrow 1}\frac{1-q^n}{1-q}=n$

(it is not necessary in finite expressions like this to restrict q to the inside of the unit circle), we define the q-analog of n, also known as the q-bracket or q-number of n, to be

$[n]_q=\frac{1-q^n}{1-q}.$

From this one can define the q-analog of the factorial, the q-factorial, as

$\big[n]_q!$	$=[1]_q [2]_q \cdots [n-1]_q [n]_q$
	$=\frac{1-q}{1-q} \frac{1-q^2}{1-q} \cdots \frac{1-q^{n-1}}{1-q} \frac{1-q^n}{1-q}$
	$=1(1+q)\cdots (1+q+\cdots + q^{n-2}) (1+q+\cdots + q^{n-1}).$

Again, one recovers the usual factorial by taking the limit as $q\rightarrow 1$ .

From the q-factorials, one can move on to define the q-binomial coefficients, also known as Gaussian coefficients, Gaussian polynomials, or Gaussian binomials:

$\begin{bmatrix} n\\ k \end{bmatrix}_q = \frac{[n]_q!}{[n-k]_q! [k]_q!}.$

[edit] Combinatorial q-analogs

The Gaussian coefficients count subspaces of a finite vector space. Let q be the number of elements in a finite field. (The number q is then a power of a prime number, q = p^e, so using the letter q is especially appropriate.) Then the number of k-dimensional subspaces of the n-dimensional vector space over the q-element field equals

$\begin{bmatrix} n\\ k \end{bmatrix}_q .$

Letting q approach 1, we get the binomial coefficient

$\begin{pmatrix} n\\ k \end{pmatrix} ,$

or in other words, the number of k-element subsets of an n-element set.

Thus, one can regard a finite vector space as a q-generalization of a set, and the subspaces as the q-generalization of the subsets of the set. This has been a fruitful point of view in finding interesting new theorems. For example, there are q-analogs of Sperner's theorem and Ramsey theory.

[edit] See also

[edit] References

Categories: Number theory | Q-analogs

See also ebooksgratis.com: no banners, no cookies, totally FREE.

q-analog

From Wikipedia, the free encyclopedia

Contents

[edit] Introductory examples

[edit] Combinatorial q-analogs

[edit] See also

[edit] References

Views

Navigation

Interaction

Search

Languages