Search Results for ""

The lower matching number of a graph is the minimum size of a maximal independent edge set. The (upper) matching number may be similarly defined as the largest size of an ...

An equilateral parallelogram whose acute angles are 45 degrees. Sometimes, the restriction to 45 degrees is dropped, and it is required only that two opposite angles are ...

A method for constructing magic squares of odd order.

A two-dimensional map similar to the Hénon map but with the term -alphax_n^2 replaced by -alpha|x_n|. It is given by the equations x_(n+1) = 1-alpha|x_n|+y_n (1) y_(n+1) = ...

h_t+(|h|^nh_(xxx))_x=0, where h(x,t) is the height of a film at position x and time t and n is a parameter characteristic of the surface forces.

The Lucas central circle is the circumcircle of the Lucas central triangle. The center, radius, and circle function appear to be complicated, and neither the center nor the ...

The correspondence which relates the Hanoi graph to the isomorphic graph of the odd binomial coefficients in Pascal's triangle, where the adjacencies are determined by ...

Let p be prime and r = r_mp^m+...+r_1p+r_0 (0<=r_i<p) (1) k = k_mp^m+...+k_1p+k_0 (0<=k_i<p), (2) then (r; k)=product_(i=0)^m(r_i; k_i) (mod p). (3) This is proved in Fine ...

Expresses a function in terms of its Radon transform, f(x,y) = R^(-1)(Rf)(x,y) (1) = ...

If Omega subset= C is a domain and phi:Omega->C is a one-to-one analytic function, then phi(Omega) is a domain, and area(phi(Omega))=int_Omega|phi^'(z)|^2dxdy (Krantz 1999, ...