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

A number n is called k-hyperperfect if n = 1+ksum_(i)d_i (1) = 1+k[sigma(n)-n-1], (2) where sigma(n) is the divisor function and the summation is over the proper divisors ...

An identity graph, sometimes also known as an asymmetric graph or rigid graph (Albertson and Collins 1996), is a graph possessing a single graph automorphism. The numbers of ...

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

Two sets A and B are said to be independent if their intersection A intersection B=emptyset, where emptyset is the empty set. For example, {A,B,C} and {D,E} are independent, ...

A statistic which assigns a single number to several individual statistics in order to quantify trends. The best-known index in the United States is the consumer price index, ...

A set-theoretic term having a number of different meanings. Fraenkel (1953, p. 37) used the term as a synonym for "finite set." However, according to Russell's definition ...

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

A d-dimensional discrete percolation model is said to be inhomogeneous if different graph edges (in the case of bond percolation models) or vertices (in the case of site ...

If the square is instead erected internally, their centers form a triangle DeltaI_AI_BI_C that has (exact) trilinear vertex matrix given by (1) (E. Weisstein, Apr. 25, 2004). ...