Search Results for ""

A quantity such as a polynomial discriminant which remains unchanged under a given class of algebraic transformations. Such invariants were originally called ...

Let X be an alphabet (i.e., a finite and nonempty set), and call its member letters. A word on X is a finite sequence of letters a_1...a_n, where a_1,...,a_n in X. Denote the ...

A class of fibered knots and links which arises in algebraic geometry. An algebraic link is formed by connecting the NW and NE strings and the SW and SE strings of an ...

A quasigroup with an identity element e such that xe=x and ex=x for any x in the quasigroup. All groups are loops. In general, loops are considered to have very little in the ...

Algebraic number theory is the branch of number theory that deals with algebraic numbers. Historically, algebraic number theory developed as a set of tools for solving ...

An algebraic set is the locus of zeros of a collection of polynomials. For example, the circle is the set of zeros of x^2+y^2-1 and the point at (0,0) is the set of zeros of ...

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