Search Results for ""

An algorithm is a specific set of instructions for carrying out a procedure or solving a problem, usually with the requirement that the procedure terminate at some point. ...

A tiling of regular polygons (in two dimensions), polyhedra (three dimensions), or polytopes (n dimensions) is called a tessellation. Tessellations can be specified using a ...

In the technical combinatorial sense, an a-ary necklace of length n is a string of n characters, each of a possible types. Rotation is ignored, in the sense that b_1b_2...b_n ...

The Schröder number S_n is the number of lattice paths in the Cartesian plane that start at (0, 0), end at (n,n), contain no points above the line y=x, and are composed only ...

The word "surface" is an important term in mathematics and is used in many ways. The most common and straightforward use of the word is to denote a two-dimensional ...

A sequence of polynomials p_n satisfying the identities p_n(x+y)=sum_(k>=0)(n; k)p_k(x)p_(n-k)(y).

The Buchstab function omega(u) is defined by the delay differential equation {uomega(u)=1 for 1<=u<=2; (uomega(u))^'=omega(u-1) for u>2 (1) (Panario 1998). It approaches the ...

A shift-invariant operator Q for which Qx is a nonzero constant. 1. Qa=0 for every constant a. 2. If p(x) is a polynomial of degree n, Qp(x) is a polynomial of degree n-1. 3. ...

The study, first developed by Boole, of shift-invariant operators which are polynomials in the differential operator D^~. Heaviside calculus can be used to solve any ordinary ...

The intersection number omega(G) of a given graph G is the minimum number of elements in a set S such that G is an intersection graph on S.