Search Results for ""

Given f:X->Y, the image of x is f(x). The preimage of y is then f^(-1)(y)={x|f(x)=y}, or all x whose image is y. Images are elements of the range, while preimages are subsets ...

For any ordinal number alpha, the successor of alpha is alpha union {alpha} (Ciesielski 1997, p. 46). The successor of an ordinal number alpha is therefore the next ordinal, ...

A triangle line lalpha+mbeta+ngamma=0 defined relative to a reference triangle is called a central line iff l:m:n is a triangle center (Kimberling 1998, p. 127). If l:m:n is ...

A contingency table, sometimes called a two-way frequency table, is a tabular mechanism with at least two rows and two columns used in statistics to present categorical data ...

The term "cylinder" has a number of related meanings. In its most general usage, the word "cylinder" refers to a solid bounded by a closed generalized cylinder (a.k.a. ...

Cubic symmetric graphs are sometimes called Foster graphs and denoted F_(nnn)X, where nnn is the vertex count and X is a letter A, B, C, ... indicating the particular such ...

The Steiner circumellipse is the circumellipse that is the isotomic conjugate of the line at infinity and the isogonal conjugate of the Lemoine axis. It has circumconic ...

The truncated Witt graph is the graph on 506 vertices related to a 4-(23,8,4) design (Brouwer et al. 1989, p. 367). It is called the M_(23) graph by van Dam and Haemers ...

A connective in logic which yields true if all conditions are true, and false if any condition is false. A AND B is denoted A ^ B (Mendelson 1997, p. 12), A&B, A intersection ...

An automorphic graph is a distance-transitive graph Gamma for which the automorphism group Aut(Gamma) acts primitively on the vertices of Gamma and is not a complete graph or ...