Search Results for ""

A unique factorization domain, called UFD for short, is any integral domain in which every nonzero noninvertible element has a unique factorization, i.e., an essentially ...

Following Yates (1980), a prime p such that 1/p is a repeating decimal with decimal period shared with no other prime is called a unique prime. For example, 3, 11, 37, and ...

The upper irredundance number IR(G) of a graph G is the maximum size of an irredundant set of vertices in G. It is therefore equal to the size of a maximum irredundant set as ...

A k-coloring of a graph G is a vertex coloring that is an assignment of one of k possible colors to each vertex of G (i.e., a vertex coloring) such that no two adjacent ...

The gear graph, also sometimes known as a bipartite wheel graph (Brandstädt et al. 1987), is a wheel graph with a graph vertex added between each pair of adjacent graph ...

Ellipsoidal harmonics of the second kind, also known as Lamé functions of the second kind, are variously defined as F_m^p(x)=(2m+1)E_m^p(x) ...

Euler's continued fraction is the name given by Borwein et al. (2004, p. 30) to Euler's formula for the inverse tangent, ...

The Machin-like formula 1/4pi=cot^(-1)(2)+cot^(-1)(3). The other 2-term Machin-like formulas are Hermann's formula, hutton's formula, and Machin's formula.

Let Omega be an open, bounded, and connected subset of R^d for some d and let dx denote d-dimensional Lebesgue measure on R^d. In functional analysis, the Friedrichs ...

In elliptic cylindrical coordinates, the scale factors are h_u=h_v=sqrt(sinh^2u+sin^2v), h_z=1, and the separation functions are f_1(u)=f_2(v)=f_3(z)=1, giving a Stäckel ...