Search Results for ""

The branch of mathematics which does not involve infinite sets, limits, or continuity.

The finite group T is one of the three non-Abelian groups of order 12 (out of a total of fives groups of order 12), the other two being the alternating group A_4 and the ...

A game in which each player has a finite number of moves and a finite number of choices at each move.

An entire function f is said to be of finite order if there exist numbers a,r>0 such that |f(z)|<=exp(|z|^a) for all |z|>r. The infimum of all numbers a for which this ...

A graph with a finite number of nodes and edges. If it has n nodes and has no multiple edges or graph loops (i.e., it is simple), it is a subgraph of the complete graph K_n. ...

A set function mu is finitely additive if, given any finite disjoint collection of sets {E_k}_(k=1)^n on which mu is defined, mu( union _(k=1)^nE_k)=sum_(k=1)^nmu(E_k).

A set function mu is said to possess finite subadditivity if, given any finite disjoint collection of sets {E_k}_(k=1)^n on which mu is defined, mu( union ...

Let X be a set and S a collection of subsets of X. A set function mu:S->[0,infty] is said to possess finite monotonicity provided that, whenever a set E in S is covered by a ...

A finite group is a group having finite group order. Examples of finite groups are the modulo multiplication groups, point groups, cyclic groups, dihedral groups, symmetric ...

Regge calculus is a finite element method utilized in numerical relativity in attempts of describing spacetimes with few or no symmetries by way of producing numerical ...