Search Results for ""

If the rank polynomial R(x,y) of a graph G is given by sumrho_(rs)x^ry^s, then rho_(rs) is the number of subgraphs of G with rank r and co-rank s, and the matrix (rho_(rs)) ...

A ring homomorphism is a map f:R->S between two rings such that 1. Addition is preserved:f(r_1+r_2)=f(r_1)+f(r_2), 2. The zero element is mapped to zero: f(0_R)=0_S, and 3. ...

A sorting algorithm which makes n passes over a set of n elements, in each pass selecting the smallest element and deleting it from the set. This algorithm has running time ...

A sextic graph is a regular graph of degree six. The numbers of simple sextic graphs on n=7, 8, ... nodes are 1, 1, 4, 21, 266, 7846, 367860, ... (OEIS A006822). Examples are ...

An algebraic surface which can be represented implicitly by a polynomial of degree six in x, y, and z. Examples of quartic surfaces include the Barth sextic, Boy surface, ...

Define f(x_1,x_2,...,x_n) with x_i positive as f(x_1,x_2,...,x_n)=sum_(i=1)^nx_i+sum_(1<=i<=k<=n)product_(j=i)^k1/(x_j). (1) Then minf=3n-C+o(1) (2) as n increases, where the ...

A transformation that preserves angles and changes all distances in the same ratio, called the ratio of magnification. A similarity can also be defined as a transformation ...

If M^n is a finite simplicial complex of dimension n>=5 that has the homotopy type of the sphere S^n and is locally piecewise linearly homeomorphic to the Euclidean space ...

A strongly binary tree is a rooted tree for which the root is adjacent to either zero or two vertices, and all non-root vertices are adjacent to either one or three vertices ...

The "ternary" Champernowne constant can be defined by concatenating the ternary representations of the integers C_3 = 0.(1)(2)(1,0)(1,1)(1,2)(2,0)..._3 (1) = ...