Search Results for ""

The operator representing the computation of a derivative, D^~=d/(dx), (1) sometimes also called the Newton-Leibniz operator. The second derivative is then denoted D^~^2, the ...

Consider the process of taking a number, taking its digit sum, then adding the digits of numbers derived from it, etc., until the remaining number has only one digit. The ...

To generate random points over the unit disk, it is incorrect to use two uniformly distributed variables r in [0,1] and theta in [0,2pi) and then take x = rcostheta (1) y = ...

A labeling phi of (the vertices) of a graph G with positive integers taken from the set {1,2,...,r} is said to be r-distinguishing if no graph automorphism of G preserves all ...

The Dou circle is the circle cutting the sidelines of the reference triangle DeltaABC at A^', A^(''), B^', B^(''), C^', and C^('') such that ...

Let C be a smooth geometrically connected projective curve over F_q with q=p^s a prime power. Let infty be a fixed closed point of X but not necessarily F_q-rational. A ...

A dyadic, also known as a vector direct product, is a linear polynomial of dyads AB+CD+... consisting of nine components A_(ij) which transform as (A_(ij))^' = ...

An edge cover is a subset of edges defined similarly to the vertex cover (Skiena 1990, p. 219), namely a collection of graph edges such that the union of edge endpoints ...

The size of a minimum edge cover in a graph G is known as the edge cover number of G, denoted rho(G). If a graph G has no isolated points, then nu(G)+rho(G)=|G|, where nu(G) ...

Elliptic rational functions R_n(xi,x) are a special class of rational functions that have nice properties for approximating other functions over the interval x in [-1,1]. In ...