Search Results for ""

The algebraic unknotting number of a knot K in S^3 is defined as the algebraic unknotting number of the S-equivalence class of a Seifert matrix of K. The algebraic unknotting ...

Let K be a field, and A a K-algebra. Elements y_1, ..., y_n are algebraically independent over K if the natural surjection K[Y_1,...,Y_n]->K[y_1,...,y_n] is an isomorphism. ...

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

An almost perfect number, also known as a least deficient or slightly defective (Singh 1997) number, is a positive integer n for which the divisor function satisfies ...

A function representable as a generalized Fourier series. Let R be a metric space with metric rho(x,y). Following Bohr (1947), a continuous function x(t) for (-infty<t<infty) ...

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

A magic square for which the number of letters in the word for each number generates another magic square. This definition depends, of course, on the language being used. In ...