Search Results for ""

A geodesic is a locally length-minimizing curve. Equivalently, it is a path that a particle which is not accelerating would follow. In the plane, the geodesics are straight ...

Let A be an n×n real square matrix with n>=2 such that |sum_(i=1)^nsum_(j=1)^na_(ij)s_it_j|<=1 (1) for all real numbers s_1, s_2, ..., s_n and t_1, t_2, ..., t_n such that ...

In celestial mechanics, the fixed path a planet traces as it moves around the sun is called an orbit. When a group G acts on a set X (this process is called a group action), ...

A hex number, also called a centered hexagonal number, is given by H_n = 1+6T_n (1) = 3n^2+3n+1, (2) where T_n=n(n+1)/2 is the nth triangular number and the indexing with ...

In hexagonal close packing, layers of spheres are packed so that spheres in alternating layers overlie one another. As in cubic close packing, each sphere is surrounded by 12 ...

A regularly spaced array of points in a square array, i.e., points with coordinates (m,n,...), where m, n, ... are integers. Such an array is often called a grid or mesh, and ...

If f(z) is analytic throughout the annular region between and on the concentric circles K_1 and K_2 centered at z=a and of radii r_1 and r_2<r_1 respectively, then there ...

There are two sets of constants that are commonly known as Lebesgue constants. The first is related to approximation of function via Fourier series, which the other arises in ...

A linear recurrence equation is a recurrence equation on a sequence of numbers {x_n} expressing x_n as a first-degree polynomial in x_k with k<n. For example ...

In the mice problem, also called the beetle problem, n mice start at the corners of a regular n-gon of unit side length, each heading towards its closest neighboring mouse in ...