Search Results for ""

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

The lower clique number omega_L(G) of a graph G may be defined as the size of a smallest maximal clique in a graph G. It therefore corresponds to the coefficient of the ...

The lower matching number of a graph is the minimum size of a maximal independent edge set. The (upper) matching number may be similarly defined as the largest size of an ...

If every component L of X/O_(p^')(X) satisfies the "Schreler property," then L_(p^')(Y)<=L_(p^')(X) for every p-local subgroup Y of X, where L_(p^') is the p-layer.