Search Results for ""

A doublecross graph is a graph with graph crossing number 2. The numbers of doublecross simple graphs on n=1 nodes are 0, 0, 0, 0, 0, 1, 39, ..., and the numbers of connected ...

Let C be a smooth geometrically connected projective curve over F_q with q=p^s a prime power. Let infty be a fixed closed point of X but not necessarily F_q-rational. A ...

For any alpha in A (where A denotes the set of algebraic numbers), let |alpha|^_ denote the maximum of moduli of all conjugates of alpha. Then a function ...

The Earth-Moon problem is a special case of the empire problem for countries with m=2 disjoint regions, with one region of each country lying on the Earth and one on the Moon ...

If q_n is the nth prime such that M_(q_n) is a Mersenne prime, then q_n∼(3/2)^n. It was modified by Wagstaff (1983) to yield Wagstaff's conjecture, q_n∼(2^(e^(-gamma)))^n, ...

A number n is called an economical number if the number of digits in the prime factorization of n (including powers) uses fewer digits than the number of digits in n. The ...

The edge count of a graph g, commonly denoted M(g) or E(g) and sometimes also called the edge number, is the number of edges in g. In other words, it is the cardinality of ...

A group action G×X->X is effective if there are no trivial actions. In particular, this means that there is no element of the group (besides the identity element) which does ...

The Egawa graph with parameters (p,s) is a distance-regular but not distance-transitive graph on 16^p4^s nodes. These graphs generalize the Doob graphs and give (s,4)-Hamming ...

The functions E_1(x) = (x^2e^x)/((e^x-1)^2) (1) E_2(x) = x/(e^x-1) (2) E_3(x) = ln(1-e^(-x)) (3) E_4(x) = x/(e^x-1)-ln(1-e^(-x)). (4) E_1(x) has an inflection point at (5) ...