Search Results for ""

Let X be an arbitrary topological space. Denote the set closure of a subset A of X by A^- and the complement of A by A^'. Then at most 14 different sets can be derived from A ...

Ball and Coxeter (1987, pp. 277-278) define the ladder graph nP_2, here called the ladder rung graph, of order n as the graph union of n copies of the path graph P_2. The ...

A wide variety of large numbers crop up in mathematics. Some are contrived, but some actually arise in proofs. Often, it is possible to prove existence theorems by deriving ...

The Lemke graph is the 8-node graph with 13 edges illustrated above (Lemke and Kleitman 1989, Hurlbert 2011, Hurlbert 2013). The Lemke graph is the smallest graph that does ...

An l_x table is a tabulation of numbers which is used to calculate life expectancies. x n_x d_x l_x q_x L_x T_x e_x 0 1000 200 1.00 0.20 0.90 2.70 2.70 1 800 100 0.80 0.12 ...

Linear algebra is the study of linear sets of equations and their transformation properties. Linear algebra allows the analysis of rotations in space, least squares fitting, ...

Linear programming, sometimes known as linear optimization, is the problem of maximizing or minimizing a linear function over a convex polyhedron specified by linear and ...

The straight line on which all points at infinity lie. The line at infinity is central line L_6 (Kimberling 1998, p. 150), and has trilinear equation aalpha+bbeta+cgamma=0, ...

Logic is the formal mathematical study of the methods, structure, and validity of mathematical deduction and proof. According to Wolfram (2002, p. 860), logic is the most ...

There are several functions called "Lommel functions." One type of Lommel function appear in the solution to the Lommel differential equation and are given by ...