TOPICS
Search

Search Results for ""


881 - 890 of 13135 for Combinatorial MathematicsSearch Results
The equation of incompressible fluid flow, (partialu)/(partialt)+u·del u=-(del P)/rho+nudel ^2u, where nu is the kinematic viscosity, u is the velocity of the fluid parcel, P ...
A nondeterministic Turing machine is a "parallel" Turing machine that can take many computational paths simultaneously, with the restriction that the parallel Turing machines ...
Perhaps the most commonly-studied oriented point lattice is the so-called north-east lattice which orients each edge of L in the direction of increasing coordinate-value. ...
The Norton-Smith graph is a weakly regular graph on 1134 vertices with regular parameters (nu,k,lambda,mu)=(1134,117,36,(0,12)). It is distance-regular as well as ...
A lattice L is said to be oriented if there exists a rule which assigns a specified direction to any edge connecting arbitrary lattice points x_i,x_j in L. In that way, an ...
The pentagonal dipyramid is one of the convex deltahedra, and Johnson solid J_(13). It is also the dual polyhedron of the pentagonal prism U_(76) and is an isohedron. It is ...
The graph complement of a perfect graph is itself perfect. Originally known as the weak perfect graph conjecture (Fulkerson 1971), the result was subsequently proved by ...
The perpendicular bisector of a line segment is the locus of all points that are equidistant from its endpoints. This theorem can be applied to determine the center of a ...
Almost all processes that are not obviously simple can be viewed as computations of equivalent sophistication (Wolfram 2002, pp. 5 and 716-717). More specifically, the ...
Proof theory, also called metamathematics, is the study of mathematics and mathematical reasoning (Hofstadter 1989) in a general and abstract sense itself. Instead of ...
1 ... 86|87|88|89|90|91|92 ... 1314 Previous Next

...