Search Results for ""

Long multiplication is the method of multiplication that is commonly taught to elementary school students throughout the world. It can be used on two numbers of arbitrarily ...

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

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

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 Lucas-Lehmer test is an efficient deterministic primality test for determining if a Mersenne number M_n is prime. Since it is known that Mersenne numbers can only be ...

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

Macdonald's constant term conjectures are related to root systems of Lie algebras (Macdonald 1982, Andrews 1986). They can be regarded as generalizations of Dyson's ...

Macdonald's plane partition conjecture proposes a formula for the number of cyclically symmetric plane partitions (CSPPs) of a given integer whose Ferrers diagrams fit inside ...

The quantities obtained from cubic, hexagonal, etc., lattice sums, evaluated at s=1, are called Madelung constants. For cubic lattice sums ...