TOPICS
Search

Search Results for ""


9281 - 9290 of 13135 for Probability Generating FunctionSearch Results
A Hermitian metric on a complex vector bundle assigns a Hermitian inner product to every fiber bundle. The basic example is the trivial bundle pi:U×C^k->U, where U is an open ...
The Herschel nonahedron is a canonical polyhedron whose skeleton is the Herschel graph. It has 11 vertices, 18 edges, and 9 faces. Of the edges, 6 are short and 12 are long. ...
A Hessenberg decomposition is a matrix decomposition of a matrix A into a unitary matrix P and a Hessenberg matrix H such that PHP^(H)=A, where P^(H) denotes the conjugate ...
A Hessenberg matrix is a matrix of the form [a_(11) a_(12) a_(13) ... a_(1(n-1)) a_(1n); a_(21) a_(22) a_(23) ... a_(2(n-1)) a_(2n); 0 a_(32) a_(33) ... a_(3(n-1)) a_(3n); 0 ...
It is especially convenient to specify planes in so-called Hessian normal form. This is obtained from the general equation of a plane ax+by+cz+d=0 (1) by defining the ...
A heterosquare is an n×n array of the integers from 1 to n^2 such that the rows, columns, and diagonals have different sums. (By contrast, in a magic square, they have the ...
The hexacode graph is the incidence graph of the unique symmetric transversal design STD_2[6;3]. It is also a bipartite (0,2)-graph. The hexacode graph is a ...
A flexagon made by folding a strip into adjacent equilateral triangles. The number of states possible in a hexaflexagon is the Catalan number C_5=42.
A hexagon is a six-sided polygon. Several special types of hexagons are illustrated above. In particular, a hexagon with vertices equally spaced around a circle and with all ...
A k×m×n hexagonal grid graph is a graph of adjoined hexagons consisting of k hexagons along the horizontal triangular axis, m along the northeast axis, and n along the ...
1 ... 926|927|928|929|930|931|932 ... 1314 Previous Next

...