Search Results for ""
81 - 90 of 788 for Euler brickSearch Results
Zarankiewicz's conjecture asserts that graph crossing number for a complete bipartite graph K_(m,n) is Z(m,n)=|_n/2_||_(n-1)/2_||_m/2_||_(m-1)/2_|, (1) where |_x_| is the ...
An odd alternating permutation number, more commonly called an Euler number or secant number.
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 polyhedral formula generalized to a surface of genus g, V-E+F=chi(g) where V is the number of polyhedron vertices, E is the number of polyhedron edges, F is the number of ...
A compact manifold admits a Lorentzian structure iff its Euler characteristic vanishes. Therefore, every noncompact manifold admits a Lorentzian structure.
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).
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.
The following three pieces of information completely determine the homeomorphic type of a surface (Massey 1996): 1. Orientability, 2. Number of boundary components, 3. Euler ...
...
View search results from all Wolfram sites (3076 matches)

