Search Results for ""

A diagram lemma which states that every short exact sequence of chain complexes and chain homomorphisms 0-->C-->^phiD-->^psiE-->0 gives rise to a long exact sequence in ...

If ABB^' and AC^'C are straight lines with BC and B^'C^' intersecting at D and AB+BD=AC^'+C^'D, then AB^'+B^'D=AC+CD. The origin and some history of this theorem are ...

If k|n, then the complete k-uniform hypergraph on n vertices decomposes into 1-factors, where a 1-factor is a set of n/k pairwise disjoint k-sets. Brouwer and Schrijver ...

A braid with M strands and R components with P positive crossings and N negative crossings satisfies |P-N|<=2U+M-R<=P+N, where U is the unknotting number. While the second ...

Given a compact manifold M and a transversely orientable codimension-one foliation F on M which is tangent to partialM, the pair (M,F) is called a generalized Reeb component ...

Let there be three polynomials a(x), b(x), and c(x) with no common factors such that a(x)+b(x)=c(x). Then the number of distinct roots of the three polynomials is one or more ...

Fermat's last theorem is a theorem first proposed by Fermat in the form of a note scribbled in the margin of his copy of the ancient Greek text Arithmetica by Diophantus. The ...

The proof theories of propositional calculus and first-order logic are often referred to as classical logic. Intuitionistic propositional logic can be described as classical ...

The Kittell graph is a planar graph on 23 nodes and 63 edges that tangles the Kempe chains in Kempe's algorithm and thus provides an example of how Kempe's supposed proof of ...

The nearest integer function, also called nint or the round function, is defined such that nint(x) is the integer closest to x. While the notation |_x] is sometimes used to ...