Search Results for ""

The Lovász number theta(G) of a graph G, sometimes also called the theta function of G, was introduced by Lovász (1979) with the explicit goal of estimating the Shannon ...

Let alpha(G) denote the independence number of a graph G. Then the Shannon capacity Theta(G), sometimes also denoted c(G), of G is defined as ...

Simply stated, floating-point arithmetic is arithmetic performed on floating-point representations by any number of automated devices. Traditionally, this definition is ...

Let p_n/q_n be the sequence of convergents of the continued fraction of a number alpha. Then a Brjuno number is an irrational number such that ...

A positive integer: 1, 2, 3, 4, ... (OEIS A000027), also called a natural number. However, zero (0) is sometimes also included in the list of counting numbers. Due to lack of ...

The Erdős number is the number of "hops" needed to connect the author of a paper with the prolific late mathematician Paul Erdős. An author's Erdős number is 1 if he has ...

A generalization of the Fibonacci numbers defined by 1=G_1=G_2=...=G_(c-1) and the recurrence relation G_n=G_(n-1)+G_(n-c). (1) These are the sums of elements on successive ...

n divides a^n-a for all integers a iff n is squarefree and (p-1)|(n-1) for all prime divisors p of n. Carmichael numbers satisfy this criterion.

A factor of a polynomial P(x) of degree n is a polynomial Q(x) of degree less than n which can be multiplied by another polynomial R(x) of degree less than n to yield P(x), ...

Let S_N(s)=sum_(n=1)^infty[(n^(1/N))]^(-s), (1) where [x] denotes nearest integer function, i.e., the integer closest to x. For s>3, S_2(s) = 2zeta(s-1) (2) S_3(s) = ...