TOPICS
Search

Search Results for ""


111 - 120 of 464 for Combinatorial designSearch Results
The numbers B_(n,k)(1!,2!,3!,...)=(n-1; k-1)(n!)/(k!), where B_(n,k) is a Bell polynomial.
A projective plane in which every line is a translation line is called a Moufang plane.
An algebra which does not satisfy a(bc)=(ab)c is called a nonassociative algebra.
An orthogonal array OA(k,s) is a k×s^2 array with entries taken from an s-set S having the property that in any two rows, each ordered pair of symbols from S occurs exactly ...
Let x:p(x)->xp(x), then for any operator T, T^'=Tx-xT is called the Pincherle derivative of T. If T is a shift-invariant operator, then its Pincherle derivative is also a ...
A recurrence relation between the function Q arising in quota systems, Q(n,r)=Q(n-1,r-1)+Q(n-1,r).
sum_(k=0)^dr_k^B(d-k)!x^k=sum_(k=0)^d(-1)^kr_k^(B^_)(d-k)!x^k(x+1)^(d-k).
An operator T which commutes with all shift operators E^a, so TE^a=E^aT for all real a in a field. Any two shift-invariant operators commute.
An operator E such that E^ap(x)=p(x+a).
A Skolem sequence of order n is a sequence S={s_1,s_2,...,s_(2n)} of 2n integers such that 1. For every k in {1,2,...,n}, there exist exactly two elements s_i,s_j in S such ...
1 ... 9|10|11|12|13|14|15 ... 47 Previous Next

...