Search Results for ""

A generalization of a Heyting algebra which replaces Boolean algebra in "intuitionistic" logic.

The (m,n)-lollipop graph is the graph obtained by joining a complete graph K_m to a path graph P_n with a bridge. Precomputed properties of lollipop graphs are available in ...

The Lommel differential equation is a generalization of the Bessel differential equation given by z^2y^('')+zy^'+(z^2-nu^2)y=kz^(mu+1), (1) or, in the most general form, by ...

There are several functions called "Lommel functions." One type of Lommel function appear in the solution to the Lommel differential equation and are given by ...

The Lommel polynomials R_(m,nu)(z) arise from the equation J_(m+nu)(z)=J_nu(z)R_(m,nu)(z)-J_(nu-1)(z)R_(m-1,nu+1)(z), (1) where J_nu(z) is a Bessel function of the first kind ...

The two integrals involving Bessel functions of the first kind given by (alpha^2-beta^2)intxJ_n(alphax)J_n(betax)dx ...

Intuitively, a d-dimensional discrete percolation model is said to be long-range if direct flow is possible between pairs of graph vertices or graph edges which are "very ...

Long division is an algorithm for dividing two numbers, obtaining the quotient one digit at a time. The example above shows how the division of 123456/17 is performed to ...

The symbol separating the dividend from the divisor in a long division that is drawn as a right parenthesis (or sometimes a straight vertical bar) with an attached vinculum ...

An infinite sequence of homomorphisms of modules or additive Abelian groups ...->C_(i+1)->^(d_(i+1))C_i->^(d_i)C_(i-1)->... (1) such that, for all indices i in Z, ...