Search Results for ""

Define a cell in R^1 as an open interval or a point. A cell in R^(k+1) then has one of two forms, {(x,y):x in C, and f(x)<y<g(x)} (1) or {(x,y):x in C, and y=f(x)}, (2) where ...

According to Euler's rotation theorem, any rotation may be described using three angles. If the rotations are written in terms of rotation matrices D, C, and B, then a ...

In response to a letter from Goldbach, Euler considered sums of the form s_h(m,n) = sum_(k=1)^(infty)(1+1/2+...+1/k)^m(k+1)^(-n) (1) = ...

The sum-of-factorial powers function is defined by sf^p(n)=sum_(k=1)^nk!^p. (1) For p=1, sf^1(n) = sum_(k=1)^(n)k! (2) = (-e+Ei(1)+pii+E_(n+2)(-1)Gamma(n+2))/e (3) = ...

The class of all regular sequences of particularly well-behaved functions equivalent to a given regular sequence. A distribution is sometimes also called a "generalized ...

The generalized Petersen graph GP(n,k), also denoted P(n,k) (Biggs 1993, p. 119; Pemmaraju and Skiena 2003, p. 215), for n>=3 and 1<=k<=|_(n-1)/2_| is a connected cubic graph ...

A Gray code is an encoding of numbers so that adjacent numbers have a single digit differing by 1. The term Gray code is often used to refer to a "reflected" code, or more ...

There are a number of point processes which are called Hawkes processes and while many of these notions are similar, some are rather different. There are also different ...

The straight line on which all points at infinity lie. The line at infinity is central line L_6 (Kimberling 1998, p. 150), and has trilinear equation aalpha+bbeta+cgamma=0, ...

The Mangoldt function is the function defined by Lambda(n)={lnp if n=p^k for p a prime; 0 otherwise, (1) sometimes also called the lambda function. exp(Lambda(n)) has the ...