Search Results for ""

The problem of finding the strategy to guarantee reaching the boundary of a given region ("forest") in the shortest distance (i.e., a strategy having the best worst-case ...

The Lotka-Volterra equations describe an ecological predator-prey (or parasite-host) model which assumes that, for a set of fixed positive constants A (the growth rate of ...

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 integral transform (Kf)(x)=int_0^infty((x-t)_+^(c-1))/(Gamma(c))_2F_1(a,b;c;1-t/x)f(t)dt, where Gamma(x) is the gamma function, _2F_1(a,b;c;z) is a hypergeometric ...

The Fredholm integral equation of the second kind f(x)=1+1/piint_(-1)^1(f(t))/((x-t)^2+1)dt that arises in electrostatics (Love 1949, Fox and Goodwin 1953, and Abbott 2002).

Low-dimensional topology usually deals with objects that are two-, three-, or four-dimensional in nature. Properly speaking, low-dimensional topology should be part of ...

The lower-trimmed subsequence of x={x_n} is the sequence V(x) obtained by subtracting 1 from each x_n and then removing all 0s. If x is a fractal sequence, then V(x) is a ...

A function f is said to have a lower bound c if c<=f(x) for all x in its domain. The greatest lower bound is called the infimum.

The lower clique number omega_L(G) of a graph G may be defined as the size of a smallest maximal clique in a graph G. It therefore corresponds to the coefficient of the ...