Search Results for ""

In the algebraic geometry of Grothendieck, a stack refers to a sheaf of categories. In particular, a stack is a presheaf of categories in which the following descent ...

Algorithmic graph theory is the study of graph traversal and generation and the complexity of these operations. Topics in algorithmic graph theory include Eulerian and ...

Let M^n be a compact n-dimensional oriented Riemannian manifold without boundary, let O be a group representation of pi_1(M) by orthogonal matrices, and let E(O) be the ...

A technique used by André (1887) to provide an elegant solution to the ballot problem (Hilton and Pederson 1991) and in study of Wiener processes (Doob 1953; Papoulis 1984, ...

The mathematical study of how given quantities can be approximated by other (usually simpler) ones under appropriate conditions. Approximation theory also studies the size ...

There are at least two results known as "the area principle." The geometric area principle states that (|A_1P|)/(|A_2P|)=(|A_1BC|)/(|A_2BC|). (1) This can also be written in ...

The word argument is used in several differing contexts in mathematics. The most common usage refers to the argument of a function, but is also commonly used to refer to the ...

Given a regular surface M, an asymptotic curve is formally defined as a curve x(t) on M such that the normal curvature is 0 in the direction x^'(t) for all t in the domain of ...

An automorphic function f(z) of a complex variable z is one which is analytic (except for poles) in a domain D and which is invariant under a countably infinite group of ...

Propositional calculus, first-order logic, and other theories in mathematical logic are defined by their axioms (or axiom schemata, plural: axiom schemata) and inference ...