Search Results for ""

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

Jordan's lemma shows the value of the integral I=int_(-infty)^inftyf(x)e^(iax)dx (1) along the infinite upper semicircle and with a>0 is 0 for "nice" functions which satisfy ...

The Jørgensen graph is a maximally linklessly embeddable graph on 8 vertices and 21 edges, where "maximal" means it is not a proper subgraph of another linklessly embeddable ...

The German mathematician Kronecker proved that all the Galois extensions of the rationals Q with Abelian Galois groups are subfields of cyclotomic fields Q(mu_n), where mu_n ...

For positive integer n, the K-function is defined by K(n) = 1^12^23^3...(n-1)^(n-1) (1) = H(n-1), (2) where the numbers H(n)=K(n+1) are called hyperfactorials by Sloane and ...

The expected number of real zeros E_n of a random polynomial of degree n if the coefficients are independent and distributed normally is given by E_n = ...

The so-called generalized Kadomtsev-Petviashvili-Burgers equation is the partial differential equation ...

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

x_(n+1) = 2x_n (1) y_(n+1) = alphay_n+cos(4pix_n), (2) where x_n, y_n are computed mod 1 (Kaplan and Yorke 1979). The Kaplan-Yorke map with alpha=0.2 has correlation exponent ...