Search Results for ""

An axiom proposed by Huntington (1933) as part of his definition of a Boolean algebra, H(x,y)=!(!x v y) v !(!x v !y)=x, (1) where !x denotes NOT and x v y denotes OR. Taken ...

The Narayan number N(n,k) for n=1, 2, ... and k=1, ..., n gives a solution to several counting problems in combinatorics. For example, N(n,k) gives the number of expressions ...

The Racah V-coefficients are written V(j_1j_2j;m_1m_2m) (1) and are sometimes expressed using the related Clebsch-Gordan coefficients C_(m_1m_2)^j=(j_1j_2m_1m_2|j_1j_2jm), ...

The rhombic enneacontahedron is the equilateral zonohedron constructed from the 10 diameters of the dodecahedron. This enneacontahedron somewhat resembles a figure of Sharp ...

Define the notation [n]f_0=f_(-(n-1)/2)+...+f_0+...+f_((n-1)/2) (1) and let delta be the central difference, so delta^2f_0=f_1-2f_0+f_(-1). (2) Spencer's 21-term moving ...

A recursive function devised by I. Takeuchi in 1978 (Knuth 1998). For integers x, y, and z, it is defined by (1) This can be described more simply by t(x,y,z)={y if x<=y; {z ...

An infinite sequence of positive integers 1<=b_1<b_2<b_3<..., (1) also called a Sidon sequence, such that all pairwise sums b_i+b_j (2) for i<=j are distinct (Guy 1994). An ...

The quantum electrodynamical law which applies to spin-1/2 particles and is the relativistic generalization of the Schrödinger equation. In 3+1 dimensions (three space ...

The term "Euler graph" is sometimes used to denote a graph for which all vertices are of even degree (e.g., Seshu and Reed 1961). Note that this definition is different from ...

Ore (1962) noted that not only does a tree possesses a unique shortest path between any two vertices, but that there also exist also other connected graphs having the same ...