Search Results for ""

The Chebotarev density theorem is a complicated theorem in algebraic number theory which yields an asymptotic formula for the density of prime ideals of a number field K that ...

Let N^* be the smallest dimension n of a hypercube such that if the lines joining all pairs of corners are two-colored for any n>=N^*, a complete graph K_4 of one color with ...

The algebraic unknotting number of a knot K in S^3 is defined as the algebraic unknotting number of the S-equivalence class of a Seifert matrix of K. The algebraic unknotting ...

For a particular format in the IEEE 754-2008 framework, a normal number is a finite nonzero floating-point number with magnitude greater than or equal to a minimum value ...

The lower matching number of a graph is the minimum size of a maximal independent edge set. The (upper) matching number may be similarly defined as the largest size of an ...

The winding number of a contour gamma about a point z_0, denoted n(gamma,z_0), is defined by n(gamma,z_0)=1/(2pii)∮_gamma(dz)/(z-z_0) and gives the number of times gamma ...

The clique covering number theta(G) of a graph G is the minimum number of cliques in G needed to cover the vertex set of G. Since theta(G) involves the minimum number of ...

The maximum leaf number l(G) of a graph G is the largest number of tree leaves in any of its spanning trees. (The corresponding smallest number of leaves is known as the ...

A separable extension K of a field F is one in which every element's algebraic number minimal polynomial does not have multiple roots. In other words, the minimal polynomial ...

The vertex cover number is the size of a minimum vertex cover in a graph G is known as the vertex cover number of G, denoted tau(G). The König-Egeváry theorem states that the ...