Search Results for ""

Suppose that E(G) (the commuting product of all components of G) is simple and G contains a semisimple group involution. Then there is some semisimple group involution x such ...

A sequence {x_n} is called an infinitive sequence if, for every i, x_n=i for infinitely many n. Write a(i,j) for the jth index n for which x_n=i. Then as i and j range ...

The group of functions from an object G to itself which preserve the structure of the object, denoted Aut(G). The automorphism group of a group preserves the multiplication ...

The average disorder number of a simple connected graph on n vertices is defined as the average length of a walk along the edges of the graph taken over all ordering of its ...

The baby monster group, also known as Fischer's baby monster group, is the second-largest sporadic group. It is denoted B and has group order |B| = ...

Ballantine's series is the series for pi given by pi=864sum_(n=0)^infty((n!)^24^n)/((2n+1)!325^(n+1)) +1824sum_(n=0)^infty((n!)^24^n)/((2n+1)!3250^(n+1))-20cot^(-1)239 ...

When working over a collection of fields, the base field is the intersection of the fields in the collection, i.e., the field contained in all other fields.

Baxter's four-coloring constant for a triangular lattice is given by C^2 = product_(j=1)^(infty)((3j-1)^2)/((3j-2)(3j)) (1) = 3/(4pi^2)Gamma^3(1/3) (2) = 1.46099848... (3) ...

The Bellman-Ford algorithm is an algorithm for solving the shortest path problem, i.e., finding a graph geodesic between two given vertices. Other algorithms that can be used ...

The free part of the homology group with a domain of coefficients in the group of integers (if this homology group is finitely generated).