Search Results for ""

A pseudoforest is an undirected graph in which every connected component contains at most one graph cycle. A pseudotree is therefore a connected pseudoforest and a forest ...

Let K subset= C be compact, let f be analytic on a neighborhood of K, and let P subset= C^*\K contain at least one point from each connected component of C^*\K. Then for any ...

The score function u(theta) is the partial derivativeof the log-likelihood function F(theta)=lnL(theta), where L(theta) is the standard likelihood function. Defining the ...

In floating-point arithmetic, the significand is a component of a finite floating-point number containing its significant digits. Generally speaking, the significand can be ...

A two-component complex column vector. Spinors can describe both bosons and fermions, while tensors can describe only bosons.

The equation of the curve of intersection of a torus with a plane perpendicular to both the midplane of the torus and to the plane x=0. (The general intersection of a torus ...

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 unitary perfect number is a number n which is the sum of its unitary divisors with the exception of n itself. There are no odd unitary perfect numbers, and it has been ...

A weakly connected digraph is a directed graph in which it is possible to reach any node starting from any other node by traversing edges in some direction (i.e., not ...

A white bishop graph is a graph formed from possible moves of a bishop chess piece, which may make diagonal moves of any length on a chessboard (or any other board), when ...