Search Results for ""

A statistic w on the symmetric group S_n is called a weighted inversion statistic if there exists an upper triangular matrix W=(w_(ij)) such that ...

The Yff contact triangle DeltaX_AX_BX_C (a term coined here for the first time), is the Cevian triangle of Kimberling center X_(190). It is the polar triangle of the Yff ...

Let a random n×n (0,1)-matrix have entries which are 1 (with probability p) or 0 (with probability q=1-p) and numbers are assigned to the edges of a grid. A b-cluster is an ...

The Mertens function is the summary function M(n)=sum_(k=1)^nmu(k), (1) where mu(n) is the Möbius function (Mertens 1897; Havil 2003, p. 208). The first few values are 1, 0, ...

Given a point with trilinear coordinates P=alpha:beta:gamma, the anticevian triangle DeltaA^'B^'C^' of a triangle DeltaABC with respect to P is a triangle such that 1. B^'C^' ...

The antipedal triangle DeltaA^'B^'C^' of a reference triangle DeltaABC with respect to a given point P is the triangle of which DeltaABC is the pedal triangle with respect to ...

Let {a_i}_(i=0)^(N-1) be a periodic sequence, then the autocorrelation of the sequence, sometimes called the periodic autocorrelation (Zwillinger 1995, p. 223), is the ...

Given a point P and a triangle DeltaABC, the Cevian triangle DeltaA^'B^'C^' is defined as the triangle composed of the endpoints of the cevians though the Cevian point P. A ...

Let the circles c_2 and c_3^' used in the construction of the Brocard points which are tangent to A_2A_3 at A_2 and A_3, respectively, meet again at D_A. The points D_AD_BD_C ...

A graph in which each graph edge is replaced by a directed graph edge, also called a digraph. A directed graph having no multiple edges or loops (corresponding to a binary ...