Search Results for ""

The index of a vector field with finitely many zeros on a compact, oriented manifold is the same as the Euler characteristic of the manifold.

A formula relating the number of polyhedron vertices V, faces F, and polyhedron edges E of a simply connected (i.e., genus 0) polyhedron (or polygon). It was discovered ...

Given a geodesic triangle (a triangle formed by the arcs of three geodesics on a smooth surface), int_(ABC)Kda=A+B+C-pi. Given the Euler characteristic chi, intintKda=2pichi, ...

An odd alternating permutation number, more commonly called an Euler number or secant number.

A topologically invariant property of a surface defined as the largest number of nonintersecting simple closed curves that can be drawn on the surface without separating it. ...

An Eulerian path, also called an Euler chain, Euler trail, Euler walk, or "Eulerian" version of any of these variants, is a walk on the graph edges of a graph which uses each ...

If f(x) is positive and decreases to 0, then an Euler constant gamma_f=lim_(n->infty)[sum_(k=1)^nf(k)-int_1^nf(x)dx] can be defined. For example, if f(x)=1/x, then ...

The recurrence relation E_n=E_2E_(n-1)+E_3E_(n-2)+...+E_(n-1)E_2 which gives the solution to Euler's polygon division problem.

The intersection Ev of the Gergonne line and the Euler line. It has triangle center function alpha=(b(a-b+c)cosB+c(a+b-c)cosC-2a^2cosA)/(2a) and is Kimberling center X_(1375).

Given a map with genus g>0, Heawood showed in 1890 that the maximum number N_u of colors necessary to color a map (the chromatic number) on an unbounded surface is N_u = ...