Search Results for ""

The sphere with respect to which inverse points are computed (i.e., with respect to which geometrical inversion is performed). For example, the cyclides are inversions in a ...

The inversive distance is the natural logarithm of the ratio of two concentric circles into which the given circles can be inverted. Let c be the distance between the centers ...

The geometry resulting from the application of the inversion operation. It can be especially powerful for solving apparently difficult problems such as Steiner's porism and ...

The inverted snub dodecadodecahedron is the uniform polyhedron with Maeder index 60 (Maeder 1997), Wenninger index 114 (Wenninger 1989), Coxeter index 76 (Coxeter et al. ...

Admitting an inverse. An object that is invertible is referred to as an invertible element in a monoid or a unit ring, or to a map, which admits an inverse map iff it is ...

An element admitting a multiplicative or additive inverse. In most cases, the choice between these two options is clear from the context, as, for example, in a monoid, where ...

The invertible matrix theorem is a theorem in linear algebra which gives a series of equivalent conditions for an n×n square matrix A to have an inverse. In particular, A is ...

A nonzero module M over a ring R whose only submodules are the module itself and the zero module. It is also called a simple module, and in fact this is the name more ...

The (lower) irredundance number ir(G) of a graph G is the minimum size of a maximal irredundant set of vertices in G. The upper irredundance number is defined as the maximum ...

Let i_k(G) be the number of irredundant sets of size k in a graph G, then the irredundance polynomial R_G(x) of G in the variable x is defined as ...