Search Results for ""

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

Suppose x_1<x_2<...<x_n are given positive numbers. Let lambda_1, ..., lambda_n>=0 and sum_(j=1)^(n)lambda_j=1. Then ...

A curve also known as Gutschoven's curve which was first studied by G. van Gutschoven around 1662 (MacTutor Archive). It was also studied by Newton and, some years later, by ...

Consider an n-digit number k. Square it and add the right n digits to the left n or n-1 digits. If the resultant sum is k, then k is called a Kaprekar number. For example, 9 ...

A Kapteyn series is a series of the form sum_(n=0)^inftyalpha_nJ_(nu+n)[(nu+n)z], (1) where J_n(z) is a Bessel function of the first kind. Examples include Kapteyn's original ...

A katadrome is a number whose hexadecimal digits are in strict descending order. The first few are 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 32, 33, 48, 49, ... ...

Find the minimum number f(n) of subsets in a separating family for a set of n elements, where a separating family is a set of subsets in which each pair of adjacent elements ...

A semi-oriented 2-variable knot polynomial defined by F_L(a,z)=a^(-w(L))<|L|>, (1) where L is an oriented link diagram, w(L) is the writhe of L, |L| is the unoriented diagram ...

The Kauffman X-polynomial, also called the normalized bracket polynomial, is a 1-variable knot polynomial denoted X (Adams 1994, p. 153), L (Kauffman 1991, p. 33), or F ...

The kei_nu(z) function is defined as the imaginary part of e^(-nupii/2)K_nu(ze^(pii/4))=ker_nu(z)+ikei_nu(z), (1) where K_nu(z) is a modified Bessel function of the second ...