Search Results for ""

If one solution (y_1) to a second-order ordinary differential equation y^('')+P(x)y^'+Q(x)y=0 (1) is known, the other (y_2) may be found using the so-called reduction of ...

The second, or diamond, group isomorphism theorem, states that if G is a group with A,B subset= G, and A subset= N_G(B), then (A intersection B)⊴A and AB/B=A/A intersection ...

Special functions which arise as solutions to second order ordinary differential equations are commonly said to be "of the first kind" if they are nonsingular at the origin, ...

The second Zagreb index for a graph with vertex count n and vertex degrees d_i for i=1, ..., n is defined by Z_2=sum_((i,j) in E(G))d_id_j, where E(G) is the edge set of G.

Given a Seifert form f(x,y), choose a basis e_1, ..., e_(2g) for H_1(M^^) as a Z-module so every element is uniquely expressible as n_1e_1+...+n_(2g)e_(2g) (1) with n_i ...

An orientable surface with one boundary component such that the boundary component of the surface is a given knot K. In 1934, Seifert proved that such a surface can be ...

Let p run over all distinct primitive ordered periodic geodesics, and let tau(p) denote the positive length of p, then every even function h(rho) analytic in ...

Let p run over all distinct primitive ordered periodic geodesics, and let tau(p) denote the positive length of p, then the Selberg zeta function is defined as ...

Let x be a positive number, and define lambda(d) = mu(d)[ln(x/d)]^2 (1) f(n) = sum_(d)lambda(d), (2) where the sum extends over the divisors d of n, and mu(n) is the Möbius ...

A sorting algorithm which makes n passes over a set of n elements, in each pass selecting the smallest element and deleting it from the set. This algorithm has running time ...