Search Results for ""

An algorithm used to recursively construct a set of objects from the smallest possible constituent parts. Given a set of k integers (a_1, a_2, ..., a_k) with a_1<a_2<...<a_k, ...

A permutation problem invented by Cayley. Let the numbers 1, 2, ..., n be written on a set of cards, and shuffle this deck of cards. Now, start counting using the top card. ...

The negadecimal representation of a number n is its representation in base -10 (i.e., base negative 10). It is therefore given by the coefficients a_na_(n-1)...a_1a_0 in n = ...

The harmonic parameter of a polyhedron is the weighted mean of the distances d_i from a fixed interior point to the faces, where the weights are the areas A_i of the faces, ...

Laguerre-Gauss quadrature, also called Gauss-Laguerre quadrature or Laguerre quadrature, is a Gaussian quadrature over the interval [0,infty) with weighting function ...

The self-describing sequence consisting of "blocks" of single and double 1s and 2s, where a "block" is a single digit or pair of digits that is different from the digit (or ...

An unlabeled transitive digraph with n nodes is called a "topology." The numbers of distinct topologies on n=1, 2, ... nodes are 1, 3, 9, 33, 139, 718, 4535, ... (OEIS ...

Let G be an algebraic group. G together with the discrete topology is a locally compact group and one may consider the counting measure as a left invariant Haar measure on G. ...

z(1-z)(d^2y)/(dz^2)+[c-(a+b+1)z](dy)/(dz)-aby=0. It has regular singular points at 0, 1, and infty. Every second-order ordinary differential equation with at most three ...

A Lehner continued fraction is a generalized continued fraction of the form b_0+(e_1)/(b_1+(e_2)/(b_2+(e_3)/(b_3+...))) where (b_i,e_(i+1))=(1,1) or (2, -1) for x in [1,2) an ...