Search Results for ""

A labeled graph G=(V,E) is a finite series of graph vertices V with a set of graph edges E of 2-subsets of V. Given a graph vertex set V_n={1,2,...,n}, the number of ...

Landau's problems are the four "unattackable" problems mentioned by Landau in the 1912 Fifth Congress of Mathematicians in Cambridge, namely: 1. The Goldbach conjecture, 2. ...

A 4-state two-dimensional Turing machine invented in the 1980s. The ant starts out on a grid containing black and white cells, and then follows the following set of rules. 1. ...

A k×n Latin rectangle is a k×n matrix with elements a_(ij) in {1,2,...,n} such that entries in each row and column are distinct. If k=n, the special case of a Latin square ...

A linear recurrence equation is a recurrence equation on a sequence of numbers {x_n} expressing x_n as a first-degree polynomial in x_k with k<n. For example ...

The function lambda(n)=(-1)^(Omega(n)), (1) where Omega(n) is the number of not necessarily distinct prime factors of n, with Omega(1)=0. The values of lambda(n) for n=1, 2, ...

Liouville's constant, sometimes also called Liouville's number, is the real number defined by L=sum_(n=1)^infty10^(-n!)=0.110001000000000000000001... (OEIS A012245). ...

Lorentzian n-space is the inner product space consisting of the vector space R^n together with the n-dimensional Lorentzian inner product. In the event that the (1,n-1) ...

Macdonald's constant term conjectures are related to root systems of Lie algebras (Macdonald 1982, Andrews 1986). They can be regarded as generalizations of Dyson's ...

A function that arises in performance analysis of partially coherent, differentially coherent, and noncoherent communications. The generalized Marcum Q-function is defined by ...