Search Results for ""

A bicubic nonhamiltonian graph is a bicubic (i.e., bipartite cubic graph) that is nonhamiltonian (i.e., that does not possess a Hamiltonian cycle). Tutte (1971) conjectured ...

Given a smooth function f:R^n->R^n, if the Jacobian is invertible at 0, then there is a neighborhood U containing 0 such that f:U->f(U) is a diffeomorphism. That is, there is ...

A function giving the distribution of the interpoint distances of a curve. It is defined by p(r)=1/Nsum_(ij)delta_(r_(ij)=r).

In Season 4 episode "Black Swan" of the television crime drama NUMB3RS, the character Amita Ramanujan refers to graph entropies when studying a map of the Los Angeles while ...

The multiplicative suborder of a number a (mod n) is the least exponent e>0 such that a^e=+/-1 (mod n), or zero if no such e exists. An e always exists if GCD(a,n)=1 and n>1. ...

The odd divisor function sigma_k^((o))(n)=sum_(d|n; d odd)d^k (1) is the sum of kth powers of the odd divisors of a number n. It is the analog of the divisor function for odd ...

An elliptic function with no poles in a fundamental cell is a constant.

A cycle graph of a group is a graph which shows cycles of a group as well as the connectivity between the cycles. Such graphs are constructed by drawing labeled nodes, one ...

A finite simple connected graph G is quadratically embeddable if its quadratic embedding constant QEC(G) is nonpositive, i.e., QEC(G)<=0. A graph being quadratically ...

The two-argument Ramanujan function is defined by phi(a,n) = 1+2sum_(k=1)^(n)1/((ak)^3-ak) (1) = 1-1/a(H_(-1/a)+H_(1/a)+2H_n-H_(n-1/a)-H_(n+1/a)). (2) The one-argument ...