Search Results for ""

"The" Sylvester graph is a quintic graph on 36 nodes and 90 edges that is the unique distance-regular graph with intersection array {5,4,2;1,1,4} (Brouwer et al. 1989, ...

A technical mathematical object defined in terms of a polynomial ring of n variables over a field k. Syzygies occur in tensors at rank 5, 7, 8, and all higher ranks, and play ...

T-integration, which stands for "tunable numerical integration," is a fast, accurate, and numerically stable numerical integration formula given by ...

A tag system is set of rules that specifies a fixed number of elements (commonly denoted nu or beta) be removed from the beginning of a sequence and a set of elements to be ...

Given a circular table of diameter 9 feet, which is the minimal number of planks (each 1 foot wide and length greater than 9 feet) needed in order to completely cover the ...

A Taylor graph is a distance-regular graph with intersection array {k,mu,1;1,mu,k}. A Taylor graph with these parameters has 2(k+1) vertices. The crown graphs K_2 square ...

The skeleton of the tesseract, commonly denoted Q_4, is a quartic symmetric graph with girth 4 and diameter 4. The automorphism group of the tesseract is of order 2^7·3=384 ...

There are a number of attractive compounds of two regular tetrahedra. The most symmetrical is the arrangement whose outer hull is the stella octangula (left figure), while ...

A number of attractive tetrahedron 5-compounds can be constructed. The first (left figures) is one of the icosahedron stellations in which the 5×4 vertices of the tetrahedra ...

A number of attractive tetrahedron 6-compounds can be constructed. The first compound (left figures) is obtained by combining three stella octangula. A second can be obtained ...