Search Results for ""

To rearrange without cutting or pasting.

A type II Markov move.

The set closure of the set of arguments of a function f for which f is not zero.

The Reidemeister move of type I.

Let k be a field of finite characteristic p. Then a polynomial P(x) in k[x] is said to be additive iff P(a)+P(b)=P(a+b) for {a,b,a+b} subset k. For example, P(x)=x^2+x+4 is ...

A tree (also called a bicentral tree) having two nodes that are graph centers. The numbers of bicentered trees on n=1, 2, ... nodes are 0, 1, 0, 1, 1, 3, 4, 11, 20, 51, 108 ...

A tree (also called a central tree) having a single node that is a graph center. The numbers of centered trees on n=1, 2, ... nodes are 1, 0, 1, 1, 2, 3, 7, 12, 27, 55, 127, ...

y approx m+sigmaw, (1) where w = (2) where h_1(x) = 1/6He_2(x) (3) h_2(x) = 1/(24)He_3(x) (4) h_(11)(x) = -1/(36)[2He_3(x)+He_1(x)] (5) h_3(x) = 1/(120)He_4(x) (6) h_(12)(x) ...

The Hodge conjecture asserts that, for particularly nice types of spaces called projective algebraic varieties, the pieces called Hodge cycles are actually rational linear ...

The thinnest sequence which contains 1, and whenever it contains x, also contains 2x, 3x+2, and 6x+3: 1, 2, 4, 5, 8, 9, 10, 14, 15, 16, 17, ... (OEIS A005658).