Search Results for ""

A noneulerian graph is a graph that is not Eulerian. The numbers of simple noneulerian graphs on n=1, 2, ... nodes are 2, 3, 10, 30, 148, 1007, 12162, 272886, ... (OEIS ...

Consider the decimal expansion of the reciprocal of the number seven, 1/7=0.142857142857...=0.142857^_, (1) which is a repeating decimal. Now take overlapping pairs of these ...

A perfect ruler also called a complete ruler, is type of ruler considered by Guy (1994) which has k distinct marks spaced such that the distances between marks can be used to ...

Let a>|b|, and write h(theta)=(acostheta+b)/(2sintheta). (1) Then define P_n(x;a,b) by the generating function f(x,w)=f(costheta,w)=sum_(n=0)^inftyP_n(x;a,b)w^n ...

A pseudotree is a connected pseudoforest, i.e., an undirected connected graph that contains at most one graph cycle. Connected acyclic graphs (i.e., trees), are therefore ...

A solvable Lie group is a Lie group G which is connected and whose Lie algebra g is a solvable Lie algebra. That is, the Lie algebra commutator series ...

Given a ring R with identity, the special linear group SL_n(R) is the group of n×n matrices with elements in R and determinant 1. The special linear group SL_n(q), where q is ...

The special unitary group SU_n(q) is the set of n×n unitary matrices with determinant +1 (having n^2-1 independent parameters). SU(2) is homeomorphic with the orthogonal ...

A species of structures is a rule F which 1. Produces, for each finite set U, a finite set F[U], 2. Produces, for each bijection sigma:U->V, a function F[sigma]:F[U]->F[V]. ...

Color each segment of a knot diagram using one of three colors. If 1. At any crossing, either the colors are all different or all the same, and 2. At least two colors are ...