TOPICS
Search

Search Results for ""


51 - 60 of 309 for p><p> CombinatorialSearch Results
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 ...
sum_(k=-infty)^infty(a; m-k)(b; n-k)(a+b+k; k)=(a+n; m)(b+m; n).
A transversal design TD_lambda(k,n) of order n, block size k, and index lambda is a triple (V, G, B) such that 1. V is a set of kn elements, 2. G is a partition of V into k ...
The term "twisted sphere" is used to mean either a projective plane (Henle 1994, p. 110) or the corkscrew surface obtained by extending a sphere along a diameter and then ...
An operator T which maps some basic polynomial sequence p_n(x) into another basic polynomial sequence q_n(x).
The operator e^(nut^2/2) which satisfies e^(nut^2/2)p(x)=1/(sqrt(2pinu))int_(-infty)^inftye^(-u^2/(2nu))p(x+u)du for nu>0.
A t-(v,k,lambda) block design (abbreviated t-design) is an incidence structure of points and blocks such that the following hold: 1. There are v points, 2. Each block ...
Borsuk conjectured that it is possible to cut an n-dimensional shape of generalized diameter 1 into n+1 pieces each with diameter smaller than the original. It is true for ...
A C-matrix is a symmetric (C^(T)=C) or antisymmetric (C^(T)=-C) C_n (-1,0,1)-matrix with diagonal elements 0 and others +/-1 that satisfies CC^(T)=(n-1)I, (1) where I is the ...
A number of strongly regular graphs of several types derived from combinatorial design were identified by Goethals and Seidel (1970). Theorem 2.4 of Goethals and Seidel ...
1 ... 3|4|5|6|7|8|9 ... 31 Previous Next

...