Search Results for ""

A Bessel function Z_n(x) is a function defined by the recurrence relations Z_(n+1)+Z_(n-1)=(2n)/xZ_n (1) and Z_(n+1)-Z_(n-1)=-2(dZ_n)/(dx). (2) The Bessel functions are more ...

A Mycielski graph M_k of order k is a triangle-free graph with chromatic number k having the smallest possible number of vertices. For example, triangle-free graphs with ...

An automorphic function f(z) of a complex variable z is one which is analytic (except for poles) in a domain D and which is invariant under a countably infinite group of ...

The box fractal is a fractal also called the anticross-stitch curve which can be constructed using string rewriting beginning with a cell [1] and iterating the rules {0->[0 0 ...

Cantor dust is a fractal that can be constructed using string rewriting beginning with a cell [0] and iterating the rules {0->[0 0 0; 0 0 0; 0 0 0],1->[1 0 1; 0 0 0; 1 0 1]}. ...

Given a polygon with an even number of sides, the derived polygon is obtained by joining the points which are a fractional distance r along each side. If r=1/2, then the ...

The operator representing the computation of a derivative, D^~=d/(dx), (1) sometimes also called the Newton-Leibniz operator. The second derivative is then denoted D^~^2, the ...

The Haferman carpet is the beautiful fractal constructed using string rewriting beginning with a cell [1] and iterating the rules {0->[1 1 1; 1 1 1; 1 1 1],1->[0 1 0; 1 0 1; ...

The solid cut from a horizontal cylinder of length L and radius R by a single plane oriented parallel to the cylinder's axis of symmetry (i.e., a portion of a horizontal ...

A linear congruence equation ax=b (mod m) (1) is solvable iff the congruence b=0 (mod d) (2) with d=GCD(a,m) is the greatest common divisor is solvable. Let one solution to ...