Search Results for ""

A sequence of functions {f_n}, n=1, 2, 3, ... is said to be uniformly convergent to f for a set E of values of x if, for each epsilon>0, an integer N can be found such that ...

Universal algebra studies common properties of all algebraic structures, including groups, rings, fields, lattices, etc. A universal algebra is a pair A=(A,(f_i^A)_(i in I)), ...

A Lie algebra is a vector space g with a Lie bracket [X,Y], satisfying the Jacobi identity. Hence any element X gives a linear transformation given by ad(X)(Y)=[X,Y], (1) ...

Each Cartan matrix determines a unique semisimple complex Lie algebra via the Chevalley-Serre, sometimes called simply the "Serre relations." That is, if (A_(ij)) is a k×k ...

One of the set of symbols C_i, C_s, C_1, C_2, C_3, C_4, C_5, C_6, C_7, C_8, C_(2h), C_(3h), C_(4h), C_(5h), C_(6h), C_(2v), C_(3v), C_(4v), C_(5v), C_(6v), C_(inftyv), D_2, ...

A Gröbner basis G for a system of polynomials A is an equivalence system that possesses useful properties, for example, that another polynomial f is a combination of those in ...

A cycle of a graph G, also called a circuit if the first vertex is not specified, is a subset of the edge set of G that forms a path such that the first node of the path ...

Bouwer graphs, a term coined here for the first time, are a family of regular graphs which includes members that are symmetric but not arc-transitive. Such graphs are termed ...

Let G=(V,E) be a finite graph, let Omega be the set Omega={0,1}^E whose members are vectors omega=(omega(e):e in E), and let F be the sigma-algebra of all subsets of Omega. A ...

A pair of vertices (x,y) of a graph G is called an omega-critical pair if omega(G+xy)>omega(G), where G+xy denotes the graph obtained by adding the edge xy to G and omega(H) ...