Search Results for ""

A nut graph is a graph on n>=2 vertices with adjacency matrix A such that A has matrix rank 1 and contains no 0 element (Sciriha 1998, 2008; Sciriha and Gutman, 1998; and ...

A knot which is not alternating. Unlike alternating knots, flype moves are not sufficient to pass between all minimal diagrams of a given nonalternating knot (Hoste et al. ...

Given a complete graph K_n which is two-colored, the number of forced monochromatic triangles is at least {1/3u(u-1)(u-2) for n=2u; 2/3u(u-1)(4u+1) for n=4u+1; ...

A set of real numbers x_1, ..., x_n is said to possess an integer relation if there exist integers a_i such that a_1x_1+a_2x_2+...+a_nx_n=0, with not all a_i=0. For ...

|_n]={n for n!=0; 1 for n=0. (1)

Let A be an n×n matrix over a field F. Using the three elementary row and column operations over elements in the field, the n×n matrix xI-A with entries from the principal ...

The eight Gell-Mann matrices lambda_i, i=1,...,8, are an example of the set of generators of the Lie algebra associated to the special unitary group SU(3). Explicitly, these ...

The identric mean is defined by I(a,b)=1/e((b^b)/(a^a))^(1/(b-a)) for a>0, b>0, and a!=b. The identric mean has been investigated intensively and many remarkable inequalities ...

The nonnegative integers 0, 1, 2, ....

A plane path on a set of equally spaced lattice points, starting at the origin, where the first step is one unit to the north or south, the second step is two units to the ...