Search Results for ""

Consider the Fibonacci-like recurrence a_n=+/-a_(n-1)+/-a_(n-2), (1) where a_0=0, a_1=1, and each sign is chosen independently and at random with probability 1/2. ...

A polyomino is a generalization of the domino to a collection of n squares of equal size arranged with coincident sides. Polyominos were originally called "super-dominoes" by ...

Given a Poisson distribution with a rate of change lambda, the distribution function D(x) giving the waiting times until the hth Poisson event is D(x) = ...

A representation of a Lie algebra g is a linear transformation psi:g->M(V), where M(V) is the set of all linear transformations of a vector space V. In particular, if V=R^n, ...

A variable x is memoryless with respect to t if, for all s with t!=0, P(x>s+t|x>t)=P(x>s). (1) Equivalently, (P(x>s+t,x>t))/(P(x>t)) = P(x>s) (2) P(x>s+t) = P(x>s)P(x>t). (3) ...

The Nørlund polynomial (note that the spelling Nörlund also appears in various publications) is a name given by Carlitz (1960) and Adelberg (1997) to the polynomial ...

The representation, beloved of engineers and physicists, of a complex number in terms of a complex exponential x+iy=|z|e^(iphi), (1) where i (called j by engineers) is the ...

Riddell's formula for unlabeled graphs is the Euler transform relating the number of unlabeled connected graphs on n nodes satisfying some property with the corresponding ...

Let lambda_1, ..., lambda_n in C be linearly independent over the rationals Q, then Q(lambda_1,...,lambda_n,e^(lambda_1),...,e^(lambda_n)) has transcendence degree at least n ...

The sigmoid function, also called the sigmoidal curve (von Seggern 2007, p. 148) or logistic function, is the function y=1/(1+e^(-x)). (1) It has derivative (dy)/(dx) = ...