TOPICS
Search

Search Results for ""


531 - 540 of 1837 for Klein Gordon EquationSearch Results
The elliptic lambda function lambda(tau) is a lambda-modular function defined on the upper half-plane by lambda(tau)=(theta_2^4(0,q))/(theta_3^4(0,q)), (1) where tau is the ...
Graham's biggest little hexagon is the largest possible (not necessarily regular) convex hexagon with polygon diameter 1 (i.e., for which no two of the vertices are more than ...
A graph H is a minor of a graph G if a copy of H can be obtained from G via repeated edge deletion and/or edge contraction. The Kuratowski reduction theorem states that any ...
A function f is said to be an entire modular form of weight k if it satisfies 1. f is analytic in the upper half-plane H, 2. f((atau+b)/(ctau+d))=(ctau+d)^kf(tau) whenever [a ...
A graph with projective plane crossing number equal to 0 may be said to be projective planar. Examples of projective planar graphs with graph crossing number >=2 include the ...
The real projective plane is the closed topological manifold, denoted RP^2, that is obtained by projecting the points of a plane E from a fixed point P (not on the plane), ...
A unit circle is a circle of unit radius, i.e., of radius 1. The unit circle plays a significant role in a number of different areas of mathematics. For example, the ...
Adding a damping force proportional to x^. to the equation of simple harmonic motion, the first derivative of x with respect to time, the equation of motion for damped simple ...
Given a general quadratic curve Ax^2+Bxy+Cy^2+Dx+Ey+F=0, (1) the quantity X is known as the discriminant, where X=B^2-4AC, (2) and is invariant under rotation. Using the ...
A recursive sequence {f(n)}_n, also known as a recurrence sequence, is a sequence of numbers f(n) indexed by an integer n and generated by solving a recurrence equation. The ...
1 ... 51|52|53|54|55|56|57 ... 184 Previous Next

...