Search Results for ""

The cricket graph is the 5-vertex graph illustrated above. It is implemented in the Wolfram Language as GraphData["CricketGraph"].

A standard form of the linear programming problem of maximizing a linear function over a convex polyhedron is to maximize c·x subject to mx<=b and x>=0, where m is a given ...

A requirement necessary for a given statement or theorem to hold. Also called a condition.

Let F be the Maclaurin series of a meromorphic function f with a finite or infinite number of poles at points z_k, indexed so that 0<|z_1|<=|z_2|<=|z_3|<=..., then a pole ...

The line R[s]=1/2 in the complex plane on which the Riemann hypothesis asserts that all nontrivial (complex) Riemann zeta function zeros lie. The plot above shows the first ...

A nonplanar graph G is said to be critical nonplanar if the removal of a vertex results in a planar graph for every vertex of G. Critical nonplanar graphs differ from apex ...

Let x->y and u->v be two rules of a term rewriting system, and suppose these rules have no variables in common. If they do, rename the variables. If x_1 is a subterm of x (or ...

A function y=f(x) has critical points at all points x_0 where f^'(x_0)=0 or f(x) is not differentiable. A function z=f(x,y) has critical points where the gradient del f=0 or ...

The region 0<sigma<1, where sigma is defined as the real part of a complex number s=sigma+it. All nontrivial zeros (i.e., those not at negative even integers) of the Riemann ...

Critical damping is a special case of damped simple harmonic motion x^..+betax^.+omega_0^2x=0, (1) in which D=beta^2-4omega_0^2=0, (2) where beta is the damping constant. ...