Search Results for ""

Let G be an undirected graph, and let i denote the cardinal number of the set of externally active edges of a spanning tree T of G, j denote the cardinal number of the set of ...

A graph G is said to be locally X, where X is a graph (or class of graphs), when for every vertex v, the graph induced on G by the set of adjacent vertices of V (sometimes ...

It is possible to perform multiplication of large numbers in (many) fewer operations than the usual brute-force technique of "long multiplication." As discovered by Karatsuba ...

Let X be an arbitrary topological space. Denote the set closure of a subset A of X by A^- and the complement of A by A^'. Then at most 14 different sets can be derived from A ...

The partial differential equation u_t+u_(xxx)-6uu_x=0 (1) (Lamb 1980; Zwillinger 1997, p. 175), often abbreviated "KdV." This is a nondimensionalized version of the equation ...

In this work, the name Pythagoras's constant will be given to the square root of 2, sqrt(2)=1.4142135623... (1) (OEIS A002193), which the Pythagoreans proved to be ...

The signed Stirling numbers of the first kind are variously denoted s(n,m) (Riordan 1980, Roman 1984), S_n^((m)) (Fort 1948, Abramowitz and Stegun 1972), S_n^m (Jordan 1950). ...

The number of ways of partitioning a set of n elements into m nonempty sets (i.e., m set blocks), also called a Stirling set number. For example, the set {1,2,3} can be ...

Let s(n)=sigma(n)-n, where sigma(n) is the divisor function and s(n) is the restricted divisor function. Then the sequence of numbers s^0(n)=n,s^1(n)=s(n),s^2(n)=s(s(n)),... ...

Analytic number theory is the branch of number theory which uses real and complex analysis to investigate various properties of integers and prime numbers. Examples of topics ...