Search Results for ""

Let G be a finite, connected, undirected graph with graph diameter d(G) and graph distance d(u,v) between vertices u and v. A radio labeling of a graph G is labeling using ...

There are a couple of versions of this theorem. Basically, it says that any bounded linear functional T on the space of compactly supported continuous functions on X is the ...

A sequential substitution system is a substitution system in which a string is scanned from left to right for the first occurrence of the first rule pattern. If the pattern ...

A smooth structure on a topological manifold (also called a differentiable structure) is given by a smooth atlas of coordinate charts, i.e., the transition functions between ...

A split graph is a graph whose vertices can be partitioned into a clique and an independent vertex set. Equivalently, it is a chordal graph whose graph complement is also ...

Stochastic is synonymous with "random." The word is of Greek origin and means "pertaining to chance" (Parzen 1962, p. 7). It is used to indicate that a particular subject is ...

Voronin (1975) proved the remarkable analytical property of the Riemann zeta function zeta(s) that, roughly speaking, any nonvanishing analytic function can be approximated ...

The first of the Hardy-Littlewood conjectures. The k-tuple conjecture states that the asymptotic number of prime constellations can be computed explicitly. In particular, ...

An alternating knot is a knot which possesses a knot diagram in which crossings alternate between under- and overpasses. Not all knot diagrams of alternating knots need be ...

The conjugate gradient method is not suitable for nonsymmetric systems because the residual vectors cannot be made orthogonal with short recurrences, as proved in Voevodin ...