Search Results for ""

A group theoretic operation which is useful in the study of complex atomic spectra. A plethysm takes a set of functions of a given symmetry type {mu} and forms from them ...

A wide variety of large numbers crop up in mathematics. Some are contrived, but some actually arise in proofs. Often, it is possible to prove existence theorems by deriving ...

Let A be a commutative ring and let C_r be an R-module for r=0,1,2,.... A chain complex C__ of the form C__:...|->C_n|->C_(n-1)|->C_(n-2)|->...|->C_2|->C_1|->C_0 is said to ...

An automorphism is an isomorphism of a system of objects onto itself. The term derives from the Greek prefix alphaupsilontauomicron (auto) "self" and ...

A labeling phi of (the vertices) of a graph G with positive integers taken from the set {1,2,...,r} is said to be r-distinguishing if no graph automorphism of G preserves all ...

The Patterson graph is the graph whose vertices are the 22880 centers of the Sylow 3-groups of the Suzuki group and in which two vertices are adjacent whenever they generate ...

For a permutation alpha in the symmetric group S_p, the alpha-permutation graph of a labeled graph G is the graph union of two disjoint copies of G (say, G_1 and G_2), ...

A module having only one element: the singleton set {*}. It is a module over any ring R with respect to the multiplication defined by a*=* (1) for every a in R, and the ...

The orthogonal decomposition of a vector y in R^n is the sum of a vector in a subspace W of R^n and a vector in the orthogonal complement W^_|_ to W. The orthogonal ...

A semialgebraic set is a subset of R^n which is a finite Boolean combination of sets of the form {x^_=(x_1,...,x_n):f(x^_)>0} and {x^_:g(x^_)=0}, where f and g are ...