Search Results for ""
1591 - 1600 of 13134 for Extremal graph theorySearch Results
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 ...
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.
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.
One name for the figure used by Euclid to prove the Pythagorean theorem.
The partial differential equation ((partial^2)/(partialt^2)-(partial^2)/(partialx^2))((u_(xy))/u)+2(u^2)_(xt)=0.
Multivariable Calculus
Bridge is a card game played with a normal deck of 52 cards. The number of possible distinct 13-card hands is N=(52; 13)=635013559600, (1) where (n; k) is a binomial ...
...
View search results from all Wolfram sites (34319 matches)

