Search Results for ""

A notation invented by Dirac which is very useful in quantum mechanics. The notation defines the "ket" vector, denoted |psi>, and its conjugate transpose, called the "bra" ...

The Dirichlet kernel D_n^M is obtained by integrating the number theoretic character e^(i<xi,x>) over the ball |xi|<=M, D_n^M=-1/(2pir)d/(dr)D_(n-2)^M.

Handles and cross-handles are equivalent in the presence of a cross-cap.

The edge set of a graph is simply a set of all edges of the graph. The cardinality of the edge set for a given graph g is known as the edge count of g. The edge set for a ...

For any integers a_i with 1<=a_1<a_2<...<a_k<=n, the proportion of permutations in the symmetric group S_n whose cyclic decompositions contain no cycles of lengths a_1, a_2, ...

An endomorphism is called ergodic if it is true that T^(-1)A=A implies m(A)=0 or 1, where T^(-1)A={x in X:T(x) in A}. Examples of ergodic endomorphisms include the map X->2x ...

An array of "trees" of unit height located at integer-coordinate points in a point lattice. When viewed from a corner along the line y=x in normal perspective, a quadrant of ...

A graph vertex in a graph is said to be an even node if its vertex degree is even.

If at least one solution can be determined for a given problem, a solution to that problem is said to exist. Frequently, mathematicians seek to prove the existence of ...

A phrase used by Tukey to describe data points which are outside the outer fences.