Search Results for ""

P(n), sometimes also denoted p(n) (Abramowitz and Stegun 1972, p. 825; Comtet 1974, p. 94; Hardy and Wright 1979, p. 273; Conway and Guy 1996, p. 94; Andrews 1998, p. 1), ...

When the index nu is real, the functions J_nu(z), J_nu^'(z), Y_nu(z), and Y_nu^'(z) each have an infinite number of real zeros, all of which are simple with the possible ...

Given two positive integers n and k, the bipartite Kneser graph H(n,k) is the graph whose two bipartite sets of vertices represent the k-subsets and (n-k)-subsets of ...

A camel graph is a graph formed by all possible moves of a hypothetical chess piece called a "camel" which moves analogously to a knight except that it is restricted to moves ...

An equation is said to be a closed-form solution if it solves a given problem in terms of functions and mathematical operations from a given generally-accepted set. For ...

A plot of the map winding number W resulting from mode locking as a function of Omega for the circle map theta_(n+1)=theta_n+Omega-K/(2pi)sin(2pitheta_n) (1) with K=1. (Since ...

A set of m distinct positive integers S={a_1,...,a_m} satisfies the Diophantus property D(n) of order n (a positive integer) if, for all i,j=1, ..., m with i!=j, ...

A distance-heredity graph, also known as a completely separable graph, is a graph G such that the distance matrix of every connected vertex-induced subgraph G_V of G is the ...

The Eisenstein integers, sometimes also called the Eisenstein-Jacobi integers (Finch 2003, p. 601), are numbers of the form a+bomega, where a and b are normal integers, ...

A fiber bundle (also called simply a bundle) with fiber F is a map f:E->B where E is called the total space of the fiber bundle and B the base space of the fiber bundle. The ...