Search Results for ""

A tree with a finite number of branches at each fork and with a finite number of leaves at the end of each branch is called a finitely branching tree. König's lemma states ...

The case of the Weierstrass elliptic function with invariants g_2=1 and g_3=0. In this case, the half-periods are given by (omega_1,omega_2)=(omega,iomega), where omega is ...

A closed interval corresponding to a finite portion of an infinite line. Line segments are generally labeled with two letters corresponding to their endpoints, say A and B, ...

The Mephisto waltz sequence is defined by beginning with 0 and then iterating the maps 0->001 and 1->110. This gives 0, 001, 001001110, 001001110001001110110110001, ... (OEIS ...

A minimum edge cut of a graph is an edge cut of smallest possible size. The size of a minimum edge cut in a connected graph G is called the graph's edge connectivity ...

Two integers n and m<n are (alpha,beta)-multiamicable if sigma(m)-m=alphan and sigma(n)-n=betam, where sigma(n) is the divisor function and alpha,beta are positive integers. ...

Curves with Cartesian equation ay^2=x(x^2-2bx+c) with a>0. The above equation represents the third class of Newton's classification of cubic curves, which Newton divided into ...

A noble number nu is defined as an irrational number having a continued fraction that becomes an infinite sequence of 1s at some point, nu=[0,a_1,a_2,...,a_n,1^_]. The ...

Two totally ordered sets (A,<=) and (B,<=) are order isomorphic iff there is a bijection f from A to B such that for all a_1,a_2 in A, a_1<=a_2 iff f(a_1)<=f(a_2) (Ciesielski ...

Let (A,<=) and (B,<=) be disjoint totally ordered sets with order types alpha and beta. Then the ordinal sum is defined at set (C=A union B,<=) where, if c_1 and c_2 are both ...