Search Results for ""

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]}. ...

Let a number n be written in binary as n=(epsilon_kepsilon_(k-1)...epsilon_1epsilon_0)_2, (1) and define b_n=sum_(i=0)^(k-1)epsilon_iepsilon_(i+1) (2) as the number of digits ...

The Minkowski metric, also called the Minkowski tensor or pseudo-Riemannian metric, is a tensor eta_(alphabeta) whose elements are defined by the matrix (eta)_(alphabeta)=[-1 ...

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; ...

A quasi-qunitic graph is a quasi-regular graph, i.e., a graph such that degree of every vertex is the same delta except for a single vertex whose degree is Delta=delta+1 ...

The sequence a(n) given by the exponents of the highest power of 2 dividing n, i.e., the number of trailing 0s in the binary representation of n. For n=1, 2, ..., the first ...

An integer that is either 0 or positive, i.e., a member of the set Z^*={0} union Z^+, where Z-+ denotes the positive integers.

An integer that is either 0 or negative, i.e., a member of the set {0} union Z^-, where Z-- denotes the negative integers.

There exist infinitely many n>0 with p_n^2>p_(n-i)p_(n+i) for all i<n, where p_n is the nth prime. Also, there exist infinitely many n>0 such that 2p_n<p_(n-i)+p_(n+i) for ...

An encoding is a way of representing a number or expression in terms of another (usually simpler) one. However, multiple expressions can also be encoded as a single ...