Search Results for ""
1061 - 1070 of 1485 for Elliptic integralSearch Results
States that for a nondissipative Hamiltonian system, phase space density (the area between phase space contours) is constant. This requires that, given a small time increment ...
A field which is complete with respect to a discrete valuation is called a local field if its field of residue classes is finite. The Hasse principle is one of the chief ...
A topology tau on a topological vector space X=(X,tau) (with X usually assumed to be T2) is said to be locally convex if tau admits a local base at 0 consisting of balanced, ...
The log sine function, also called the logsine function, is defined by S_n=int_0^pi[ln(sinx)]^ndx. (1) The first few cases are given by S_1 = -piln2 (2) S_2 = ...
The M_(22) graph, also known as the 77-graph, is a strongly regular graph on 77 nodes related to the Mathieu group M_(22) and to the Witt design. It is illustrated above in ...
A triangle center alpha:beta:gamma is called a major triangle center if the triangle center function alpha=f(a,b,c,A,B,C) is a function of angle A alone, and therefore beta ...
The inconic having inconic parameters x:y:z=a/(b+c-a):b/(a+c-b):c/(a+b-c). Its center is the mittenpunkt M of the triangle and its Brianchon point is the Nagel point Na. The ...
Formulas obtained from differentiating Newton's forward difference formula, where R_n^'=h^nf^((n+1))(xi)d/(dp)(p; n+1)+h^(n+1)(p; n+1)d/(dx)f^((n+1))(xi), (n; k) is a ...
Call a graph vertex m(a,b,c) a median of a graph G if it lies on all shortest paths between each pair of vertices (a,b), (b,a), and (c,a) in G. A median graph is then defined ...
(1) where H_n(x) is a Hermite polynomial (Watson 1933; Erdélyi 1938; Szegö 1975, p. 380). The generating function ...
...