Search Results for ""

Given a sequence of values {a_k}_(k=1)^n, the high-water marks are the values at which the running maximum increases. For example, given a sequence (3,5,7,8,8,5,7,9,2,5) with ...

The Hochberg-O'Donnell fish graph is the unit-distance graph on 23 nodes and 42 edges illustrated above. It is triangle-free and is the smallest example of a unit-distance ...

The 34 distinct convergent hypergeometric series of order two enumerated by Horn (1931) and corrected by Borngässer (1933). There are 14 complete series for which ...

The hyperbolic secant is defined as sechz = 1/(coshz) (1) = 2/(e^z+e^(-z)), (2) where coshz is the hyperbolic cosine. It is implemented in the Wolfram Language as Sech[z]. On ...

An imperfect graph G is a graph that is not perfect. Therefore, graphs G with omega(G)<chi(G) (1) where omega(G) is the clique number and chi(G) is the chromatic number are ...

An inellipse inconic that is an ellipse. The locus of the centers of the ellipses inscribed in a triangle is the interior of the medial triangle. Newton gave the solution to ...

The infimum is the greatest lower bound of a set S, defined as a quantity m such that no member of the set is less than m, but if epsilon is any positive quantity, however ...

An integral embedding of a graph, not to be confused with an integral graph, is a graph drawn such that vertices are distinct points and all graph edges have integer lengths. ...

Integration by parts is a technique for performing indefinite integration intudv or definite integration int_a^budv by expanding the differential of a product of functions ...

Solving the nome q for the parameter m gives m(q) = (theta_2^4(q))/(theta_3^4(q)) (1) = (16eta^8(1/2tau)eta^(16)(2tau))/(eta^(24)(tau)), (2) where theta_i(q)=theta_i(0,q) is ...