Search Results for ""

Let a discrete distribution have probability function p_k, and let a second discrete distribution have probability function q_k. Then the relative entropy of p with respect ...

In category theory, a tensor category (C, tensor ,I,a,r,l) consists of a category C, an object I of C, a functor tensor :C×C->C, and a natural isomorphism a = a_(UVW):(U ...

Let R be a commutative ring. A tensor category (C, tensor ,I,a,r,l) is said to be a tensor R-category if C is an R-category and if the tensor product functor is an R-bilinear ...

In each of the ten cases with zero or unit mass, the finite part of the scalar 3-loop tetrahedral vacuum Feynman diagram reduces to four-letter "words" that represent ...

The twist of a ribbon measures how much it twists around its axis and is defined as the integral of the incremental twist around the ribbon. A formula for the twist is given ...

A natural transformation Phi_Y:B(AY)->Y is called unital if the leftmost diagram above commutes. Similarly, a natural transformation Psi_Y:Y->A(BY) is called unital if the ...

In computer science, a pop is an action which removes the initial element from the top of a queue or stack, turning the list (a_1, a_2, ..., a_n) into (a_2, ..., a_n) and ...

A precise sequence of instructions designed to accomplish a given task. The implementation of an algorithm on a computer using a programming language is an example of a ...

The study of the waiting times, lengths, and other properties of queues.

A sorting method proposed by Shell (1959) in which records being sorted can take long jumps instead of being restricted to short steps.