Search Results for ""

A path in a graph G is a subgraph of G that is a path graph (West 2000, p. 20). The length of a path is the number of edges it contains. In most contexts, a path must contain ...

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 dodecahedron is the Kepler-Poinsot polyhedron whose dual is the small stellated dodecahedron. It is also uniform polyhedron with Maeder index 35 (Maeder 1997), ...

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, ...

There are essentially three types of Fisher-Tippett extreme value distributions. The most common is the type I distribution, which are sometimes referred to as Gumbel types ...

A 2-variable oriented knot polynomial P_L(a,z) motivated by the Jones polynomial (Freyd et al. 1985). Its name is an acronym for the last names of its co-discoverers: Hoste, ...

A sequence {a_n}_(n=1)^N forms a (binary) heap if it satisfies a_(|_j/2_|)<=a_j for 2<=j<=N, where |_x_| is the floor function, which is equivalent to a_i<a_(2i) and ...

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 ...