Search Results for ""

Let a, b, and k be integers with k>=1. For j=0, 1, 2, let S_j=sum_(i=j (mod 3))(-1)^i(k; i)a^(k-i)b^i. Then 2(a^2+ab+b^2)^(2k)=(S_0-S_1)^4+(S_1-S_2)^4+(S_2-S_0)^4.

Let Gamma be a representation for a group of group order h, then sum_(R)Gamma_i(R)_(mn)Gamma_j(R)_(m^'n^')^*=h/(sqrt(l_il_j))delta_(ij)delta_(mm^')delta_(nn^'). The proof is ...

Let X={x_1>=x_2>=...>=x_n|x_i in R} (1) and Y={y_1>=y_2>=...>=y_n|y_i in R}. (2) Then there exists an n×n Hermitian matrix with eigenvalues X and diagonal elements Y iff ...

e^(izcostheta)=sum_(n=-infty)^inftyi^nJ_n(z)e^(intheta), where J_n(z) is a Bessel function of the first kind. The identity can also be written ...

Two curves phi and psi satisfying phi+psi=0 are said to be linearly dependent. Similarly, n curves phi_i, i=1, ..., n are said to be linearly dependent if sum_(i=1)^nphi_i=0.

The maximal independence polynomial I_G(x) for the graph G may be defined as the polynomial I_G(x)=sum_(k=i(G))^(alpha(G))s_kx^k, where i(G) is the lower independence number, ...

The maximal irredundance polynomial R_G(x) for the graph G may be defined as the polynomial R_G(x)=sum_(k=ir(G))^(IR(G))r_kx^k, where ir(G) is the (lower) irredundance ...

The maximal matching-generating polynomial M_G(x) for the graph G may be defined as the polynomial M_G(x)=sum_(k=nu_L(G))^(nu(G))m_kx^k, where nu_L(G) is the lower matching ...

Let pi_n(x)=product_(k=0)^n(x-x_k), (1) then f(x)=f_0+sum_(k=1)^npi_(k-1)(x)[x_0,x_1,...,x_k]+R_n, (2) where [x_1,...] is a divided difference, and the remainder is ...

An operator which describes the time evolution of densities in phase space. The operator can be defined by rho_(n+1)=L^~rho_n, where rho_n are the natural invariants after ...