Search Results for ""

The Grassmann graph J_q(n,k) is defined such that the vertices are the k-dimensional subspaces of an n-dimensional finite field of order q and edges correspond to pairs of ...

Given two groups G and H, there are several ways to form a new group. The simplest is the direct product, denoted G×H. As a set, the group direct product is the Cartesian ...

The group direct sum of a sequence {G_n}_(n=0)^infty of groups G_n is the set of all sequences {g_n}_(n=0)^infty, where each g_n is an element of G_n, and g_n is equal to the ...

The gyroelongated pentagonal pyramid is Johnson solid J_(11) and can be obtained by cumulating the top of a pentagonal antiprism, or alternately by replacing one pentagonal ...

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

An apodization function, also called the Hann function, frequently used to reduce leakage in discrete Fourier transforms. The illustrations above show the Hanning function, ...

A connected labeled graph with n graph edges in which all graph vertices can be labeled with distinct integers (mod n) so that the sums of the pairs of numbers at the ends of ...

Marsaglia (1972) has given a simple method for selecting points with a uniform distribution on the surface of a 4-sphere. This is accomplished by picking two pairs of points ...

The inner Napoleon circle, a term coined here for the first time, is the circumcircle of the inner Napoleon triangle. It has center at the triangle centroid G (and is thus ...

The skeleton graphs of the Johnson solids are polyhedral graphs. The Johnson skeleton graphs J_3 and J_(63) are minimal unit-distance forbidden graphs. The skeleton of the ...