Search Results for ""

Zygmund (1988, p. 192) noted that there exists a number alpha_0 in (0,1) such that for each alpha>=alpha_0, the partial sums of the series sum_(n=1)^(infty)n^(-alpha)cos(nx) ...

The Löwenheim-Skolem theorem is a fundamental result in model theory which states that if a countable theory has a model, then it has a countable model. Furthermore, it has a ...

The (m,n)-lollipop graph is the graph obtained by joining a complete graph K_m to a path graph P_n with a bridge. Precomputed properties of lollipop graphs are available in ...

The longhorn graph is the graph on 7 vertices illustrated above. It is implemented in the Wolfram Language as GraphData["LonghornGraph"].

A Lorentz transformation is a four-dimensional transformation x^('mu)=Lambda^mu_nux^nu, (1) satisfied by all four-vectors x^nu, where Lambda^mu_nu is a so-called Lorentz ...

The standard Lorentzian inner product on R^4 is given by -dx_0^2+dx_1^2+dx_2^2+dx_3^2, (1) i.e., for vectors v=(v_0,v_1,v_2,v_3) and w=(w_0,w_1,w_2,w_3), ...

Lorentzian n-space is the inner product space consisting of the vector space R^n together with the n-dimensional Lorentzian inner product. In the event that the (1,n-1) ...

The Loupekine snarks are the two snarks on 22 vertices and 33 edges illustrated above. They are implemented in the Wolfram Language as GraphData["LoupekineSnark1"] and ...

The Lovász number theta(G) of a graph G, sometimes also called the theta function of G, was introduced by Lovász (1979) with the explicit goal of estimating the Shannon ...

The Lyapunov characteristic exponent [LCE] gives the rate of exponential divergence from perturbed initial conditions. To examine the behavior of an orbit around a point ...