Search Results for ""

The minimum vertex degree, sometimes simply called the minimum degree, of a graph G is the smallest vertex degree of G, denoted delta.

The Minkowski measure of a bounded, closed set is the same as its Lebesgue measure.

A version of nim-like games in which the player taking the last piece is the loser. For most impartial games, this form is much harder to analyze, but it requires only a ...

The statistical index P_M=(sump_nq_a)/(sump_0q_a), where p_n is the price per unit in period n and q_n is the quantity produced in period n.

A mixed graph in which both directed and undirected edges may exist. If only directed edges exist, the graph is called a directed graph. If only undirected edges exist, it is ...

A tensor having contravariant and covariant indices.

The set lambda of linear Möbius transformations w which satisfy w(t)=(at+b)/(ct+d), where a and d are odd and b and c are even. lambda is a subgroup of the modular group ...

The kernel of a module homomorphism f:M-->N is the set of all elements of M which are mapped to zero. It is the kernel of f as a homomorphism of additive groups, and is a ...

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

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