Search Results for ""

The unknot, also called the trivial knot (Rolfsen 1976, p. 51), is a closed loop that is not knotted. In the 1930s Reidemeister first proved that knots exist which are ...

The distance d(u,v) between two vertices u and v of a finite graph is the minimum length of the paths connecting them (i.e., the length of a graph geodesic). If no such path ...

The Schur decomposition of a complex square matrix A is a matrix decomposition of the form Q^(H)AQ=T=D+N, (1) where Q is a unitary matrix, Q^(H) is its conjugate transpose, ...

The differential forms on C^n decompose into forms of type (p,q), sometimes called (p,q)-forms. For example, on C, the exterior algebra decomposes into four types: ^ C = ^ ^0 ...

The Franel numbers are the numbers Fr_n=sum_(k=0)^n(n; k)^3, (1) where (n; k) is a binomial coefficient. The first few values for n=0, 1, ... are 1, 2, 10, 56, 346, ... (OEIS ...

Any sum of a selection of Pi_ks, where Pi_k denotes a k-D polytope.

An impartial game in which the last player wins. In normal-form games, the nim-value of the sum of two games is the nim-sum of their nim-values.

The sum of the absolute squares of the spherical harmonics Y_l^m(theta,phi) over all values of m is sum_(m=-l)^l|Y_l^m(theta,phi)|^2=(2l+1)/(4pi). (1) The double sum over m ...

A formula for the generalized Catalan number _pd_(qi). The general formula is (n-q; k-1)=sum_(i=1)^k_pd_(qi)(n-pi; k-i), where (n; k) is a binomial coefficient, although ...

Given a positive sequence {a_n}, sqrt(sum_(j=-infty)^infty|sum_(n=-infty; n!=j)^infty(a_n)/(j-n)|^2)<=pisqrt(sum_(n=-infty)^infty|a_n|^2), (1) where the a_ns are real and ...