Search Results for ""

An exponential generating function for the integer sequence a_0, a_1, ... is a function E(x) such that E(x) = sum_(k=0)^(infty)a_k(x^k)/(k!) (1) = ...

Let F be a field of field characteristic p. Then the Frobenius automorphism on F is the map phi:F->F which maps alpha to alpha^p for each element alpha of F.

The number of nodes in a graph is called its order.

Consider a one-dimensional Hamiltonian map of the form H(p,q)=1/2p^2+V(q), (1) which satisfies Hamilton's equations q^. = (partialH)/(partialp) (2) p^. = ...

An algebraic surface of degree eight. The maximum number of ordinary double points known to exist on an octic surface is 168 (the Endraß octics), although the rigorous upper ...

The orthocubic (or ortho cubic) Z(X_4) is a self-isogonal cubic with pivot point at the orthocenter H, so it has parameter x=cosBcosC and trilinear equation (Cundy and Parry ...

The number of outward directed graph edges from a given graph vertex in a directed graph.

A knot obtained from a tangle which can be represented by a finite sequence of integers.

sum_(n=0)^(infty)(-1)^n[((2n-1)!!)/((2n)!!)]^3 = 1-(1/2)^3+((1·3)/(2·4))^3+... (1) = _3F_2(1/2,1/2,1/2; 1,1;-1) (2) = [_2F_1(1/4,1/4; 1;-1)]^2 (3) = ...

Rényi entropy is defined as: H_alpha(p_1,p_2,...,p_n)=1/(1-alpha)ln(sum_(i=1)^np_i^alpha), where alpha>0, alpha!=1. As alpha->1, H_alpha(p_1,p_2,...,p_n) converges to ...