Search Results for ""

A link invariant is a function from the set of all links to any other set such that the function does not change as the link is changed (up to isotopy). In other words, a ...

The span of an unoriented link diagram (also called the link spread) is the difference between the highest and lowest degrees of its bracket polynomial. The span is a ...

The sequence composed of 1s and 2s obtained by starting with the number 1, and picking subsequent elements to avoid repeating the longest possible substring. The first few ...

product_(i)dp_idq_i, where p_i and q_i are momenta and positions of particles.

The local clustering coefficient of a vertex v_i of a graph G is the fraction of pairs of neighbors of v_i that are connected over all pairs of neighbors of v_i. Computation ...

A graph for which every node has finite degree.

The inverse transform sum_(n=1)^infty(a_nx^n)/(n!)=ln(1+sum_(n=1)^infty(b_nx^n)/(n!)) of the exponential transform ...

A polynomial is called logarithmically concave (or log-concave) if the sequence of its coefficients is logarithmically concave. If P(x) is log-convex and Q(x) is unimodal, ...

The symbol separating the dividend from the divisor in a long division that is drawn as a right parenthesis (or sometimes a straight vertical bar) with an attached vinculum ...

The lower-trimmed subsequence of x={x_n} is the sequence V(x) obtained by subtracting 1 from each x_n and then removing all 0s. If x is a fractal sequence, then V(x) is a ...