Search Results for ""

A generalization of the Kronecker decomposition theorem which states that every finitely generated Abelian group is isomorphic to the group direct sum of a finite number of ...

The index of a permutation p is defined as the sum of all subscripts j such that p_j>p_(j+1), for 1<=j<=n. MacMahon (1960) proved that the number of permutations of size n ...

For any constructible function f, there exists a function P_f such that for all functions t, the following two statements are equivalent: 1. There exists an algorithm A such ...

A tree to whose nodes and/or edges labels (usually number) are assigned. The word "weight" also has a more specific meaning when applied to trees, namely the weight of a tree ...

A periodic continued fraction is a continued fraction (generally a regular continued fraction) whose terms eventually repeat from some point onwards. The minimal number of ...

Let A(n) denote the number of partitions of n into parts =2,5,11 (mod 12), let B(n) denote the number of partitions of n into distinct parts =2,4,5 (mod 6), and let C(n) ...

A vertex coloring is an assignment of labels or colors to each vertex of a graph such that no edge connects two identically colored vertices. The most common type of vertex ...

An encoding is a way of representing a number or expression in terms of another (usually simpler) one. However, multiple expressions can also be encoded as a single ...

The number of ways N(m,n) of finding a subrectangle with an m×n rectangle can be computed by counting the number of ways in which the upper right-hand corner can be selected ...

A formula for the permanent of a matrix perm(a_(ij))=(-1)^nsum_(s subset= {1,...,n})(-1)^(|s|)product_(i=1)^nsum_(j in s)a_(ij), where the sum is over all subsets of ...