Search Results for ""

Let lambda_(m,n) be Chebyshev constants. Schönhage (1973) proved that lim_(n->infty)(lambda_(0,n))^(1/n)=1/3. (1) It was conjectured that the number ...

The word "order" is used in a number of different ways in mathematics. Most commonly, it refers to the number of elements in (e.g., conjugacy class order, graph order, group ...

Parametric equations are a set of equations that express a set of quantities as explicit functions of a number of independent variables, known as "parameters." For example, ...

The Parts graphs are a set of unit-distance graphs with chromatic number five derived by Jaan Parts in 2019-2020 (Parts 2020a). They provide some of the smallest known ...

The pathwidth of a graph G, also called the interval thickness, vertex separation number, and node searching number, is one less than the size of the largest set in a path ...

The Pell graph Pi_n is the graph defined as follows. Consider n-tuples of (0,1,2) such that maximal blocks of an odd number of 2's are forbidden. Take these as the vertices ...

A pair of elements (p_i,p_j) is called an inversion in a permutation p if i>j and p_i<p_j (Skiena 1990, p. 27; Pemmaraju and Skiena 2003, p. 69). For example, in the ...

A function is said to be piecewise constant if it is locally constant in connected regions separated by a possibly infinite number of lower-dimensional boundaries. The ...

A planted tree is a rooted tree whose root vertex has vertex degree 1. The number of planted trees of n nodes is T_(n-1), where T_(n-1) is the number of rooted trees of n-1 ...

For the rational curve of an unperturbed system with rotation number r/s under a map T (for which every point is a fixed point of T^s), only an even number of fixed points ...