Search Results for ""

A generalized Vandermonde matrix of two sequences a and b where a is an increasing sequence of positive integers and b is an increasing sequence of nonnegative integers of ...

A generating function f(x) is a formal power series f(x)=sum_(n=0)^inftya_nx^n (1) whose coefficients give the sequence {a_0,a_1,...}. The Wolfram Language command ...

In population studies, the direct offspring of a reference population (roughly) constitutes a single generation. For a cellular automaton, the fundamental unit of time during ...

Given a linear code C, a generator matrix G of C is a matrix whose rows generate all the elements of C, i.e., if G=(g_1 g_2 ... g_k)^(T), then every codeword w of C can be ...

For a form Q, the generic character chi_i(Q) of Q is defined as the values of chi_i(m) where (m,2d)=1 and Q represents m: chi_1(Q), chi_2(Q), ..., chi_r(Q) (Cohn 1980, p. ...

A cylindrical algebraic decomposition that omits sets of measure zero. Generic cylindrical algebraic decompositions are generally much quicker to compute than are normal ...

A d-dimensional framework is a pair (G,p) where G=(V,E) is a graph with vertex set V and edge set E and p:V->R^d is a map that assigns a point in R^d to each vertex of G. The ...

The genesa is a mystical figure that correspond to a spherical cuboctahedron.

A genetic algorithm is a class of adaptive stochastic optimization algorithms involving search and optimization. Genetic algorithms were first used by Holland (1975). The ...

A number given by the generating function (2t)/(e^t+1)=sum_(n=1)^inftyG_n(t^n)/(n!). (1) It satisfies G_1=1, G_3=G_5=G_7=...=0, and even coefficients are given by G_(2n) = ...