TOPICS
Search

Search Results for ""


2241 - 2250 of 2283 for Triangular Grid GraphSearch Results
Chebyshev iteration is a method for solving nonsymmetric problems (Golub and van Loan 1996, §10.1.5; Varga, 1962, Ch. 5). Chebyshev iteration avoids the computation of inner ...
A derangement is a permutation in which none of the objects appear in their "natural" (i.e., ordered) place. For example, the only derangements of {1,2,3} are {2,3,1} and ...
The fundamental group of an arcwise-connected set X is the group formed by the sets of equivalence classes of the set of all loops, i.e., paths with initial and final points ...
The great rhombicuboctahedron (Cundy and Rowlett 1989, p. 106) is the 26-faced Archimedean solid consisting of faces 12{4}+8{6}+6{8}. It is sometimes called the ...
There are a number of algebraic equations known as the icosahedral equation, all of which derive from the projective geometry of the icosahedron. Consider an icosahedron ...
The Kepler-Poinsot polyhedra are four regular polyhedra which, unlike the Platonic solids, contain intersecting facial planes. In addition, two of the four Kepler-Poinsot ...
A magic cube is an n×n×n version of a magic square in which the n^2 rows, n^2 columns, n^2 pillars, and four space diagonals each sum to a single number M_3(n) known as the ...
A magic hexagon of order n is an arrangement of close-packed hexagons containing the numbers 1, 2, ..., H_(n-1), where H_n is the nth hex number such that the numbers along ...
Also called the ménage problem. In how many ways can n married couples be seated around a circular table in such a manner than there is always one man between two women and ...
A partition is a way of writing an integer n as a sum of positive integers where the order of the addends is not significant, possibly subject to one or more additional ...

...