Search Results for ""

The "mathematical paradigm" is a term that may be applied to the fundamental idea that events in the world can be described by mathematical equations, and that solutions to ...

Let A_n be the set of all sequences that contain all sequences {a_k}_(k=0)^n where a_0=1 and all other a_i=+/-1, and define c_k=sum_(j=0)^(n-k)a_ja_(j+k). Then the merit ...

Let G=(V,E) be a (not necessarily simple) undirected edge-weighted graph with nonnegative weights. A cut C of G is any nontrivial subset of V, and the weight of the cut is ...

A minimum edge cover is an edge cover having the smallest possible number of edges for a given graph. The size of a minimum edge cover of a graph is known as the edge cover ...

A class of automata similar to cellular automata but which have a single "active" cell instead of updating all cells in parallel. In a mobile automaton, the evolution rules ...

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

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

Montgomery's pair correlation conjecture, published in 1973, asserts that the two-point correlation function R_2(r) for the zeros of the Riemann zeta function zeta(z) on the ...

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

Let g(x_1,...,x_n,y) be a function such that for any x_1, ..., x_n, there is at least one y such that g(x_1,...,x_n,y)=0. Then the mu-operator muy(g(x_1,...,x_n,y)=0) gives ...