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

A link invariant defined for a two-component oriented link as the sum of +1 crossings and -1 crossing over all crossings between the two links divided by 2. For components ...

A linklessly embeddable graph is a graph having the property that there exists an embedding in three dimensions that does not contain a nontrivial link. A graph is linklessly ...

Linnik's constant L is the constant appearing in Linnik's theorem. Heath-Brown (1992) has shown that L<=5.5, and Schinzel, Sierpiński, and Kanold (Ribenboim 1989) have ...

A lion and a man in a closed arena have equal maximum speeds. What tactics should the lion employ to be sure of his meal? This problem was stated by Rado in 1925 (Littlewood ...

The second-order ordinary differential equation y^('')+g(y)y^('2)+f(x)y^'=0 (1) is called Liouville's equation (Goldstein and Braun 1973; Zwillinger 1997, p. 124), as are the ...

The Littlewood conjecture states that for any two real numbers x,y in R, lim inf_(n->infty)n|nx-nint(nx)||ny-nint(ny)|=0 where nint(z) denotes the nearest integer function. ...

Let L be a lattice (or a bounded lattice or a complemented lattice, etc.), and let C_L be the covering relation of L: C_L={(x,y) in L^2|x covers y or y covers x}. Then C_L is ...

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

A path, also known as a rhumb line, which cuts a meridian on a given surface at any constant angle but a right angle. If the surface is a sphere, the loxodrome is a spherical ...