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 ...

A pseudograph is a non-simple graph in which both graph loops and multiple edges are permitted (Zwillinger 2003, p. 220).

An algebraic structure whose elements consist of selected homeomorphisms between open subsets of a space, with the composition of two transformations defined on the largest ...

A pseudoinverse is a matrix inverse-like object that may be defined for a complex matrix, even if it is not necessarily square. For any given complex matrix, it is possible ...

The case of the Weierstrass elliptic function with invariants g_2=-1 and g_3=0. The half-periods for this case are L(1+i)/4 and L(-1+i)/4, where L is the lemniscate constant ...

A distance g on a set that fulfils the same properties as a metric except relaxes the definition to allow the distance between two different points to be zero. An example of ...

A topology on a set X whose open sets are the unions of open balls B(X_0,r)={x in x|g(x_0,x)<r}, where g is a pseudometric on X, x_0 is any point of X, and r>0. There is a ...

Curry (1977, p. 5) uses the term pseudoparadox to describe an apparent paradox, such as the catalogue paradox, for which there is no underlying actual contradiction.

A pseudoperfect number, sometimes also called a semiperfect number (Benkoski 1972, Butske et al. 1999), is a positive integer such as 20=1+4+5+10 which is the sum of some (or ...

A pseudoprime is a composite number that passes a test or sequence of tests that fail for most composite numbers. Unfortunately, some authors drop the "composite" ...