Search Results for ""

Given a random variable x and a probability density function P(x), if there exists an h>0 such that M(t)=<e^(tx)> (1) for |t|<h, where <y> denotes the expectation value of y, ...

The six planes through the midpoints of the edges of a tetrahedron and perpendicular to the opposite edges concur in a point known as the Monge point.

A Mongolian tent graph is defined as the graph obtained from the grid graph P_m square P_n for odd n by adding an extra vertex above the graph and joining every other vertex ...

In order to integrate a function over a complicated domain D, Monte Carlo integration picks random points over some simple domain D^' which is a superset of D, checks whether ...

The Montgomery-Odlyzko law (which is a law in the sense of empirical observation instead of through mathematical proof) states that the distribution of the spacing between ...

For elliptic curves over the rationals Q, the group of rational points is always finitely generated (i.e., there always exists a finite set of group generators). This theorem ...

The Morgan-Voyce polynomials are polynomials related to the Brahmagupta and Fibonacci polynomials. They are defined by the recurrence relations b_n(x) = ...

The Moscow-Soicher graph is a weakly regular graph on 672 vertices with parameters (nu,k,lambda,mu)=(672,110,28,(0,18)). It is distance-regular but not distance-transitive ...

An optical illusion in which the orientation of arrowheads makes one line segment look longer than another. In the above figure, the line segments on the left and right are ...

A problem which is both NP (verifiable in nondeterministic polynomial time) and NP-hard (any NP-problem can be translated into this problem). Examples of NP-hard problems ...