Search Results for ""

An embedding is a representation of a topological object, manifold, graph, field, etc. in a certain space in such a way that its connectivity or algebraic properties are ...

Let a closed surface have genus g. Then the polyhedral formula generalizes to the Poincaré formula chi(g)=V-E+F, (1) where chi(g)=2-2g (2) is the Euler characteristic, ...

The term "Euler graph" is sometimes used to denote a graph for which all vertices are of even degree (e.g., Seshu and Reed 1961). Note that this definition is different from ...

A dissection of a rectangle into smaller rectangles such that the original rectangle is not divided into two subrectangles. Rectangle dissections into 3, 4, or 6 pieces ...

A method for solving an equation by approximating continuous quantities as a set of quantities at discrete points, often regularly spaced into a so-called grid or mesh. ...

In the most commonly used convention (e.g., Apostol 1967, pp. 202-204), the first fundamental theorem of calculus, also termed "the fundamental theorem, part I" (e.g., Sisson ...

The Golay code is a perfect linear error-correcting code. There are two essentially distinct versions of the Golay code: a binary version and a ternary version. The binary ...

A partition {a_1,...,a_n} is called graphical if there exists a graph G having degree sequence {a_1,...,a_n}. The number of graphical partitions of length n is equal to the ...

A group G is said to act on a set X when there is a map phi:G×X->X such that the following conditions hold for all elements x in X. 1. phi(e,x)=x where e is the identity ...

The term "indeterminate" is sometimes used as a synonym for unknown or variable (Becker and Weispfenning 1993, p. 188). A mathematical expression can also be said to be ...