Search Results for ""

Let f(x) be a real entire function of the form f(x)=sum_(k=0)^inftygamma_k(x^k)/(k!), (1) where the gamma_ks are positive and satisfy Turán's inequalities ...

Let G be a group, then there exists a piecewise linear knot K^(n-2) in S^n for n>=5 with G=pi_1(S^n-K) iff G satisfies 1. G is finitely presentable, 2. The Abelianization of ...

A formula which counts the number of fixed points for a topological transformation.

A generalization of the product rule for expressing arbitrary-order derivatives of products of functions, where (n; k) is a binomial coefficient. This can also be written ...

A coefficient of the Maclaurin series of 1/(ln(1+x))=1/x+1/2-1/(12)x+1/(24)x^2-(19)/(720)x^3+3/(160)x^4+... (OEIS A002206 and A002207), the multiplicative inverse of the ...

The correspondence which relates the Hanoi graph to the isomorphic graph of the odd binomial coefficients in Pascal's triangle, where the adjacencies are determined by ...

Let p be prime and r = r_mp^m+...+r_1p+r_0 (0<=r_i<p) (1) k = k_mp^m+...+k_1p+k_0 (0<=k_i<p), (2) then (r; k)=product_(i=0)^m(r_i; k_i) (mod p). (3) This is proved in Fine ...

subjMathematics:Discrete Mathematics:Graph Theory:Cliques The maximal clique polynomial C_G(x) for the graph G may be defined as the polynomial ...

The maximal independence polynomial I_G(x) for the graph G may be defined as the polynomial I_G(x)=sum_(k=i(G))^(alpha(G))s_kx^k, where i(G) is the lower independence number, ...

The maximal irredundance polynomial R_G(x) for the graph G may be defined as the polynomial R_G(x)=sum_(k=ir(G))^(IR(G))r_kx^k, where ir(G) is the (lower) irredundance ...