Search Results for ""

Given a metric g_(alphabeta), the discriminant is defined by g = det(g_(alphabeta)) (1) = |g_(11) g_(12); g_(21) g_(22)| (2) = g_(11)g_(22)-(g_(12))^2. (3) Let g be the ...

Define q=e^(2piitau) (cf. the usual nome), where tau is in the upper half-plane. Then the modular discriminant is defined by ...

Neville's algorithm is an interpolation algorithm which proceeds by first fitting a polynomial of degree 0 through the point (x_k,y_k) for k=1, ..., n, i.e., P_k(x)=y_k. A ...

par The rhombidodecadodecahedron is the uniform polyhedron with Maeder index 38 (Maeder 1997), Wenninger index 76 (Wenninger 1989), Coxeter index 48 (Coxeter et al. 1954), ...

The small ditrigonal dodecicosidodecahedron is the uniform polyhedron with Maeder index 42 (Maeder 1997), Wenninger index 82 (Wenninger 1989), Coxeter index 55 (Coxeter et ...

The small dodecicosidodecahedron is the uniform polyhedron with Maeder index 33 (Maeder 1997), Wenninger index 72 (Wenninger 1989), Coxeter index 42 (Coxeter et al. 1954), ...

The small stellated truncated dodecahedron, also called the quasitruncated small stellated dodecahedron, is the uniform polyhedron with Maeder index 58 (Maeder 1997), ...

The snub dodecadodecahedron, not to be confused with the Archimdean snub dodecahedron, is the uniform polyhedron is the uniform polyhedron with Maeder index 40 (Maeder 1997), ...

The snub icosidodecadodecahedron is the uniform polyhedron with Maeder index 46 (Maeder 1997), Wenninger index 112 (Wenninger 1989), Coxeter index 58 (Coxeter et al. 1954), ...

The Suetake graph is a weakly regular Hamiltonian graph on 231 vertices with parameters (nu,k,lambda,mu)=(72,(12),(0),(0,4)). It is distance-regular with intersection array ...