Search Results for ""

Aleph-1 is the set theory symbol aleph_1 for the smallest infinite set larger than aleph_0 (Aleph-0), which in turn is equal to the cardinal number of the set of countable ...

Call a projection of a link an almost alternating projection if one crossing change in the projection makes it an alternating projection. Then an almost alternating link is a ...

R. C. Read defined the anarboricity of a graph G as the maximum number of edge-disjoint nonacyclic (i.e., cyclic) subgraphs of G whose union is G (Harary and Palmer 1973, p. ...

A path constructed by repeatedly finding a path of positive capacity from a source to a sink and then adding it to the flow (Skiena 1990, p. 237). An augmenting path for a ...

A generalization of Fermat's last theorem which states that if a^x+b^y=c^z, where a, b, c, x, y, and z are any positive integers with x,y,z>2, then a, b, and c have a common ...

The set of all zero-systems of a group G is denoted B(G) and is called the block monoid of G since it forms a commutative monoid under the operation of zero-system addition ...

In the theory of transfinite ordinal numbers, 1. Every well ordered set has a unique ordinal number, 2. Every segment of ordinals (i.e., any set of ordinals arranged in ...

Let g:R->R be a function and let h>0, and define the cardinal series of g with respect to the interval h as the formal series sum_(k=-infty)^inftyg(kh)sinc((x-kh)/h), where ...

The product of a family {X_i}_(i in I) of objects of a category is an object P=product_(i in I)X_i, together with a family of morphisms {p_i:P->X_i}_(i in I) such that for ...

A circulant graph is a graph of n graph vertices in which the ith graph vertex is adjacent to the (i+j)th and (i-j)th graph vertices for each j in a list l. The circulant ...