Search Results for ""

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 ...

Given a power spectrum (a plot of power vs. frequency), aliasing is a false translation of power falling in some frequency range (-f_c,f_c) outside the range. Aliasing is ...

The all-pairs shortest path problem is the determination of the shortest graph distances between every pair of vertices in a given graph. The problem can be solved using n ...

Call a projection of a link an almost alternating projection if one crossing change in the projection makes it an alternating projection. Then an almost alternating link is a ...

For some constant alpha_0, alpha(f,z)<alpha_0 implies that z is an approximate zero of f, where alpha(f,z)=(|f(z)|)/(|f^'(z)|)sup_(k>1)|(f^((k))(z))/(k!f^'(z))|^(1/(k-1)). ...

The alternating group graph AG_n is the undirected Cayley graph of the set of 2(n-2) generators of the alternating group A_n given by g_3^-, g_3^+, g_4^-, g_4^+, ..., g_n^-, ...

An ambient isotopy from an embedding of a manifold M in N to another is a homotopy of self diffeomorphisms (or isomorphisms, or piecewise-linear transformations, etc.) of N, ...

The ampersand curve is the name given by Cundy and Rowlett (1989, p. 72) to the quartic curve with implicit equation (y^2-x^2)(x-1)(2x-3)=4(x^2+y^2-2x)^2. (1) Although it is ...

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, ...