Search Results for ""

A general reciprocity theorem for all orders which covered all other known reciprocity theorems when proved by E. Artin in 1927. If R is a number field and R^' a finite ...

Let B={b_1,b_2,...} be an infinite Abelian semigroup with linear order b_1<b_2<... such that b_1 is the unit element and a<b implies ac<bc for a,b,c in B. Define a Möbius ...

Given a permutation {p_1,p_2,...,p_n} of {1,...,n}, the bumping algorithm constructs a standard Young tableau by inserting the p_i one by one into an already constructed ...

The Burnside problem originated with Burnside (1902), who wrote, "A still undecided point in the theory of discontinuous groups is whether the group order of a group may be ...

In a cochain complex of modules ...->C^(i-1)->^(d^(i-1))C^i->^(d^i)C^(i+1)->..., the module B^i of i-coboundaries is the image of d^(i-1). It is a submodule of C^i and is ...

In machine learning theory and artificial intelligence, a concept c over a domain X is a Boolean function c:X->{0,1}. A collection of concepts is called a concept class. In ...

The phrase "convergence in mean" is used in several branches of mathematics to refer to a number of different types of sequential convergence. In functional analysis, ...

Given n sets of variates denoted {X_1}, ..., {X_n} , the first-order covariance matrix is defined by V_(ij)=cov(x_i,x_j)=<(x_i-mu_i)(x_j-mu_j)>, where mu_i is the mean. ...

A labeled graph whose nodes are indexed by the generators of a Coxeter group having (P_i,P_j) as an graph edge labeled by M_(ij) whenever M_(ij)>2, where M_(ij) is an element ...

An equivalence class is defined as a subset of the form {x in X:xRa}, where a is an element of X and the notation "xRy" is used to mean that there is an equivalence relation ...