Search Results for ""

A matchstick graph is a simple graph which has a graph embedding that is planar, for which all distances between vertices have unit distance, and which is non-degenerate (so ...

Roughly speaking, the metric tensor g_(ij) is a function which tells how to compute the distance between any two points in a given space. Its components can be viewed as ...

The Mittag-Leffler function (Mittag-Leffler 1903, 1905) is an entire function defined by the series E_alpha(z)=sum_(k=0)^infty(z^k)/(Gamma(alphak+1)) (1) for alpha>0. It is ...

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 molecular topological index is a graph index defined by MTI=sum_(i=1)^nE_i, where E_i are the components of the vector E=(A+D)d, with A the adjacency matrix, D the graph ...

Multiply all the digits of a number n by each other, repeating with the product until a single digit is obtained. The number of steps required is known as the multiplicative ...

An n-digit number that is the sum of the nth powers of its digits is called an n-narcissistic number. It is also sometimes known as an Armstrong number, perfect digital ...

The Newton-Cotes formulas are an extremely useful and straightforward family of numerical integration techniques. To integrate a function f(x) over some interval [a,b], ...

The odd graph O_n of order n is a graph having vertices given by the (n-1)-subsets of {1,...,2n-1} such that two vertices are connected by an edge iff the associated subsets ...

The Paley graph of order q with q a prime power is a graph on q nodes with two nodes adjacent if their difference is a square in the finite field GF(q). This graph is ...