Search Results for ""

A relation "<=" is called a preorder (or quasiorder) on a set S if it satisfies: 1. Reflexivity: a<=a for all a in S. 2. Transitivity: a<=b and b<=c implies a<=c. A preorder ...

Presburger arithmetic is the first-order theory of the natural numbers containing addition but no multiplication. It is therefore not as powerful as Peano arithmetic. ...

The present value v_n of a single payment made at n periods in the future is v_n=p/((1+r)^n), (1) where n is the number of periods until payment, p is the payment amount, and ...

For X a topological space, the presheaf F of Abelian groups (rings, ...) on X is defined such that 1. For every open subset U subset= X, an Abelian group (ring, ...) F(U), ...

A presheaf C of categories consists of the following data: 1. For every local homeomorphism f:Y->X of topological spaces X, Y, a category C(f:Y->X); 2. For every diagram f ...

A pretzel graph is a graph with graph genus 3 (West 2000, p. 266). Planar, toroidal graphs, and double-toroidal graphs are therefore not pretzel. Examples of pretzel graphs ...

A knot obtained from a tangle which can be represented by a finite sequence of integers.

A topological transformation in which a surface is made out of an infinitely elastic material which, however, may not be torn or cut. Using this simple prescription gives the ...

The previous prime function PP(n) gives the largest prime less than n. The function can be given explicitly as PP(n)=p_(pi(n-1)), where p_i is the ith prime and pi(n) is the ...

Consider a bivariate normal distribution in variables x and y with covariance rho=rho_(11)=<xy>-<x><y> (1) and an arbitrary function g(x,y). Then the expected value of the ...