Search Results for ""

A branch point whose neighborhood of values wrap around the range a finite number of times p as their complex arguments theta varies from 0 to a multiple of 2pi is called an ...

Given a graph G, the arboricity Upsilon(G) is the minimum number of edge-disjoint acyclic subgraphs (i.e., spanning forests) whose union is G. An acyclic graph therefore has ...

There are two kinds of Bell polynomials. A Bell polynomial B_n(x), also called an exponential polynomial and denoted phi_n(x) (Bell 1934, Roman 1984, pp. 63-67) is a ...

The Bernoulli inequality states (1+x)^n>1+nx, (1) where x>-1!=0 is a real number and n>1 an integer. This inequality can be proven by taking a Maclaurin series of (1+x)^n, ...

An extremal graph in which the forced triangles are all the same color. Call R the number of red monochromatic forced triangles and B the number of blue monochromatic forced ...

The boustrophedon ("ox-plowing") transform b of a sequence a is given by b_n = sum_(k=0)^(n)(n; k)a_kE_(n-k) (1) a_n = sum_(k=0)^(n)(-1)^(n-k)(n; k)b_kE_(n-k) (2) for n>=0, ...

A branch cut is a curve (with ends possibly open, closed, or half-open) in the complex plane across which an analytic multivalued function is discontinuous. For convenience, ...

An n-bridge knot is a knot with bridge number n. The set of 2-bridge knots is identical to the set of rational knots. If L is a 2-bridge knot, then the BLM/Ho polynomial Q ...

A dimension also called the fractal dimension, Hausdorff dimension, and Hausdorff-Besicovitch dimension in which nonintegral values are permitted. Objects whose capacity ...

A finite group G has a finite number of conjugacy classes and a finite number of distinct irreducible representations. The group character of a group representation is ...