Search Results for ""

There are several different definition of link. In knot theory, a link is one or more disjointly embedded circles in three-space. More informally, a link is an assembly of ...

Let p(d,a) be the smallest prime in the arithmetic progression {a+kd} for k an integer >0. Let p(d)=maxp(d,a) such that 1<=a<d and (a,d)=1. Then there exists a d_0>=2 and an ...

The Livingstone graph is a distance-transitive graph on 266 vertices defined in terms of the Janko group J_1. It has intersection array {11,10,6,1;1,1,5,11}. The Livingstone ...

The Ljubljana graph is a graph on 112 vertices that is the third smallest cubic semisymmetric graph. It was discovered by Brouwer et al. (1993) and rediscovered by Conder et ...

The term "lobster" is used to refer either to a particular polyiamond or to a class of tree called a lobster graph. When referring to polyiamonds, the lobster is the ...

A graph Gamma is locally Petersen if, for each point t of Gamma, the graph induced by Gamma on all points adjacent to t (i.e., the neighborhood graph) is isomorphic to the ...

For a real number x in (0,1), let m be the number of terms in the convergent to a regular continued fraction that are required to represent n decimal places of x. Then for ...

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

Lucas's theorem states that if n>=3 be a squarefree integer and Phi_n(z) a cyclotomic polynomial, then Phi_n(z)=U_n^2(z)-(-1)^((n-1)/2)nzV_n^2(z), (1) where U_n(z) and V_n(z) ...

The first few numbers not known to produce palindromes when applying the 196-algorithm (i.e., a reverse-then-add sequence) are sometimes known as Lychrel numbers. This term ...