Search Results for ""

The permanent is an analog of a determinant where all the signs in the expansion by minors are taken as positive. The permanent of a matrix A is the coefficient of x_1...x_n ...

The digraph intersection of two digraphs is the digraph whose vertex set (respectively, edge set) is the intersection of their vertex sets (respectively, edge sets). If n is ...

Let E be a linear space over a field K. Then the vector space tensor product tensor _(lambda=1)^(k)E is called a tensor space of degree k. More specifically, a tensor space ...

Let p_n be the nth prime, then the primorial (which is the analog of the usual factorial for prime numbers) is defined by p_n#=product_(k=1)^np_k. (1) The values of p_n# for ...

A polynomial given by Phi_n(x)=product_(k=1)^n^'(x-zeta_k), (1) where zeta_k are the roots of unity in C given by zeta_k=e^(2piik/n) (2) and k runs over integers relatively ...

Let gamma(G) denote the domination number of a simple graph G. Then Vizing (1963) conjectured that gamma(G)gamma(H)<=gamma(G×H), where G×H is the graph product. While the ...

The area element for a surface with first fundamental form ds^2=Edu^2+2Fdudv+Gdv^2 is dA=sqrt(EG-F^2)du ^ dv, where du ^ dv is the wedge product.

Given a module M over a unit ring R, the set End_R(M) of its module endomorphisms is a ring with respect to the addition of maps, (f+g)(x)=f(x)+g(x), for all x in M, and the ...

A formula for the number of Young tableaux associated with a given Ferrers diagram. In each box, write the sum of one plus the number of boxes horizontally to the right and ...

The Krohn-Rhodes complexity, also called the group complexity or simply "the complexity," of a finite semigroup S is the smallest number of groups in a wreath product of ...