Search Results for ""

A modified set of Chebyshev polynomials defined by a slightly different generating function. They arise in the development of four-dimensional spherical harmonics in angular ...

The Grötzsch graph is smallest triangle-free graph with chromatic number four. It is identical to the Mycielski graph of order four, and is implemented as ...

The Jack polynomials are a family of multivariate orthogonal polynomials dependent on a positive parameter alpha. Orthogonality of the Jack polynomials is proved in Macdonald ...

A partial differential equation (PDE) is an equation involving functions and their partial derivatives; for example, the wave equation ...

A random-connection model (RCM) is a graph-theoretic model of continuum percolation theory characterized by the existence of a stationary point process X and a non-increasing ...

Regge calculus is a finite element method utilized in numerical relativity in attempts of describing spacetimes with few or no symmetries by way of producing numerical ...

A knot diagram which has alternating under- and overcrossings as the knot projection is traversed. The first knot which does not have an alternating diagram has 8 crossings.

A directed graph is called an arborescence if, from a given node x known as the root vertex, there is exactly one elementary path from x to every other node y.

There exists a total computable predicate P such that for any algorithm computing P(x) with running time T(x), there exists another algorithm computing P(x) with computation ...

A numerical knot invariant. For a tame knot K, the bridge index is the least bridge number of all planar representations of the knot. The bridge index of the unknot is ...