Search Results for ""

Define q=e^(2piitau) (cf. the usual nome), where tau is in the upper half-plane. Then the modular discriminant is defined by ...

The moth graph is the 6-vertex graph illustrated above. It is implemented in the Wolfram Language as GraphData["MothGraph"].

Multiple edges are two or more edges connecting the same two vertices within a multigraph. Multiple edges of degree d_(ij) between vertex i and vertex j correspond to an ...

A problem is assigned to the NP (nondeterministic polynomial time) class if it is solvable in polynomial time by a nondeterministic Turing machine. A P-problem (whose ...

Given a curve C and O=(x_0,y_0) a fixed point called the pedal point, then for a point P on C, draw a line perpendicular to OP. The envelope of these lines as P describes the ...

Let G be a simple graph with nonsingular (0,1) adjacency matrix A. If all the diagonal entries of the matrix inverse A^(-1) are zero and all the off-diagonal entries of ...

If T is a linear transformation of R^n, then the null space Null(T), also called the kernel Ker(T), is the set of all vectors X such that T(X)=0, i.e., Null(T)={X:T(X)=0}. ...

A connective in logic which yields true if any one of a sequence conditions is true, and false if all conditions are false. In formal logic, the term disjunction (or, more ...

A "squashed" spheroid for which the equatorial radius a is greater than the polar radius c, so a>c (called an oblate ellipsoid by Tietze 1965, p. 27). An oblate spheroid is a ...

The octahedral equation, by way of analogy with the icosahedral equation, is a set of related equations derived from the projective geometry of the octahedron. Consider an ...