Search Results for ""

A theorem which plays a fundamental role in computer science because it is one of the main tools for showing that certain orderings on trees are well-founded. These orderings ...

Let (q_1,...,q_n,p_1,...,p_n) be any functions of two variables (u,v). Then the expression ...

A lattice graph, also known as a mesh graph or grid graph, is a graph possessing an embedding in a Euclidean space R^n that forms a regular tiling. Examples include grid ...

A Laurent polynomial with coefficients in the field F is an algebraic object that is typically expressed in the form ...+a_(-n)t^(-n)+a_(-(n-1))t^(-(n-1))+... ...

A "law of large numbers" is one of several theorems expressing the idea that as the number of trials of a random process increases, the percentage difference between the ...

With a large enough sample, any outrageous thing is likely to happen (Diaconis and Mosteller 1989). Littlewood (1986) considered an event which occurs one in a million times ...

The Lebesgue covering dimension is an important dimension and one of the first dimensions investigated. It is defined in terms of covering sets, and is therefore also called ...

Each double point assigned to an irreducible algebraic curve whose curve genus is nonnegative imposes exactly one condition.

Given a map f:S->T between sets S and T, the map g:T->S is called a left inverse to f provided that g degreesf=id_S, that is, composing f with g from the left gives the ...

Legendre's formula counts the number of positive integers less than or equal to a number x which are not divisible by any of the first a primes, (1) where |_x_| is the floor ...