Search Results for ""

A linear functional defined on a subspace of a vector space V and which is dominated by a sublinear function defined on V has a linear extension which is also dominated by ...

Define F(1)=1 and S(1)=2 and write F(n)=F(n-1)+S(n-1), where the sequence {S(n)} consists of those integers not already contained in {F(n)}. For example, F(2)=F(1)+S(1)=3, so ...

The pair of sequences defined by F(0)=1, M(0)=0, and F(n) = n-M(F(n-1)) (1) M(n) = n-F(M(n-1)). (2) The first few terms of the "male" sequence M(n) for n=0, 1, ... are 0, 0, ...

The bifurcation of a fixed point to a limit cycle (Tabor 1989).

The Janko-Kharaghani graphs are two strongly regular graph on 936 and 1800 vertices. They have regular parameters (nu,k,lambda,mu)=(936,375,150,150) and (1800,1029,588,588), ...

If mu is a real measure (i.e., a measure that takes on real values), then one can decompose it according to where it is positive and negative. The positive variation is ...

An algorithm in control theory introduced by Kalman (1960) and refined by Kalman and Bucy (1961). It is an algorithm which makes optimal use of imprecise data on a linear (or ...

Let [a_0;a_1,a_2,...] be the simple continued fraction of a "generic" real number, where the numbers a_i are the partial quotients. Then the Khinchin (or Khintchine) harmonic ...

For n>=1, let u and v be integers with u>v>0 such that the Euclidean algorithm applied to u and v requires exactly n division steps and such that u is as small as possible ...

Let pi_n(x)=product_(k=0)^n(x-x_k), (1) then f(x)=f_0+sum_(k=1)^npi_(k-1)(x)[x_0,x_1,...,x_k]+R_n, (2) where [x_1,...] is a divided difference, and the remainder is ...