Search Results for ""

A weak Riemannian metric on a smooth manifold M is a (0,2) tensor field g which is both a weak pseudo-Riemannian metric and positive definite. In a very precise way, the ...

A weak snark is a cyclically 4-edge connected cubic graph with edge chromatic number 4 and girth at least 4 (Brinkmann et al. 2013). Weak snarks therefore represent a more ...

Let X=(X,tau) be a topological vector space whose continuous dual X^* separates points (i.e., is T2). The weak topology tau_w on X is defined to be the coarsest/weakest ...

The notion of weak amenability was first introduced by Bade et al. (1987), who termed a commutative Banach algebra A "weakly amenable" if every continuous derivation from A ...

A weakly connected digraph is a directed graph in which it is possible to reach any node starting from any other node by traversing edges in some direction (i.e., not ...

A weakly perfect graph is a graph for which omega(G)=chi(G) (without any requirement that this condition also hold on induced subgraphs, which is required for a graph to be ...

A prime number is said to be weakly prime if changing a single digit to every other possible digit produces a composite number when performed on each digit. The first few ...

A web diagram, also called a cobweb plot, is a graph that can be used to visualize successive iterations of a function y=f(x). In particular, the segments of the diagram ...

Consider the differential equation satisfied by w=z^(-1/2)W_(k,-1/4)(1/2z^2), (1) where W is a Whittaker function, which is given by ...

Let the values of a function f(x) be tabulated at points x_i equally spaced by h=x_(i+1)-x_i, so f_1=f(x_1), f_2=f(x_2), .... Then Weddle's rule approximating the integral of ...