Search Results for ""

The usual number of scalar operations (i.e., the total number of additions and multiplications) required to perform n×n matrix multiplication is M(n)=2n^3-n^2 (1) (i.e., n^3 ...

Consider a Boolean algebra of subsets b(A) generated by a set A, which is the set of subsets of A that can be obtained by means of a finite number of the set operations ...

Cantellation, also known as (polyhedron) expansion (Stott 1910, not to be confused with general geometric expansion) is the process of radially displacing the edges or faces ...

A multiplication table is an array showing the result of applying a binary operator to elements of a given set S. For example, the following table is the multiplication table ...

An Abelian semigroup is a set whose elements are related by a binary operation (such as addition, rotation, etc.) that is closed, associative, and commutative. A mathematical ...

An abstract machine is a model of a computer system (considered either as hardware or software) constructed to allow a detailed and precise analysis of how the computer ...

An algebraic function is a function f(x) which satisfies p(x,f(x))=0, where p(x,y) is a polynomial in x and y with integer coefficients. Functions that can be constructed ...

The algebraic unknotting number of a knot K in S^3 is defined as the algebraic unknotting number of the S-equivalence class of a Seifert matrix of K. The algebraic unknotting ...

The set of all zero-systems of a group G is denoted B(G) and is called the block monoid of G since it forms a commutative monoid under the operation of zero-system addition ...

Given a group G, the algebra CG is a vector space CG={suma_ig_i|a_i in C,g_i in G} of finite sums of elements of G, with multiplication defined by g·h=gh, the group ...