Search Results for ""

A variety V of algebras is a strong variety provided that for each subvariety W of V, and each algebra A in V, if A is generated by its W- subalgebras, then A in W. In strong ...

A strongly binary tree is a rooted tree for which the root is adjacent to either zero or two vertices, and all non-root vertices are adjacent to either one or three vertices ...

A strongly connected component of a simple directed graph (i.e., a digraph without loops) is a maximal subdigraph such that for every pair of distinct vertices u, v in the ...

A strongly connected digraph is a directed graph in which it is possible to reach any node starting from any other node by traversing edges in the direction(s) in which they ...

A graph is strongly perfect if every induced subgraph H has an independent vertex set meeting all maximal cliques of H (Berge and Duchet 1984, Ravindra 1999). Every strongly ...

Let L be a language of the first-order logic. Assume that the language L has the following sets of nonlogical symbols: 1. C is the set of constant symbols of L. (These are ...

The ordinary differential equation z^2y^('')+zy^'+(z^2-nu^2)y=(4(1/2z)^(nu+1))/(sqrt(pi)Gamma(nu+1/2)), where Gamma(z) is the gamma function (Abramowitz and Stegun 1972, p. ...

The probability density function for Student's z-distribution is given by f_n(z)=(Gamma(n/2))/(sqrt(pi)Gamma((n-1)/2))(1+z^2)^(-n/2). (1) Now define ...

A second-order ordinary differential equation d/(dx)[p(x)(dy)/(dx)]+[lambdaw(x)-q(x)]y=0, where lambda is a constant and w(x) is a known function called either the density or ...

A collection of subsets of a topological space that is contained in a basis of the topology and can be completed to a basis when adding all finite intersections of the ...