Search Results for ""

The unique 8_3 configuration. It is transitive and self-dual, but cannot be realized in the real projective plane. Its Levi graph is the Möbius-Kantor graph.

Let a in C and |a|<1, then phi_a(z)=(z-a)/(1-a^_z) is a Möbius transformation, where a^_ is the complex conjugate of a. phi_a is a conformal mapping self-map of the unit disk ...

A Mongolian tent graph is defined as the graph obtained from the grid graph P_m square P_n for odd n by adding an extra vertex above the graph and joining every other vertex ...

If f(z) is continuous in a region D and satisfies ∮_gammafdz=0 for all closed contours gamma in D, then f(z) is analytic in D. Morera's theorem does not require simple ...

An algebraic loop L is a Moufang loop if all triples of elements x, y, and z in L satisfy the Moufang identities, i.e., if 1. z(x(zy))=((zx)z)y, 2. x(z(yz))=((xz)y)z, 3. ...

A multidimensional point process is a measurable function from a probability space (Omega,A,P) into (X,Sigma) where X is the set of all finite or countable subsets of R^d not ...

An N-cluster is a point lattice configuration in which the distance between every pair of points is an integer, no three points are collinear, and no four points are ...

Consider a power series in a complex variable z g(z)=sum_(n=0)^inftya_nz^n (1) that is convergent within the open disk D:|z|<R. Convergence is limited to within D by the ...

The Nechushtan graph, illustrated above, is a 10-vertex 5-chromatic graph that is unit-distance in 3 dimensions. It was used by Nechushtan (2002) in the construction of of a ...

The Nørlund polynomial (note that the spelling Nörlund also appears in various publications) is a name given by Carlitz (1960) and Adelberg (1997) to the polynomial ...