Search Results for ""

A cross-handle is a topological structure which can be thought of as the object produced by puncturing a surface twice, attaching a zip around each puncture travelling in the ...

The cut elimination theorem, also called the "Hauptsatz" (Gentzen 1969), states that every sequent calculus derivation can be transformed into another derivation with the ...

The Dürer folium is a special case of the rose curve with n=1. It is therefore also an epitrochoid. It has polar equation r=asin(theta/2) (1) and can be written as a ...

A generalization of Turán's theorem to non-complete graphs.

The four parameters e_0, e_1, e_2, and e_3 describing a finite rotation about an arbitrary axis. The Euler parameters are defined by e_0 = cos(phi/2) (1) e = [e_1; e_2; e_3] ...

The exterior derivative of a function f is the one-form df=sum_(i)(partialf)/(partialx_i)dx_i (1) written in a coordinate chart (x_1,...,x_n). Thinking of a function as a ...

Let C=C^+ union C^- (where C^+ intersection C^-=emptyset) be the disjoint union of two finite components C^+ and C^-. Let alpha and beta be two involutions on C, each of ...

A generalization of the equation whose solution is desired in Fermat's last theorem x^n+y^n=z^n to x^n+y^n=cz^n for x, y, z, and c positive constants, with trivial solutions ...

There exists no known P algorithm for graph isomorphism testing, although the problem has also not been shown to be NP-complete. In fact, the problem of identifying ...

A cycle of a finite group G is a minimal set of elements {A^0,A^1,...,A^n} such that A^0=A^n=I, where I is the identity element. A diagram of a group showing every cycle in ...