Search Results for ""

Construct a square equal in area to a circle using only a straightedge and compass. This was one of the three geometric problems of antiquity, and was perhaps first attempted ...

The clique polynomial C_G(x) for the graph G is defined as the polynomial C_G(x)=1+sum_(k=1)^(omega(G))c_kx^k, (1) where omega(G) is the clique number of G, the coefficient ...

A cograph (or "complement-reducible graph") is simple graph defined by the criteria 1. K_1 is a cograph, 2. If X is a cograph, then so is its graph complement, and 3. If X ...

The theory of classifying problems based on how difficult they are to solve. A problem is assigned to the P-problem (polynomial-time) class if the number of steps needed to ...

The confocal ellipsoidal coordinates, called simply "ellipsoidal coordinates" by Morse and Feshbach (1953) and "elliptic coordinates" by Hilbert and Cohn-Vossen (1999, p. ...

A cylindrical segment, sometimes also called a truncated cylinder, is the solid cut from a circular cylinder by two (or more) planes. If there are two cutting planes, one ...

Given an undirected graph, a degree sequence is a monotonic nonincreasing sequence of the vertex degrees (valencies) of its graph vertices. The number of degree sequences for ...

The phrase dependent percolation is used in two-dimensional discrete percolation to describe any general model in which the states of the various graph edges (in the case of ...

A plot of the map winding number W resulting from mode locking as a function of Omega for the circle map theta_(n+1)=theta_n+Omega-K/(2pi)sin(2pitheta_n) (1) with K=1. (Since ...

Let s_1, s_2, ... be an infinite series of real numbers lying between 0 and 1. Then corresponding to any arbitrarily large K, there exists a positive integer n and two ...