Search Results for ""

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 identity matrix is a the simplest nontrivial diagonal matrix, defined such that I(X)=X (1) for all vectors X. An identity matrix may be denoted 1, I, E (the latter being ...

A class of illusion in which an object which is physically unrealizable is apparently depicted. More than 100 papers have been written about impossible figures (Kulpa 1987), ...

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 term "indeterminate" is sometimes used as a synonym for unknown or variable (Becker and Weispfenning 1993, p. 188). A mathematical expression can also be said to be ...

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

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

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

Let P(z) and Q(z) be univariate polynomials in a complex variable z, and let the polynomial degrees of P and Q satisfy deg(Q)>=deg(P+2). Then int_gamma(P(z))/(Q(z))dz = ...