Search Results for ""

A weakly binary tree is a planted tree in which all nonroot graph vertices are adjacent to at most three graph vertices. Let g(z)=sum_(i=0)^inftyg_iz^i, (1) be the generating ...

Legendre-Gauss quadrature is a numerical integration method also called "the" Gaussian quadrature or Legendre quadrature. A Gaussian quadrature over the interval [-1,1] with ...

The q-binomial coefficient is a q-analog for the binomial coefficient, also called a Gaussian coefficient or a Gaussian polynomial. A q-binomial coefficient is given by [n; ...

A generalized octagon GO(n,k) is a generalized polygon of order 8. GO(1,2) is the (3,8)-cage graph, the incidence graph of the Cremona-Richmond configuration, the cubic ...

The Reuleaux tetrahedron, sometimes also called the spherical tetrahedron, is the three-dimensional solid common to four spheres of equal radius placed so that the center of ...

A superior highly composite number is a positive integer n for which there is an e>0 such that (d(n))/(n^e)>=(d(k))/(k^e) for all k>1, where the function d(n) counts the ...

Given a homogeneous linear second-order ordinary differential equation, y^('')+P(x)y^'+Q(x)y=0, (1) call the two linearly independent solutions y_1(x) and y_2(x). Then ...

For some constant alpha_0, alpha(f,z)<alpha_0 implies that z is an approximate zero of f, where alpha(f,z)=(|f(z)|)/(|f^'(z)|)sup_(k>1)|(f^((k))(z))/(k!f^'(z))|^(1/(k-1)). ...

The best known example of an Anosov diffeomorphism. It is given by the transformation [x_(n+1); y_(n+1)]=[1 1; 1 2][x_n; y_n], (1) where x_(n+1) and y_(n+1) are computed mod ...

The backward difference is a finite difference defined by del _p=del f_p=f_p-f_(p-1). (1) Higher order differences are obtained by repeated operations of the backward ...