Search Results for ""

The Fibonacci cube graph of order n is a graph on F_(n+2) vertices, where F_n is a Fibonacci number, labeled by the Zeckendorf representations of the numbers 0 to F_(n+2)-1 ...

Stirling's approximation gives an approximate value for the factorial function n! or the gamma function Gamma(n) for n>>1. The approximation can most simply be derived for n ...

There are several different definitions of the term "unital" used throughout various branches of mathematics. In geometric combinatorics, a block design of the form (q^3+1, ...

The involute of the astroid is a hypocycloid involute for n=4. Surprisingly, it is another astroid scaled by a factor (n-2)/n=2/4=1/2 and rotated 1/(2·4)=1/8 of a turn. For ...

If the cross ratio kappa of {AB,CD} satisfy kappa^2-kappa+1=0, (1) then the points are said to form a bivalent range, and {AB,CD}={AC,DB}={AD,BC}=kappa (2) ...

A point in a weighted tree that has minimum weight for the tree. The set of all centroid points is called a tree centroid (Harary 1994, p. 36). The largest possible values ...

Given a point set P={x_n}_(n=0)^(N-1) in the s-dimensional unit cube [0,1)^s, the star discrepancy is defined as D_N^*(P)=sup_(J in Upsilon^*)D(J,P), (1) where the local ...

If, for n and d integers, the ratio n/d is itself an integer, then d is said to divide n. This relationship is written d|n, read "d divides n." In this case, n is also said ...

The forward and inverse Kontorovich-Lebedev transforms are defined by K_(ix)[f(t)] = int_0^inftyK_(ix)(t)f(t)dt (1) K_(ix)^(-1)[g(t)] = ...

A null function delta^0(x) satisfies int_a^bdelta^0(x)dx=0 (1) for all a,b, so int_(-infty)^infty|delta^0(x)|dx=0. (2) Like a delta function, they satisfy delta^0(x)={0 x!=0; ...