Search Results for ""

An additive function is an arithmetic function such that whenever positive integers a and b are relatively prime, f(ab)=f(a)+f(b). An example of an additive function is ...

A polynomial function is a function whose values can be expressed in terms of a defining polynomial. A polynomial function of maximum degree 0 is said to be a constant ...

By analogy with the sinc function, define the sinhc function by sinhc(z)={(sinhz)/z for z!=0; 1 for z=0. (1) Since sinhx/x is not a cardinal function, the "analogy" with the ...

A function f(m) is called multiplicative if (m,m^')=1 (i.e., the statement that m and m^' are relatively prime) implies f(mm^')=f(m)f(m^') (Wilf 1994, p. 58). Examples of ...

delta(r)=sqrt(r)-2alpha(r), where alpha(r) is the elliptic alpha function.

An elliptic function with no poles in a fundamental cell is a constant.

The general function y(a,b,c,d)=csin{pi/(b-a)[((b-a)x/d+a)^2-a^2]}.

The connected domination number of a connected graph G, denoted d(G), is the size of a minimum connected dominating set of a graph G. The maximum leaf number l(G) and ...

A minimum vertex cut of a graph is a vertex cut of smallest possible size. A vertex cut set of size 1 in a connected graph corresponds to an articulation vertex. The size of ...

where R[nu]>-1, |argp|<pi/4, and a, b>0, J_nu(z) is a Bessel function of the first kind, and I_nu(z) is a modified Bessel function of the first kind.