Search Results for ""
41 - 50 of 1168 for Frobenius Inner ProductSearch Results
For s>1, the Riemann zeta function is given by zeta(s) = sum_(n=1)^(infty)1/(n^s) (1) = product_(k=1)^(infty)1/(1-1/(p_k^s)), (2) where p_k is the kth prime. This is Euler's ...
The free product G*H of groups G and H is the set of elements of the form g_1h_1g_2h_2...g_rh_r, where g_i in G and h_i in H, with g_1 and h_r possibly equal to e, the ...
Let s_b(n) be the sum of the base-b digits of n, and epsilon(n)=(-1)^(s_2(n)) the Thue-Morse sequence, then product_(n=0)^infty((2n+1)/(2n+2))^(epsilon(n))=1/2sqrt(2).
A cumulative product is a sequence of partial products of a given sequence. For example, the cumulative products of the sequence {a,b,c,...}, are a, ab, abc, .... Cumulative ...
Given two groups G and H, there are several ways to form a new group. The simplest is the direct product, denoted G×H. As a set, the group direct product is the Cartesian ...
Suppose that V is a group representation of G, and W is a group representation of H. Then the vector space tensor product V tensor W is a group representation of the group ...
For vectors u=(u_x,u_y,u_z) and v=(v_x,v_y,v_z) in R^3, the cross product in is defined by uxv = x^^(u_yv_z-u_zv_y)-y^^(u_xv_z-u_zv_x)+z^^(u_xv_y-u_yv_x) (1) = ...
A sum-product number is a number n such that the sum of n's digits times the product of n's digit is n itself, for example 135=(1+3+5)(1·3·5). (1) Obviously, such a number ...
A "split" extension G of groups N and F which contains a subgroup F^_ isomorphic to F with G=F^_N^_ and F^_ intersection N^_={e} (Ito 1987, p. 710). Then the semidirect ...
The gamma product (e.g., Prudnikov et al. 1986, pp. 22 and 792), is defined by Gamma[a_1,...,a_m; b_1,...,b_n]=(Gamma(a_1)...Gamma(a_m))/(Gamma(b_1)...Gamma(b_n)), where ...
...
View search results from all Wolfram sites (159334 matches)

