Search Results for ""

Recall the definition of the autocorrelation function C(t) of a function E(t), C(t)=int_(-infty)^inftyE^_(tau)E(t+tau)dtau. (1) Also recall that the Fourier transform of E(t) ...

A method for constructing magic squares of odd order, also called the Siamese method.

A k-matrix is a kind of cube root of the identity matrix (distinct from the identity matrix) which is defined by the complex matrix k=[0 0 -i; i 0 0; 0 1 0]. It satisfies ...

A matchstick graph is a simple graph which has a graph embedding that is planar, for which all distances between vertices have unit distance, and which is non-degenerate (so ...

Unlike quadratic, cubic, and quartic polynomials, the general quintic cannot be solved algebraically in terms of a finite number of additions, subtractions, multiplications, ...

The mathematical study of the likelihood and probability of events occurring based on known information and inferred by taking a limited number of samples. Statistics plays ...

The skeleton of the tesseract, commonly denoted Q_4, is a quartic symmetric graph with girth 4 and diameter 4. The automorphism group of the tesseract is of order 2^7·3=384 ...

In most modern literature, a Boolean model is a probabilistic model of continuum percolation theory characterized by the existence of a stationary point process X and a ...

The lemniscate, also called the lemniscate of Bernoulli, is a polar curve defined as the locus of points such that the the product of distances from two fixed points (-a,0) ...

A random-connection model (RCM) is a graph-theoretic model of continuum percolation theory characterized by the existence of a stationary point process X and a non-increasing ...