Search Results for ""

Let L denote the partition lattice of the set {1,2,...,n}. The maximum element of L is M={{1,2,...,n}} (1) and the minimum element is m={{1},{2},...,{n}}. (2) Let Z_n denote ...

A Lindenmayer system, also known as an L-system, is a string rewriting system that can be used to generate fractals with dimension between 1 and 2. Several example fractals ...

A lobster graph, lobster tree, or simply "lobster," is a tree having the property that the removal of leaf nodes leaves a caterpillar graph (Gallian 2007). The numbers of ...

The local McLaughlin graph is the graph on 162 vertices and 4536 edges obtained from the McLaughlin graph by vertex deletion of a single vertex and its neighbors, making it ...

The longest increasing (contiguous) subsequence of a given sequence is the subsequence of increasing terms containing the largest number of elements. For example, the longest ...

The longest path problem asks to find a path of maximum length in a given graph. The problem is NP-complete, but there exists an efficient dynamic programming solution for ...

The term "loop" has a number of meanings in mathematics. Most simply, a loop is a closed curve whose initial and final points coincide in a fixed point p known as the ...

A Lucas polynomial sequence is a pair of generalized polynomials which generalize the Lucas sequence to polynomials is given by W_n^k(x) = ...

An n-step Lucas sequence {L_k^((n))}_(k=1)^infty is defined by letting L_k^((n))=-1 for k<0, L_0^((n))=n, and other terms according to the linear recurrence equation ...

A set of n magic circles is a numbering of the intersections of the n circles such that the sum over all intersections is the same constant for all circles. The above sets of ...