TOPICS
Search

Search Results for ""


711 - 720 of 1924 for sum over paths FeynmanSearch Results
The Lehmer mean of a set of n numbers {a_k}_(k=1)^n is defined by L_p(a_1,...,a_n)=(sum_(k=1)^(n)a_k^p)/(sum_(k=1)^(n)a_k^(p-1)) (Havil 2003, p. 121).
p^~=|phi_i(x)><phi_i(t)| (1) p^~sum_(j)c_j|phi_j(t)>=c_i|phi_i(x)> (2) sum_(i)|phi_i(x)><phi_i(x)|=1. (3)
A generalized hypergeometric function _pF_q[alpha_1,alpha_2,...,alpha_p; beta_1,beta_2,...,beta_q;z], is said to be k-balanced if sum_(i=1)^qbeta_i=k+sum_(i=1)^palpha_i.
The set of roots of a polynomial f(x,y,z)=0. An algebraic surface is said to be of degree n=max(i+j+k), where n is the maximum sum of powers of all terms ...
An antimagic square is an n×n array of integers from 1 to n^2 such that each row, column, and main diagonal produces a different sum such that these sums form a sequence of ...
Given an undirected graph, a degree sequence is a monotonic nonincreasing sequence of the vertex degrees (valencies) of its graph vertices. The number of degree sequences for ...
Exterior algebra is the algebra of the wedge product, also called an alternating algebra or Grassmann algebra. The study of exterior algebra is also called Ausdehnungslehre ...
A Gaussian integer is a complex number a+bi where a and b are integers. The Gaussian integers are members of the imaginary quadratic field Q(sqrt(-1)) and form a ring often ...
A method for finding roots of a polynomial equation f(x)=0. Now find an equation whose roots are the roots of this equation diminished by r, so (1) The expressions for f(r), ...
Let |A| denote the cardinal number of set A, then it follows immediately that |A union B|=|A|+|B|-|A intersection B|, (1) where union denotes union, and intersection denotes ...
1 ... 69|70|71|72|73|74|75 ... 193 Previous Next

...