Search Results for ""

The incenter I is the center of the incircle for a polygon or insphere for a polyhedron (when they exist). The corresponding radius of the incircle or insphere is known as ...

If replacing each number by its square in a magic square produces another magic square, the square is said to be a bimagic square. Bimagic squares are also called doubly ...

A lossless data compression algorithm which uses a small number of bits to encode common characters. Huffman coding approximates the probability for each character as a power ...

The Kermack-McKendrick model is an SIR model for the number of people infected with a contagious illness in a closed population over time. It was proposed to explain the ...

The sum of the values of an integral of the "first" or "second" sort int_(x_0,y_0)^(x_1,y_1)(Pdx)/Q+...+int_(x_0,y_0)^(x_N,y_N)(Pdx)/Q=F(z) and ...

The vertex height of a vertex v in a rooted tree is the number of edges on the longest downward path between v and a tree leaf. The height of the root vertex of a rooted tree ...

Schmidt (1993) proposed the problem of determining if for any integer r>=2, the sequence of numbers {c_k^((r))}_(k=1)^infty defined by the binomial sums sum_(k=0)^n(n; ...

If k|n, then the complete k-uniform hypergraph on n vertices decomposes into 1-factors, where a 1-factor is a set of n/k pairwise disjoint k-sets. Brouwer and Schrijver ...

Let A be an n×n real square matrix with n>=2 such that |sum_(i=1)^nsum_(j=1)^na_(ij)s_it_j|<=1 (1) for all real numbers s_1, s_2, ..., s_n and t_1, t_2, ..., t_n such that ...

An algorithm which finds a polynomial recurrence for terminating hypergeometric identities of the form sum_(k)(n; ...