Search Results for ""

The Szekeres snark was the fifth snark discovered, illustrated above. It has 50 vertices and edge chromatic number 4.

The function defined by U(p)=(p#)^(p#), where p is a prime number and p# is a primorial. The values for p=2, 3, ..., are 4, 46656, ...

The number of graph edges meeting at a given node in a graph is called the order of that graph vertex.

x^n=sum_(k=0)^n<n; k>(x+k; n), where <n; k> is an Eulerian number and (n; k) is a binomial coefficient (Worpitzky 1883; Comtet 1974, p. 242).

An anti-analytic function is a function f satisfying the condition (df)/(dz)=0. (1) Using the result ...

Let f(s) defined and analytic in a half-strip D={s:sigma_1<=R[s]<=sigma_2,I[s]>=t_0 0}. If |f|<=M on the boundary partialD of D and there is a constant A such that ...

A function which has infinitely many derivatives at a point. If a function is not polygenic, it is monogenic.

If a function f has a pole at z_0, then the negative power part sum_(j=-k)^(-1)a_j(z-z_0)^j (1) of the Laurent series of f about z_0 sum_(j=-k)^inftya_j(z-z_0)^j (2) is ...

A function is termed regular iff it is analytic and single-valued throughout a region R.

Although a numerically computed chaotic trajectory diverges exponentially from the true trajectory with the same initial coordinates, there exists an errorless trajectory ...