Search Results for ""

A (Delta,D)-graph is a graph with maximum vertex degree Delta and diameter at most D. The order of a graph with degree Delta of diameter D is bounded by ...

A deletable prime is a prime number which has the property that deleting digits one at a time in some order gives a prime at each step. For example, 410256793 is a deletable ...

The group D_5 is one of the two groups of order 10. Unlike the cyclic group C_(10), D_5 is non-Abelian. The molecule ruthenocene (C_5H_5)_2Ru belongs to the group D_(5h), ...

sum_(1<=k<=n)(n; k)((-1)^(k-1))/(k^m)=sum_(1<=i_1<=i_2<=...<=i_m<=n)1/(i_1i_2...i_m), (1) where (n; k) is a binomial coefficient (Dilcher 1995, Flajolet and Sedgewick 1995, ...

A Dyck path is a staircase walk from (0,0) to (n,n) that lies strictly below (but may touch) the diagonal y=x. The number of Dyck paths of order n is given by the Catalan ...

Elliptic rational functions R_n(xi,x) are a special class of rational functions that have nice properties for approximating other functions over the interval x in [-1,1]. In ...

The group C_2×C_2×C_2 is one of the three Abelian groups of order 8 (the other two groups are non-Abelian). An example is the modulo multiplication group M_(24) (which is the ...

C_2×C_4 is one of the three Abelian groups of group order 8 (the other two being non-Abelian). Examples include the modulo multiplication groups M_(15), M_(16), M_(20), and ...

A reduction system is called finitely terminating (or Noetherian) if there are no infinite rewriting sequences. This property guarantees that any rewriting algorithm will ...

The first group isomorphism theorem, also known as the fundamental homomorphism theorem, states that if phi:G->H is a group homomorphism, then Ker(phi)⊴G and ...