Search Results for ""

A spigot algorithm is an algorithm which generates digits of a quantity one at a time without using or requiring previously computed digits. Amazingly, spigot algorithms are ...

A tensor category (C, tensor ,I,a,r,l) is strict if the maps a, l, and r are always identities. A related notion is that of a tensor R-category.

Let R be a ring, and let I and J be ideals of R with I subset= J. Then J/I is an ideal of R/I and (R/I)/(J/I)=R/J.

A three-colorable graph G is a graph with chromatic number chi(G)<=3.

A topological groupoid over B is a groupoid G such that B and G are topological spaces and alpha,beta, and multiplication are continuous maps. Here, alpha and beta are maps ...

A topological partial algebra is a pair (A,tau), where A=(A,(f_i^A)_(i in I)) is a partial algebra and each of the operations f_i^A is continuous in the product topology. ...

The partial differential equation u_(yy)=yu_(xx).

Integrals of the form intf(costheta,sintheta)dtheta (1) can be solved by making the substitution z=e^(itheta) so that dz=ie^(itheta)dtheta and expressing costheta = ...

Let a cotree of a spanning tree T in a connected graph G be denoted T^*. Then the edges of G which are not in T^* are called its twigs (Harary 1994, p. 39).

A dot placed under a symbol to indicate a dummy variable, e.g., c_._1 (Comtet 1974, p. 32). This notation, however, is not very common.