Search Results for ""

The orthogonal polynomials defined by c_n^((mu))(x) = _2F_0(-n,-x;;-mu^(-1)) (1) = ((-1)^n)/(mu^n)(x-n+1)_n_1F_1(-n;x-n+1;mu), (2) where (x)_n is the Pochhammer symbol ...

A reduction system is said to posses the Church-Rosser property if, for all x and y such that x<->_*y, there exists a z such that x->_*z and y->_*z. A reduction system is ...

A perimeter-bisecting segment of a polygon originating from the midpoint of one side. Each cleaver M_1C_1, M_2C_2, and M_3C_3 in a triangle DeltaA_1A_2A_3 is parallel to an ...

The simple first-order difference equation y_(t+1)-Ay_t=B, (1) where A = -(m_s)/(m_d) (2) B = (b_d-b_s)/(m_d) (3) and D_t = -m_dp_t+b_d (4) S_(t+1) = m_sp_t+b_s (5) are the ...

Codimension is a term used in a number of algebraic and geometric contexts to indicate the difference between the dimension of certain objects and the dimension of a smaller ...

A tool with two arms joined at their ends which can be used to draw circles. In geometric constructions, the classical Greek rules stipulate that the compass cannot be used ...

If the four points making up a quadrilateral are joined pairwise by six distinct lines, a figure known as a complete quadrangle results. A complete quadrangle is therefore a ...

Every finite group G of order greater than one possesses a finite series of subgroups, called a composition series, such that I<|H_s<|...<|H_2<|H_1<|G, where H_(i+1) is a ...

Computation time (also called "running time") is the length of time required to perform a computational process. Representation a computation as a sequence of rule ...

In voting theory, a Condorcet candidate is a candidate who always wins in a 2-person election but loses in larger election. For example, consider the 6-tuples of 6-sided die ...