Search Results for ""

Lehmer's formula is a formula for the prime counting function, pi(x) = (1) where |_x_| is the floor function, a = pi(x^(1/4)) (2) b = pi(x^(1/2)) (3) b_i = pi(sqrt(x/p_i)) ...

For a sequence {chi_i}, the Levine-O'Sullivan greedy algorithm is given by chi_1 = 1 (1) chi_i = max_(1<=j<=i-1)(j+1)(i-chi_j) (2) for i>1. The sequence generated by this ...

Random walk trajectories which are composed of self-similar jumps. They are described by the Lévy distribution.

A Lie groupoid over B is a groupoid G for which G and B are differentiable manifolds and alpha,beta and multiplication are differentiable maps. Furthermore, the derivatives ...

Sequences x_n^((1)), x_n^((2)), ..., x_n^((k)) are linearly dependent if constants c_1, c_2, ..., c_k (not all zero) exist such that sum_(i=1)^kc_ix_n^((i))=0 for n=0, 1, ....

A planar diagram depicting a link (or knot) as a sequence of segments with gaps representing undercrossings and solid lines overcrossings. In such a diagram, only two ...

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