Search Results for ""

The q-analog of integration is given by int_0^1f(x)d(q,x)=(1-q)sum_(i=0)^inftyf(q^i)q^i, (1) which reduces to int_0^1f(x)dx (2) in the case q->1^- (Andrews 1986 p. 10). ...

A q-analog of Zeilberger's algorithm.

A (0,1)-matrix is an integer matrix in which each element is a 0 or 1. It is also called a logical matrix, binary matrix, relation matrix, or Boolean matrix. The number of ...

An alternating sign matrix is a matrix of 0s, 1s, and -1s in which the entries in each row or column sum to 1 and the nonzero entries in each row and column alternate in ...

A finite group G has a finite number of conjugacy classes and a finite number of distinct irreducible representations. The group character of a group representation is ...

The divergence of a vector field F, denoted div(F) or del ·F (the notation used in this work), is defined by a limit of the surface integral del ·F=lim_(V->0)(∮_SF·da)/V (1) ...

A finite field is a field with a finite field order (i.e., number of elements), also called a Galois field. The order of a finite field is always a prime or a power of a ...

The fundamental group of an arcwise-connected set X is the group formed by the sets of equivalence classes of the set of all loops, i.e., paths with initial and final points ...

The term metric signature refers to the signature of a metric tensor g=g_(ij) on a smooth manifold M, a tool which quantifies the numbers of positive, zero, and negative ...

A random matrix is a matrix of given type and size whose entries consist of random numbers from some specified distribution. Random matrix theory is cited as one of the ...