Search Results for ""

Let A be an edge cut of a connected graph G. Then the cyclic edge connectivity lambda_c(G) is the size of a smallest cyclic edge cut, i.e., a smallest edge cut A such that ...

An algebraic surface which can be represented implicitly by a polynomial of degree 10 in x, y, and z. An example is the Barth decic.

A rewriting of a given quantity (e.g., a matrix) in terms of a combination of "simpler" quantities.

The study of definable sets and functions in polish spaces.

A divergenceless vector field, also called a solenoidal field, is a vector field for which del ·F=0. Therefore, there exists a G such that F=del xG. Furthermore, F can be ...

A dual number is a number x+epsilony, where x,y in R and epsilon is a matrix with the property that epsilon^2=0 (such as epsilon=[0 1; 0 0]).

Johnson solid J_(19).

An Euler pseudoprime to the base b is a composite number n which satisfies b^((n-1)/2)=+/-1 (mod n). The first few base-2 Euler pseudoprimes are 341, 561, 1105, 1729, 1905, ...

A graph vertex in a graph is said to be an even node if its vertex degree is even.

A statement which is rigorously not true. Regular two-valued logic allows statements to be only true or false, but fuzzy logic treats "truth" as a continuum which can have a ...