Search Results for ""

A formal description of the constraints on the possible configurations of an experiment which is subject to given conditions. A design is sometimes called an experimental ...

The set of "critical values" of a map u:R^n->R^n of map class C^1 has Lebesgue measure 0 in R^n.

Let j, r, and s be distinct integers (mod n), and let W_i be the point of intersection of the side or diagonal V_iV_(i+j) of the n-gon P=[V_1,...,V_n] with the transversal ...

The hexacode graph is the incidence graph of the unique symmetric transversal design STD_2[6;3]. It is also a bipartite (0,2)-graph. The hexacode graph is a ...

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

The pedal curve of circle involute f = cost+tsint (1) g = sint-tcost (2) with the center as the pedal point is the Archimedes' spiral x = tsint (3) y = -tcost. (4)

In the above figure, let E be the intersection of AD and BC and specify that AB∥EF∥CD. Then 1/(AB)+1/(CD)=1/(EF). A beautiful related theorem due to H. Stengel can be stated ...

There are two curves commonly known as the Lamé curve: the ellipse evolute and the superellipse.

A graph G is distance transitive if its automorphism group is transitive on pairs of vertices at each pairwise distance in the graph. Distance-transitivity is a ...

A cupolarotunda in which the bases are in the same orientation.