TOPICS
Search

Search Results for ""


41 - 50 of 13135 for Combinatorial MathematicsSearch Results
The Jack polynomials are a family of multivariate orthogonal polynomials dependent on a positive parameter alpha. Orthogonality of the Jack polynomials is proved in Macdonald ...
The Schröder number S_n is the number of lattice paths in the Cartesian plane that start at (0, 0), end at (n,n), contain no points above the line y=x, and are composed only ...
In the technical combinatorial sense, an a-ary necklace of length n is a string of n characters, each of a possible types. Rotation is ignored, in the sense that b_1b_2...b_n ...
A sequence of polynomials p_n satisfying the identities p_n(x+y)=sum_(k>=0)(n; k)p_k(x)p_(n-k)(y).
A shift-invariant operator Q for which Qx is a nonzero constant. 1. Qa=0 for every constant a. 2. If p(x) is a polynomial of degree n, Qp(x) is a polynomial of degree n-1. 3. ...
Let S be a set of n+1 symbols, then a Howell design H(s,2n) on symbol set S is an s×s array H such that 1. Every cell of H is either empty or contains an unordered pair of ...
The intersection number omega(G) of a given graph G is the minimum number of elements in a set S such that G is an intersection graph on S.
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 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 ...
1|2|3|4|5|6|7|8 ... 1314 Previous Next

...