TOPICS
Search

Search Results for ""


71 - 80 of 371 for Permutation combinationsSearch Results
An odd alternating permutation number, more commonly called an Euler number or secant number.
The simplest interpretation of the Kronecker delta is as the discrete version of the delta function defined by delta_(ij)={0 for i!=j; 1 for i=j. (1) The Kronecker delta is ...
The rook numbers r_k^((m,n)) of an m×n board are the number of subsets of size k such that no two elements have the same first or second coordinate. In other word, it is the ...
Let G be a permutation group on a set Omega and x be an element of Omega. Then G_x={g in G:g(x)=x} (1) is called the stabilizer of x and consists of all the permutations of G ...
Stanley and Wilf conjectured (Bona 1997, Arratia 1999), that for every permutation pattern sigma, there is a constant c(sigma)<infty such that for all n, ...
An affine transformation is any transformation that preserves collinearity (i.e., all points lying on a line initially still lie on a line after transformation) and ratios of ...
The orthic axis of the excentral triangle, which is central line L_1 (Casey 1888, p. 177; Kimberling 1998, p. 150) and therefore has trilinear equation alpha+beta+gamma=0. It ...
1 1 2 2 3 5 5 7 10 15 15 20 27 37 52 The Bell triangle, also called Aitken's array or the Peirce triangle (Knuth 2005, p. 28), is the number triangle obtained by beginning ...
An algorithm that can be used to factor a polynomial f over the integers. The algorithm proceeds by first factoring f modulo a suitable prime p via Berlekamp's method and ...
Combinatorial geometry is a blending of principles from the areas of combinatorics and geometry. It deals with combinations and arrangements of geometric objects and with ...
1 ... 5|6|7|8|9|10|11 ... 38 Previous Next

...