Search Results for ""

Multiple series generalizations of basic hypergeometric series over the unitary groups U(n+1). The fundamental theorem of U(n) series takes c_1, ..., c_n and x_1, ..., x_n as ...

If a is an arbitrary integer relatively prime to n and g is a primitive root of n, then there exists among the numbers 0, 1, 2, ..., phi(n)-1, where phi(n) is the totient ...

A permutation group is a finite group G whose elements are permutations of a given set and whose group operation is composition of permutations in G. Permutation groups have ...

Let n be an integer variable which tends to infinity and let x be a continuous variable tending to some limit. Also, let phi(n) or phi(x) be a positive function and f(n) or ...

Let (L,<=) be any complete lattice. Suppose f:L->L is monotone increasing (or isotone), i.e., for all x,y in L, x<=y implies f(x)<=f(y). Then the set of all fixed points of f ...

The snub cubical graph is the Archimedean graph on 24 nodes and 60 edges obtained by taking the skeleton of the snub cube. It is a quintic graph, is planar, Hamiltonian, and ...

A square which can be dissected into a number of smaller squares with no two equal is called a perfect square dissection (or a squared square). Square dissections in which ...

There are a number of point processes which are called Hawkes processes and while many of these notions are similar, some are rather different. There are also different ...

An n×n-matrix A is said to be diagonalizable if it can be written on the form A=PDP^(-1), where D is a diagonal n×n matrix with the eigenvalues of A as its entries and P is a ...

A doubly stochastic matrix is a matrix A=(a_(ij)) such that a_(ij)>=0 and sum_(i)a_(ij)=sum_(j)a_(ij)=1 is some field for all i and j. In other words, both the matrix itself ...