Search Results for ""

Let X be a set of v>=3 elements together with a set B of 3-subset (triples) of X such that every 2-subset of X occurs in exactly one triple of B. Then B is called a Steiner ...

A tag system is set of rules that specifies a fixed number of elements (commonly denoted nu or beta) be removed from the beginning of a sequence and a set of elements to be ...

A quadratic map is a quadratic recurrence equation of the form x_(n+1)=a_2x_n^2+a_1x_n+a_0. (1) While some quadratic maps are solvable in closed form (for example, the three ...

Conditional logit regression assumes a model of the form p_j=(e^(beta^'x_j))/(sum_(j)e^(beta^'x_j)) for j=1, ..., k+1. In this model, a subject is presented with choice ...

Let phi:M->M be a C^1 diffeomorphism on a compact Riemannian manifold M. Then phi satisfies Axiom A if the nonwandering set Omega(phi) of phi is hyperbolic and the periodic ...

The number of ways of picking k unordered outcomes from n possibilities. Also known as the binomial coefficient or choice number and read "n choose k," _nC_k=(n; ...

The descending chain condition, commonly abbreviated "D.C.C.," is the dual notion of the ascending chain condition. The descending chain condition for a partially ordered set ...

The direct limit, also called a colimit, of a family of R-modules is the dual notion of an inverse limit and is characterized by the following mapping property. For a ...

The edge count of a graph g, commonly denoted M(g) or E(g) and sometimes also called the edge number, is the number of edges in g. In other words, it is the cardinality of ...

An extension field F subset= K is called finite if the dimension of K as a vector space over F (the so-called degree of K over F) is finite. A finite field extension is ...