Search Results for ""

An additive function is an arithmetic function such that whenever positive integers a and b are relatively prime, f(ab)=f(a)+f(b). An example of an additive function is ...

A mathematical object S is said to be additively closed if a,b in S implies that a+b in S.

If a is an element of a field F over the prime field P, then the set of all rational functions of a with coefficients in P is a field derived from P by adjunction of a.

A string or word is said to be admissible if that word appears in a given sequence. For example, in the sequence aabaabaabaabaab..., a, aa, baab are all admissible, but bb is ...

Any link can be represented by a closed braid.

The set of roots of a polynomial f(x,y,z)=0. An algebraic surface is said to be of degree n=max(i+j+k), where n is the maximum sum of powers of all terms ...

An alpha value is a number 0<=alpha<=1 such that P(z>=z_(observed))<=alpha is considered "significant," where P is a P-value.

A set (usually of letters) from which a subset is drawn. A sequence of letters is called a word, and a set of words is called a code.

A term in social choice theory meaning invariance of a result under permutation of voters.

If a map f:G->G^' from a group G to a group G^' satisfies f(ab)=f(b)f(a) for all a,b in G, then f is said to be an antihomomorphism. Moreover, if G and G^' are isomorphic, ...