Search Results for ""

A root-finding method which was among the most popular methods for finding roots of univariate polynomials in the 19th and 20th centuries. It was invented independently by ...

The Grassmannian Gr(n,k) is the set of k-dimensional subspaces in an n-dimensional vector space. For example, the set of lines Gr(n+1,1) is projective space. The real ...

A great circle is a section of a sphere that contains a diameter of the sphere (Kern and Bland 1948, p. 87). Sections of the sphere that do not contain a diameter are called ...

The great rhombicosidodecahedro is the 62-faced Archimedean solid with faces 30{4}+20{6}+12{10}. It is also known as the rhombitruncated icosidodecahedron, and is sometimes ...

For an integer n>=2, let gpf(x) denote the greatest prime factor of n, i.e., the number p_k in the factorization n=p_1^(a_1)...p_k^(a_k), with p_i<p_j for i<j. For n=2, 3, ...

The (circular) helicoid is the minimal surface having a (circular) helix as its boundary. It is the only ruled minimal surface other than the plane (Catalan 1842, do Carmo ...

The helm graph H_n is the graph obtained from an n-wheel graph by adjoining a pendant edge at each node of the cycle. Helm graphs are graceful (Gallian 2018), with the odd ...

In hexagonal close packing, layers of spheres are packed so that spheres in alternating layers overlie one another. As in cubic close packing, each sphere is surrounded by 12 ...

Applying the stellation process to the icosahedron gives 20+30+60+20+60+120+12+30+60+60 cells of 11 different shapes and sizes (including the icosahedron itself). The ...

An illusion is an object or drawing which appears to have properties which are physically impossible, deceptive, or counterintuitive. Kitaoka maintains a web page of ...