Search Results for ""

The Desargues graph is the cubic symmetric graph on 20 vertices and 30 edges illustrated above in several embeddings. It is isomorphic to the generalized Petersen graph ...

The dihedral group D_6 gives the group of symmetries of a regular hexagon. The group generators are given by a counterclockwise rotation through pi/3 radians and reflection ...

Consider a point P inside a reference triangle DeltaABC, construct line segments AP, BP, and CP. The Ehrmann congruent squares point is the unique point P such that three ...

An equivalence relation on a set X is a subset of X×X, i.e., a collection R of ordered pairs of elements of X, satisfying certain properties. Write "xRy" to mean (x,y) is an ...

Goldberg polyhedra are convex polyhedra first described by Goldberg (1937) and classified in more detail by Hart (2013) for which each face is a regular pentagon or regular ...

An apodization function chosen to minimize the height of the highest sidelobe (Hamming and Tukey 1949, Blackman and Tukey 1959). The Hamming function is given by ...

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

For any two nonzero p-adic numbers a and b, the Hilbert symbol is defined as (a,b)={1 if z^2=ax^2+by^2 has a nonzero solution; -1 otherwise. (1) If the p-adic field is not ...

The technique of extracting the content from geometric (tensor) equations by working in component notation and rearranging indices as required. Index gymnastics is a ...

If any set of points is displaced by X^idx_i where all distance relationships are unchanged (i.e., there is an isometry), then the vector field is called a Killing vector. ...