Search Results for ""

In common usage, an ordinal number is an adjective which describes the numerical position of an object, e.g., first, second, third, etc. In formal set theory, an ordinal ...

Orthogonal polynomials are classes of polynomials {p_n(x)} defined over a range [a,b] that obey an orthogonality relation int_a^bw(x)p_m(x)p_n(x)dx=delta_(mn)c_n, (1) where ...

An out-shuffle, also known as a perfect shuffle (Golomb 1961), is a riffle shuffle in which the top half of the deck is placed in the right hand, and cards are then ...

There are six Painlevé transcendents, corresponding to second-order ordinary differential equations whose only movable singularities are ordinary poles and which cannot be ...

A palindromic number is a number (in some base b) that is the same when written forwards or backwards, i.e., of the form a_1a_2...a_2a_1. The first few palindromic numbers ...

The n-pan graph is the graph obtained by joining a cycle graph C_n to a singleton graph K_1 with a bridge. The n-pan graph is therefore isomorphic with the (n,1)-tadpole ...

The Paulus graphs are the 15 strongly regular graphs on 25 nodes with parameters (nu,k,lambda,mu)=(25,12,5,6) and the 10 strongly regular graphs on 26 nodes with parameters ...

The paw graph is the 3-pan graph, which is also isomorphic to the (3,1)-tadpole graph. It is implemented in the Wolfram Language as GraphData["PawGraph"].

The pedal of a curve C with respect to a point O is the locus of the foot of the perpendicular from O to the tangent to the curve. More precisely, given a curve C, the pedal ...

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 ...