Search Results for ""

Let (A,<=) and (B,<=) be totally ordered sets. Let C=A×B be the Cartesian product and define order as follows. For any a_1,a_2 in A and b_1,b_2 in B, 1. If a_1<a_2, then ...

Let (A,<=) and (B,<=) be well ordered sets with ordinal numbers alpha and beta. Then alpha<beta iff A is order isomorphic to an initial segment of B (Dauben 1990, p. 199). ...

The abundance of a number n, sometimes also called the abundancy (a term which in this work, is reserved for a different but related quantity), is the quantity ...

An atlas is a collection of consistent coordinate charts on a manifold, where "consistent" most commonly means that the transition functions of the charts are smooth. As the ...

A category consists of three things: a collection of objects, for each pair of objects a collection of morphisms (sometimes call "arrows") from one to another, and a binary ...

Determining the maximum number of pieces in which it is possible to divide a circle for a given number of cuts is called the circle cutting or pancake cutting problem. The ...

The complementary Bell numbers, also called the Uppuluri-Carpenter numbers, B^~_n=sum_(k=0)^n(-1)^kS(n,k) (1) where S(n,k) is a Stirling number of the second kind, are ...

A (p,q)-graph is edge-graceful if the edges can be labeled 1 through q in such a way that the labels induced on the vertices by summing over incident edges modulo p are ...

An optical illusion named after British psychologist James Fraser, who first studied the illusion in 1908 (Fraser 1908). The illusion is also known as the false spiral, or by ...

Guy's conjecture, which has not yet been proven or disproven, states that the graph crossing number for a complete graph K_n is ...