Search Results for ""

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

The concept of irredundance was introduced by Cockayne et al. (1978). Let N_G[v] denote the graph neighborhood of a vertex v in a graph G (including v itself), and let N_G[S] ...

Isomorphic factorization colors the edges a given graph G with k colors so that the colored subgraphs are isomorphic. The graph G is then k-splittable, with k as the divisor, ...

There are at least three theorems known as Jensen's theorem. The first states that, for a fixed vector v=(v_1,...,v_m), the function |v|_p=(sum_(i=1)^m|v_i|^p)^(1/p) is a ...

A the (first, or internal) Kenmotu point, also called the congruent squares point, is the triangle center constructed by inscribing three equal squares such that each square ...

A Kirkman triple system of order v=6n+3 is a Steiner triple system with parallelism (Ball and Coxeter 1987), i.e., one with the following additional stipulation: the set of ...

Lauricella functions are generalizations of the Gauss hypergeometric functions to multiple variables. Four such generalizations were investigated by Lauricella (1893), and ...

The term "(a,b)-leaper" (sometimes explicitly called a "single-pattern leaper") describes a fairy chess piece such as a knight that may make moves which simultaneously change ...

Given a unit line segment [0,1], pick two points at random on it. Call the first point x_1 and the second point x_2. Find the distribution of distances d between points. The ...

A merge sort (or collation sort) is the combination of two or more ordered lists into a single ordered list (Knuth 1998, p. 158). Merge sorting was one of the first methods ...