Search Results for ""

A symmetric graph is a graph that is both edge- and vertex-transitive (Holton and Sheehan 1993, p. 209). However, care must be taken with this definition since arc-transitive ...

The cubical graph is the Platonic graph corresponding to the connectivity of the cube. It is isomorphic to the generalized Petersen graph GP(4,1), bipartite Kneser graph ...

A unit-distance graph is a distance graph having an embedding in the Euclidean plane (unit-distance embedding) in which vertices are distinct points and all edges are of ...

Consider the probability Q_1(n,d) that no two people out of a group of n will have matching birthdays out of d equally possible birthdays. Start with an arbitrary person's ...

A polynomial given by Phi_n(x)=product_(k=1)^n^'(x-zeta_k), (1) where zeta_k are the roots of unity in C given by zeta_k=e^(2piik/n) (2) and k runs over integers relatively ...

There are many mathematical and recreational problems related to folding. Origami, the Japanese art of paper folding, is one well-known example. It is possible to make a ...

In his last letter to Hardy, Ramanujan defined 17 Jacobi theta function-like functions F(q) with |q|<1 which he called "mock theta functions" (Watson 1936ab, Ramanujan 1988, ...

The sinc function sinc(x), also called the "sampling function," is a function that arises frequently in signal processing and the theory of Fourier transforms. The full name ...

The sine function sinx is one of the basic functions encountered in trigonometry (the others being the cosecant, cosine, cotangent, secant, and tangent). Let theta be an ...

A number is said to be squarefree (or sometimes quadratfrei; Shanks 1993) if its prime decomposition contains no repeated factors. All primes are therefore trivially ...