Search Results for ""

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

The first group isomorphism theorem, also known as the fundamental homomorphism theorem, states that if phi:G->H is a group homomorphism, then Ker(phi)⊴G and ...

The Fischer groups are the three sporadic groups Fi_(22), Fi_(23), and Fi_(24)^'. These groups were discovered during the investigation of 3-transposition groups. The Fischer ...

A folding function is a function that maps the integers Z={...,-3,-2,-1,0,1,2,3,...} onto the nonnegative integers Z^*={0,1,2,3,...}. This type of function arises naturally ...

A graph is a forbidden (vertex-)induced subgraph if its presence as a vertex-induced subgraph of a given graph means it is not a member of some family of graphs. For example, ...

A graph is a forbidden subgraph if its presence as a subgraph of a given graph means it is not a member of some family of graphs. For example, a bipartite graph is a graph ...

A graph is a forbidden topological minor (also known as a forbidden homeomorphic subgraph) if its presence as a homeomorphic subgraph of a given graph (i.e., there is an ...

The fourth group isomorphism theorem, also called the lattice group isomorphism theorem, lets G be a group and let N⊴G, where N⊴G indicates that N is a normal subgroup of G. ...

Let R be a ring, and let I be an ideal of R. The correspondence A<->A/I is an inclusion preserving bijection between the set of subrings A of R that contain I and the set of ...