Search Results for ""

An alternating group is a group of even permutations on a set of length n, denoted A_n or Alt(n) (Scott 1987, p. 267). Alternating groups are therefore permutation groups. ...

A chain complex is a sequence of maps ...-->^(partial_(i+1))C_i-->^(partial_i)C_(i-1)-->^(partial_(i-1))..., (1) where the spaces C_i may be Abelian groups or modules. The ...

C_4 is one of the two groups of group order 4. Like C_2×C_2, it is Abelian, but unlike C_2×C_2, it is a cyclic. Examples include the point groups C_4 (note that the same ...

Every totally ordered set (A,<=) is associated with a so-called order type. Two sets A and B are said to have the same order type iff they are order isomorphic (Ciesielski ...

A rolling polyhedron graph is a graph obtained by rolling a polyhedral solid along a board whose tiles match up with the faces of the polyhedron being rolled. The vertices of ...

Just as many interesting integer sequences can be defined and their properties studied, it is often of interest to additionally determine which of their elements are prime. ...

In graph theory, a cycle graph C_n, sometimes simply known as an n-cycle (Pemmaraju and Skiena 2003, p. 248), is a graph on n nodes containing a single cycle through all ...

A theorem sometimes called "Euclid's first theorem" or Euclid's principle states that if p is a prime and p|ab, then p|a or p|b (where | means divides). A corollary is that ...

A semiprime, also called a 2-almost prime, biprime (Conway et al. 2008), or pq-number, is a composite number that is the product of two (possibly equal) primes. The first few ...

Baillie and Wagstaff (1980) and Pomerance et al. (1980, Pomerance 1984) proposed a test (or rather a related set of tests) based on a combination of strong pseudoprimes and ...