Search Results for ""

A bridgeless graph, also called an isthmus-free graph, is a graph that contains no graph bridges. Examples of bridgeless graphs include complete graphs on n>2 nodes, cycle ...

Given any open set U in R^n with compact closure K=U^_, there exist smooth functions which are identically one on U and vanish arbitrarily close to U. One way to express this ...

A minimal surface given by the parametric equations x(u,v) = u-sinucoshv (1) y(u,v) = 1-cosucoshv (2) z(u,v) = 4sin(1/2u)sinh(1/2v) (3) (Gray 1997), or x(r,phi) = ...

If, in two solids of equal altitude, the sections made by planes parallel to and at the same distance from their respective bases are always equal, then the volumes of the ...

The parameters alpha, beta, gamma, and delta which, like the three Euler angles, provide a way to uniquely characterize the orientation of a solid body. These parameters ...

A Cayley tree is a tree in which each non-leaf graph vertex has a constant number of branches n is called an n-Cayley tree. 2-Cayley trees are path graphs. The unique ...

A plane curve discovered by Maclaurin but first studied in detail by Cayley. The name Cayley's sextic is due to R. C. Archibald, who attempted to classify curves in a paper ...

The central beta function is defined by beta(p)=B(p,p), (1) where B(p,q) is the beta function. It satisfies the identities beta(p) = 2^(1-2p)B(p,1/2) (2) = ...

If g(x) is differentiable at the point x and f(x) is differentiable at the point g(x), then f degreesg is differentiable at x. Furthermore, let y=f(g(x)) and u=g(x), then ...

Apply Markov's inequality with a=k^2 to obtain P[(x-mu)^2>=k^2]<=(<(x-mu)^2>)/(k^2)=(sigma^2)/(k^2). (1) Therefore, if a random variable x has a finite mean mu and finite ...