Search Results for ""
2371 - 2380 of 2561 for Negative IntegerSearch Results
The parabolic cylinder functions are a class of functions sometimes called Weber functions. There are a number of slightly different definitions in use by various authors. ...
A game played on a board of a given shape consisting of a number of holes of which all but one are initially filled with pegs. The goal is to remove all pegs but one by ...
A perfect graph is a graph G such that for every induced subgraph of G, the clique number equals the chromatic number, i.e., omega(G)=chi(G). A graph that is not a perfect ...
A permutation cycle is a subset of a permutation whose elements trade places with one another. Permutations cycles are called "orbits" by Comtet (1974, p. 256). For example, ...
Let F(n,sigma) denote the number of permutations on the symmetric group S_n which avoid sigma in S_k as a subpattern, where "tau contains sigma as a subpattern" is ...
The constant pi, denoted pi, is a real number defined as the ratio of a circle's circumference C to its diameter d=2r, pi = C/d (1) = C/(2r) (2) pi has decimal expansion ...
A short mnemonic for remembering the first seven decimal digits of pi is "How I wish I could calculate pi" (C. Heckman, pers. comm., Feb. 3, 2005). Eight digits are given by ...
A plane partition is a two-dimensional array of integers n_(i,j) that are nonincreasing both from left to right and top to bottom and that add up to a given number n. In ...
The Pochhammer symbol (x)_n = (Gamma(x+n))/(Gamma(x)) (1) = x(x+1)...(x+n-1) (2) (Abramowitz and Stegun 1972, p. 256; Spanier 1987; Koepf 1998, p. 5) for n>=0 is an ...
An n-polyhedral graph (sometimes called a c-net) is a 3-connected simple planar graph on n nodes. Every convex polyhedron can be represented in the plane or on the surface of ...
...
View search results from all Wolfram sites (340470 matches)

