TOPICS
Search

Search Results for ""


791 - 800 of 986 for Kronecker ProductSearch Results
A left Hilbert Algebra A whose involution is an antilinear isometry is called a unimodular Hilbert algebra. The involution is usually denoted xi|->xi^*.
An ordered vector basisv_1,...,v_n for a finite-dimensional vector space V defines an orientation. Another basis w_i=Av_i gives the same orientation if the matrix A has a ...
A function that can be defined as a Dirichlet series, i.e., is computed as an infinite sum of powers, F(n)=sum_(k=1)^infty[f(k)]^n, where f(k) can be interpreted as the set ...
Hilbert's problems are a set of (originally) unsolved problems in mathematics proposed by Hilbert. Of the 23 total appearing in the printed address, ten were actually ...
A permutation, also called an "arrangement number" or "order," is a rearrangement of the elements of an ordered list S into a one-to-one correspondence with S itself. The ...
The prime zeta function P(s)=sum_(p)1/(p^s), (1) where the sum is taken over primes is a generalization of the Riemann zeta function zeta(s)=sum_(k=1)^infty1/(k^s), (2) where ...
A prism graph, denoted Y_n, D_n (Gallian 1987), or Pi_n (Hladnik et al. 2002), and sometimes also called a circular ladder graph and denoted CL_n (Gross and Yellen 1999, p. ...
Let a spherical triangle be drawn on the surface of a sphere of radius R, centered at a point O=(0,0,0), with vertices A, B, and C. The vectors from the center of the sphere ...
As originally stated by Gould (1972), GCD{(n-1; k),(n; k-1),(n+1; k+1)} =GCD{(n-1; k-1),(n; k+1),(n+1; k)}, (1) where GCD is the greatest common divisor and (n; k) is a ...
A connective in logic which yields true if all conditions are true, and false if any condition is false. A AND B is denoted A ^ B (Mendelson 1997, p. 12), A&B, A intersection ...
1 ... 77|78|79|80|81|82|83 ... 99 Previous Next

...