Search Results for ""

Given a field F and an extension field K superset= F, if alpha in K is an algebraic element over F, the minimal polynomial of alpha over F is the unique monic irreducible ...

Fractran is an algorithm applied to a given list f_1, f_2, ..., f_k of fractions. Given a starting integer N, the FRACTRAN algorithm proceeds by repeatedly multiplying the ...

The finite group C_2×C_6 is the finite group of order 12 that is the group direct product of the cyclic group C2 and cyclic group C6. It is one of the two Abelian groups of ...

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

The maximum possible weight of a fractional clique of a graph G is called the fractional clique number of G, denoted omega^*(G) (Godsil and Royle 2001, pp. 136-137) or ...

Frucht's theorem states that every finite group is the automorphism group of a finite undirected graph. This was conjectured by König (1936) and proved by Frucht (1939). In ...

For a Galois extension field K of a field F, the fundamental theorem of Galois theory states that the subgroups of the Galois group G=Gal(K/F) correspond with the subfields ...

Consider Kimberling centers X_(20) (de Longchamps point Z; intersection L_S intersection L_E of the Soddy line and Euler line), X_(468) (intersection L_E intersection L_O of ...

Let p and q be partitions of a positive integer, then there exists a (0,1)-matrix A such that c(A)=p, r(A)=q iff q is dominated by p^*.