Search Results for ""

Let C be an error-correcting code consisting of N codewords in which each codeword consists of n letters taken from an alphabet A of length q, and every two distinct ...

A nonzero vector v=(v_0,v_1,...,v_(n-1)) in n-dimensional Lorentzian space R^(1,n-1) is said to be negative lightlike if it has zero (Lorentzian) norm and if its first ...

A nonzero vector v=(v_0,v_1,...,v_(n-1)) in n-dimensional Lorentzian space R^(1,n-1) is said to be negative timelike if it has imaginary (Lorentzian) norm and if its first ...

The neighborhood complex N(G) of a locally finite graph G is defined as the abstract simplicial complex formed by the subsets of the neighborhoods of all vertices of G.

Let H be a complex Hilbert space, and define a nest as a set N of closed subspaces of H satisfying the conditions: 1. 0,H in N, 2. If N_1,N_2 in N, then either N_1 subset= ...

Beautiful patterns can be created by drawing sets of nested polygons such that the incircle of the nth polygon is the circumcircle of the (n+1)st and successive polygons are ...

The probability that two elements P_1 and P_2 of a symmetric group generate the entire group tends to 3/4 as n->infty (Netto 1964, p. 90). The conjecture was proven by Dixon ...

Polynomials O_n(x) that can be defined by the sum O_n(x)=1/4sum_(k=0)^(|_n/2_|)(n(n-k-1)!)/(k!)(1/2x)^(2k-n-1) (1) for n>=1, where |_x_| is the floor function. They obey the ...

A geometric construction, also called a verging construction, which allows the classical geometric construction rules to be bent in order to permit sliding of a marked ruler. ...

The functions theta_s(u) = (H(u))/(H^'(0)) (1) theta_d(u) = (Theta(u+K))/(Theta(k)) (2) theta_c(u) = (H(u))/(H(K)) (3) theta_n(u) = (Theta(u))/(Theta(0)), (4) where H(u) and ...