Search Results for ""

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 ...

The set containing no elements, commonly denoted emptyset or emptyset, the former of which is used in this work. These correspond to Wolfram Language and TeX characters ...

1 0 1 0 1 1 0 1 2 2 0 2 4 5 5 (1) The Entringer numbers E(n,k) (OEIS A008281) are the number of permutations of {1,2,...,n+1}, starting with k+1, which, after initially ...

A Euclidean number is a number which can be obtained by repeatedly solving the quadratic equation. Euclidean numbers, together with the rational numbers, can be constructed ...

For |z|<1, product_(k=1)^infty(1+z^k)=product_(k=1)^infty(1-z^(2k-1))^(-1). (1) Both of these have closed form representation 1/2(-1;z)_infty, (2) where (a;q)_infty is a ...

A extension ring (or ring extension) of a ring R is any ring S of which R is a subring. For example, the field of rational numbers Q and the ring of Gaussian integers Z[i] ...

Euler (1738, 1753) considered the series s_a(x)=sum_(n=1)^infty[1/(1-a^n)product_(k=0)^(n-1)(1-xa^(-k))]. He showed that just like log_a(a^n)=n, s_a(a^n)=n for nonnegative ...

The Fibonacci factorial constant is the constant appearing in the asymptotic growth of the fibonorials (aka. Fibonacci factorials) n!_F. It is given by the infinite product ...

Let M^n be an n-manifold and let F={F_alpha} denote a partition of M^n into disjoint pathwise-connected subsets. Then F is called a foliation of M^n of codimension c (with ...

Let (Omega)_(ij) be the resistance distance matrix of a connected graph G on n nodes. Then Foster's theorems state that sum_((i,j) in E(G)))Omega_(ij)=n-1, where E(g) is the ...