Search Results for ""

A forest is an acyclic graph (i.e., a graph without any graph cycles). Forests therefore consist only of (possibly disconnected) trees, hence the name "forest." Examples of ...

There are three types of so-called fundamental forms. The most important are the first and second (since the third can be expressed in terms of these). The fundamental forms ...

In 1757, V. Riccati first recorded the generalizations of the hyperbolic functions defined by F_(n,r)^alpha(x)=sum_(k=0)^infty(alpha^k)/((nk+r)!)x^(nk+r), (1) for r=0, ..., ...

The simple continued fraction of the Golomb-Dickman constant lambda is [0; 1, 1, 1, 1, 1, 22, 1, 2, 3, 1, 1, 11, ...] (OEIS A225336). Note that this continued fraction ...

"Vertex" is a synonym for a node of a graph, i.e., one of the points on which the graph is defined and which may be connected by graph edges. The terms "point," "junction," ...

For any prime number p and any positive integer n, the p^n-rank r_(p^n)(G) of a finitely generated Abelian group G is the number of copies of the cyclic group Z_(p^n) ...

A minimal surface and double algebraic surface of 15th order and fifth class which can be given by parametric equations x(u,v) = 2sinhucosv-2/3sinh(3u)cos(3v) (1) y(u,v) = ...

A natural extension of the Riemann p-differential equation given by (d^2w)/(dx^2)+(gamma/x+delta/(x-1)+epsilon/(x-a))(dw)/(dx)+(alphabetax-q)/(x(x-1)(x-a))w=0 where ...

There are a number of tilings of various shapes by all the 12 order n=6 polyiamonds, summarized in the following table. Several of these (starred in the table below) are also ...

The 34 distinct convergent hypergeometric series of order two enumerated by Horn (1931) and corrected by Borngässer (1933). There are 14 complete series for which ...