Search Results for ""

Let X be an infinite set of urelements, and let V(^*X) be an enlargement of V(X). Let H in V(^*X) be an algebra. Then H is hyperfinitely generated provided that it has a ...

The impossible fork (Seckel 2002, p. 151), also known as the devil's pitchfork (Singmaster), blivet, or poiuyt, is a classic impossible figure originally due to Schuster ...

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

If two points A and A^' are inverse with respect to a circle (the inversion circle), then the straight line through A^' which is perpendicular to the line of the points AA^' ...

The Jordan matrix decomposition is the decomposition of a square matrix M into the form M=SJS^(-1), (1) where M and J are similar matrices, J is a matrix of Jordan canonical ...

A goodness-of-fit test for any statistical distribution. The test relies on the fact that the value of the sample cumulative density function is asymptotically normally ...

Let (a)_i and (b)_i be sequences of complex numbers such that b_j!=b_k for j!=k, and let the lower triangular matrices F=(f)_(nk) and G=(g)_(nk) be defined as ...

The large Witt graph, also called the octad graph (Brouwer) or Witt graph (DistanceRegular.org), is the graph whose vertices are the 759 blocks of a Steiner system S(5,8,24) ...

A lattice-ordered set is a poset (L,<=) in which each two-element subset {a,b} has an infimum, denoted inf{a,b}, and a supremum, denoted sup{a,b}. There is a natural ...

An algebra <L; ^ , v > is called a lattice if L is a nonempty set, ^ and v are binary operations on L, both ^ and v are idempotent, commutative, and associative, and they ...