Search Results for ""

A sequence {a_n} such that either (1) a_(i+1)>=a_i for every i>=1, or (2) a_(i+1)<=a_i for every i>=1.

A term in social choice theory meaning a change favorable for X does not hurt X.

Monster-barring is a term coined by Lakatos (1976) to refer to the refining of a hypothesis to rule out nasty counterexamples (Bailey et al. 2007, p. 11).

The monster group is the highest order sporadic group M. It has group order |M| = (1) = (2) where the divisors are precisely the 15 supersingular primes (Ogg 1980). The ...

Pathological functions that are continuous but differentiable only on a set of points of measure zero are sometimes known as monsters of real analysis. Examples include the ...

In 1979, Conway and Norton discovered an unexpected intimate connection between the monster group M and the j-function. The Fourier expansion of j(tau) is given by (1) (OEIS ...

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 ...

Any method which solves a problem by generating suitable random numbers and observing that fraction of the numbers obeying some property or properties. The method is useful ...

Let f(z) be an analytic function of z, regular in the half-strip S defined by a<x<b and y>0. If f(z) is bounded in S and tends to a limit l as y->infty for a certain fixed ...

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 ...