Search Results for ""

A linear transformation between two vector spaces V and W is a map T:V->W such that the following hold: 1. T(v_1+v_2)=T(v_1)+T(v_2) for any vectors v_1 and v_2 in V, and 2. ...

Li's criterion states that the Riemann hypothesis is equivalent to the statement that, for lambda_n=1/((n-1)!)(d^n)/(ds^n)[s^(n-1)lnxi(s)]|_(s=1), (1) where xi(s) is the ...

Lissajous curves are the family of curves described by the parametric equations x(t) = Acos(omega_xt-delta_x) (1) y(t) = Bcos(omega_yt-delta_y), (2) sometimes also written in ...

Also called Radau quadrature (Chandrasekhar 1960). A Gaussian quadrature with weighting function W(x)=1 in which the endpoints of the interval [-1,1] are included in a total ...

Let L=(L, ^ , v ) be a lattice, and let f,g:L->L. Then the pair (f,g) is a local polarity if and only if for each finite set X subset= L, there is a finitely generated ...

An operation on rings and modules. Given a commutative unit ring R, and a subset S of R, closed under multiplication, such that 1 in S, and 0 not in S, the localization of R ...

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

The logistic equation (sometimes called the Verhulst model or logistic growth curve) is a model of population growth first published by Pierre Verhulst (1845, 1847). The ...

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 lower independence number i(G) of a graph G is the minimum size of a maximal independent vertex set in G. The lower indepedence number is equiavlent to the "independent ...