Search Results for ""

The Stolarsky mean of two numbers a and c is defined by S_p(a,c)=[(a^p-c^p)/(p(a-c))]^(1/(p-1)) (Havil 2003, p. 121).

Let H_nu^((iota))(x) be a Hankel function of the first or second kind, let x,nu>0, and define w=sqrt((x/nu)^2-1). Then ...

If two curves of the same curve genus >1 are in rational correspondence, then that correspondence is birational.

There are several different definitions of the barbell graph. Most commonly and in this work, the n-barbell graph is the simple graph obtained by connecting two copies of a ...

A complete bipartite graph, sometimes also called a complete bicolored graph (Erdős et al. 1965) or complete bigraph, is a bipartite graph (i.e., a set of graph vertices ...

The graph distance matrix, sometimes also called the all-pairs shortest path matrix, is the square matrix (d_(ij)) consisting of all graph distances from vertex v_i to vertex ...

A helix, sometimes also called a coil, is a curve for which the tangent makes a constant angle with a fixed line. The shortest path between two points on a cylinder (one not ...

An ideal is a subset I of elements in a ring R that forms an additive group and has the property that, whenever x belongs to R and y belongs to I, then xy and yx belong to I. ...

The Koch snowflake is a fractal curve, also known as the Koch island, which was first described by Helge von Koch in 1904. It is built by starting with an equilateral ...

The Harries-Wong graph is one of the three (3,10)-cage graphs, the other two being the (10,3)-cage known as the Balaban 10-cage and the Harries graph. The Harries-Wong graph ...