Search Results for ""

An apodization function chosen to minimize the height of the highest sidelobe (Hamming and Tukey 1949, Blackman and Tukey 1959). The Hamming function is given by ...

The case of the Weierstrass elliptic function with invariants g_2=1 and g_3=0. In this case, the half-periods are given by (omega_1,omega_2)=(omega,iomega), where omega is ...

Consider a game where everyone in a classroom picks a number between 0 and 100. The person closest to half the average wins. Obviously, picking a number over 50 would be ...

In 1979, Conway and Norton discovered an unexpected intimate connection between the monster group M and the j-function. The Fourier expansion of j(tau) is given by (1) (OEIS ...

An n-he (a term coined by Brendan Owen) is a shape formed from a polyhex by removing half of each hexagon in such a way that the remaining pieces are connected (Clarke). The ...

The Randić matrix A_(Randic) of a simple graph is a weighted adjacency matrix with weight f(d_i,d_j)=1/(sqrt(d_id_j)), (1) where d_i are the vertex degrees of the graph. In ...

By a suitable rearrangement of terms, a conditionally convergent series may be made to converge to any desired value, or to diverge. For example, S = 1-1/2+1/3-1/4+1/5+... ...

A right angle is an angle equal to half the angle from one end of a line segment to the other. A right angle is pi/2 radians or 90 degrees. A triangle containing a right ...

Guy's "strong law of small numbers" states that there aren't enough small numbers to meet the many demands made of them. Guy (1988) also gives several interesting and ...

The Sombor matrix A_(Sombor) of a simple graph is a weighted adjacency matrix with weight f(d_i,d_j)=sqrt(d_i^2+d_j^2), (1) where d_i are the vertex degrees of the graph. In ...