Search Results for ""

A field which is complete with respect to a discrete valuation is called a local field if its field of residue classes is finite. The Hasse principle is one of the chief ...

A normalizer of a nontrivial Sylow p-subgroup of a group G.

The odd graph O_n of order n is a graph having vertices given by the (n-1)-subsets of {1,...,2n-1} such that two vertices are connected by an edge iff the associated subsets ...

Let alpha and beta be any ordinal numbers, then ordinal exponentiation is defined so that if beta=0 then alpha^beta=1. If beta is not a limit ordinal, then choose gamma such ...

The Paley graph of order q with q a prime power is a graph on q nodes with two nodes adjacent if their difference is a square in the finite field GF(q). This graph is ...

A fraction containing each of the digits 1 through 9 is called a pandigital fraction. The following table gives the number of pandigital fractions which represent simple unit ...

Given a ring R with identity, the special linear group SL_n(R) is the group of n×n matrices with elements in R and determinant 1. The special linear group SL_n(q), where q is ...

The Grötzsch graph is smallest triangle-free graph with chromatic number four. It is identical to the Mycielski graph of order four, and is implemented as ...

Let Y_n denote the graph with vertex set V(X_n), where X_n is the n-hypercube and two vertices are adjacent in Y_n iff they are at distance 1<=d<=2 in X_n. Y_n is not ...

The Hanoi graph H_n corresponding to the allowed moves in the tower of Hanoi problem. The above figure shows the Hanoi graphs for small n. The Hanoi graph H_n can be ...