Search Results for ""

Let P be the principal (initial investment), r be the annual compounded rate, i^((n)) the "nominal rate," n be the number of times interest is compounded per year (i.e., the ...

Computation time (also called "running time") is the length of time required to perform a computational process. Representation a computation as a sequence of rule ...

Let a knot K be parameterized by a vector function v(t) with t in S^1, and let w be a fixed unit vector in R^3. Count the number of local minima of the projection function ...

The edge count of a graph g, commonly denoted M(g) or E(g) and sometimes also called the edge number, is the number of edges in g. In other words, it is the cardinality of ...

An even permutation is a permutation obtainable from an even number of two-element swaps, i.e., a permutation with permutation symbol equal to +1. For initial set {1,2,3,4}, ...

The kth power of a graph G is a graph with the same set of vertices as G and an edge between two vertices iff there is a path of length at most k between them (Skiena 1990, ...

Let n be an integer such that n>=lambda_1, where lambda=(lambda_1,lambda_2,...) is a partition of n=|lambda| if lambda_1>=lambda_2>=...>=0, where lambda_i are a sequence of ...

A tree with a finite number of branches at each fork and with a finite number of leaves at the end of each branch is called a finitely branching tree. König's lemma states ...

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 ...