Search Results for ""

An agreement in which all parties feel as if they have received the best deal.

An endomorphism is called ergodic if it is true that T^(-1)A=A implies m(A)=0 or 1, where T^(-1)A={x in X:T(x) in A}. Examples of ergodic endomorphisms include the map X->2x ...

The group of rotations and translations.

A ring without zero divisors in which an integer norm and an associated division algorithm (i.e., a Euclidean algorithm) can be defined. For signed integers, the usual norm ...

Euler integration was defined by Schanuel and subsequently explored by Rota, Chen, and Klain. The Euler integral of a function f:R->R (assumed to be piecewise-constant with ...

A graph vertex in a graph is said to be an even node if its vertex degree is even.

A binary tree in which special nodes are added wherever a null subtree was present in the original tree so that each node in the original tree (except the root node) has ...

The degree (or relative degree, or index) of an extension field K/F, denoted [K:F], is the dimension of K as a vector space over F, i.e., [K:F]=dim_FK. If [K:F] is finite, ...

A game which is not biased toward any player. A game in which a given player can always win by playing correctly is therefore called an unfair game.

A group action phi:G×X->X is called faithful if there are no group elements g (except the identity element) such that gx=x for all x in X. Equivalently, the map phi induces ...