Search Results for ""

A solvable group is a group having a normal series such that each normal factor is Abelian. The special case of a solvable finite group is a group whose composition indices ...

A schematic diagram used in logic theory to depict collections of sets and represent their relationships. The Venn diagrams on two and three sets are illustrated above. The ...

A connective in logic known as the "exclusive or," or exclusive disjunction. It yields true if exactly one (but not both) of two conditions is true. The XOR operation does ...

The Ramsey number R(m,n) gives the solution to the party problem, which asks the minimum number of guests R(m,n) that must be invited so that at least m will know each other ...

If F is an algebraic Galois extension field of K such that the Galois group of the extension is Abelian, then F is said to be an Abelian extension of K. For example, ...

A path constructed by repeatedly finding a path of positive capacity from a source to a sink and then adding it to the flow (Skiena 1990, p. 237). An augmenting path for a ...

The longstanding conjecture that the nonimaginary solutions E_n of zeta(1/2+iE_n)=0, (1) where zeta(z) is the Riemann zeta function, are the eigenvalues of an "appropriate" ...

A bilinear form on a real vector space is a function b:V×V->R that satisfies the following axioms for any scalar alpha and any choice of vectors v,w,v_1,v_2,w_1, and w_2. 1. ...

If n=1,2 (mod 4), and the squarefree part of n is divisible by a prime p=3 (mod 4), then no difference set of order n exists. Equivalently, if a projective plane of order n ...

The (weak) Bruhat graph B_n of order n is the simple graph having have all permutations of {1,2,...,n} as vertices, and with an edge between pairs of permutations that differ ...