TOPICS
Search

Search Results for ""


1531 - 1540 of 1998 for Queen's graphSearch Results
The Suzuki group is the sporadic group Suz of order |Suz| = 448345497600 (1) = 2^(13)·3^7·5^2·7·11·13. (2) It is implemented in the Wolfram Language as SuzukiGroupSuz[].
A relation R on a set S is symmetric provided that for every x and y in S we have xRy iff yRx. The symmetric relations on n nodes are isomorphic with the rooted graphs on n ...
A symplectic form on a smooth manifold M is a smooth closed 2-form omega on M which is nondegenerate such that at every point m, the alternating bilinear form omega_m on the ...
When a Young tableau is constructed using the so-called insertion algorithm, an element starts in some position on the first row, from which it may later be bumped. In ...
An n×n array of the integers from 1 to n^2 such that the difference between any one integer and its neighbor (horizontally, vertically, or diagonally, without wrapping ...
Lachlan's term for a set of four points, no three of which are collinear.
A relation on a totally ordered set.
An ordering of permutations in which each two adjacent permutations differ by the transposition of two elements. For the permutations of {1,2,3} there are two listings which ...
A triangular grid, also called an isometric grid (Gardner 1986, pp. 209-210), is a grid formed by tiling the plane regularly with equilateral triangles.
A polynomial is called unimodal if the sequence of its coefficients is unimodal. If P(x) is log-convex and Q(x) is unimodal, then P(x)Q(x) is unimodal.
1 ... 151|152|153|154|155|156|157 ... 200 Previous Next

...