Search Results for ""
1481 - 1490 of 9384 for Numbered Equation 1Search Results
The nth roots of unity are roots e^(2piik/n) of the cyclotomic equation x^n=1, which are known as the de Moivre numbers. The notations zeta_k, epsilon_k, and epsilon_k, where ...
The pedal curve of an epicycloid x = (a+b)cost-b[((a+b)t)/b] (1) y = (a+b)sint-bsin[((a+b)t)/b] (2) with pedal point at the origin is x_p = 1/2(a+2b){cost-cos[((a+b)t)/b]} ...
Generalizing from a straight line (i.e., first degree polynomial) to a kth degree polynomial y=a_0+a_1x+...+a_kx^k, (1) the residual is given by ...
Let i_k(G) be the number of irredundant sets of size k in a graph G, then the irredundance polynomial R_G(x) of G in the variable x is defined as ...
A parallelogram polyomino is a polyomino such that the intersection with every line perpendicular to the main diagonal is a connected segment. The number of parallelogram ...
Grünbaum conjectured that for every m>1, n>2, there exists an m-regular, m-chromatic graph of girth at least n. This result is trivial for n=2 or m=2,3, but only a small ...
There are a number of point processes which are called Hawkes processes and while many of these notions are similar, some are rather different. There are also different ...
For a subgroup H of a group G, the index of H, denoted (G:H), is the cardinal number of the set of left cosets of H in G (which is equal to the cardinal number of the set of ...
There are several definitions of "almost Hamiltonian" in use. As defined by Punnim et al. (2007), an almost Hamiltonian graph is a graph on n nodes having Hamiltonian number ...
The unique (modulo rotations) scalene triangle formed from three vertices of a regular heptagon, having vertex angles pi/7, 2pi/7, and 4pi/7. There are a number of amazing ...
...


