Search Results for ""

The operator B^~ defined by B^~f(z)=int_D((1-|z|^2)^2)/(|1-zw^_|^4)f(w)dA(w) for z in D, where D is the unit open disk and w^_ is the complex conjugate (Hedenmalm et al. ...

A Berge graph is a simple graph that contains no odd graph hole and no odd graph antihole. The strong perfect graph theorem asserts that a graph is perfect iff it is a Berge ...

Let M be a compact n-dimensional manifold with injectivity radius inj(M). Then Vol(M)>=(c_ninj(M))/pi, with equality iff M is isometric to the standard round sphere S^n with ...

A matching is a maximum matching iff it contains no augmenting path.

A Bergman kernel is a function of a complex variable with the "reproducing kernel" property defined for any domain in which there exist nonzero analytic functions of class ...

Let G be an open subset of the complex plane C, and let L_a^2(G) denote the collection of all analytic functions f:G->C whose complex modulus is square integrable with ...

If a sequence takes only a small number of different values, then by regarding the values as the elements of a finite field, the Berlekamp-Massey algorithm is an efficient ...

An algorithm that can be used to factor a polynomial f over the integers. The algorithm proceeds by first factoring f modulo a suitable prime p via Berlekamp's method and ...

The Berlekamp-van Lint-Seidel graph is the Hamiltonian strongly regular graph on 243 vertices with parameters (243,22,1,2). It is also distance-regular with intersection ...

(dy)/(dx)+p(x)y=q(x)y^n. (1) Let v=y^(1-n) for n!=1. Then (dv)/(dx)=(1-n)y^(-n)(dy)/(dx). (2) Rewriting (1) gives y^(-n)(dy)/(dx) = q(x)-p(x)y^(1-n) (3) = q(x)-vp(x). (4) ...