Search Results for ""

The word net has several meanings in mathematics. It refers to a plane diagram in which the polyhedron edges of a polyhedron are shown, a point set satisfying certain ...

The Bailey mod 9 identities are a set of three Rogers-Ramanujan-like identities appearing as equations (1.6), (1.8), and (1.7) on p. 422 of Bailey (1947) given by A(q) = ...

Suppose A and B are candidates for office and there are 2n voters, n voting for A and n for B. In how many ways can the ballots be counted so that B is never ahead of A? The ...

A band over a fixed topological space X is represented by a cover X= union U_alpha, U_alpha subset= X, and for each alpha, a sheaf of groups K_alpha on U_alpha along with ...

The simple continued fraction representations for Catalan's constant K is [0, 1, 10, 1, 8, 1, 88, 4, 1, 1, ...] (OEIS A014538). A plot of the first 256 terms of the continued ...

While many computations admit shortcuts that allow them to be performed more rapidly, others cannot be sped up. Computations that cannot be sped up by means of any shortcut ...

A covariant tensor, denoted with a lowered index (e.g., a_mu) is a tensor having specific transformation properties. In general, these transformation properties differ from ...

The detour matrix Delta, sometimes also called the maximum path matrix or maximal topological distances matrix, of a graph is a symmetric matrix whose (i,j)th entry is the ...

The detour polynomial of a graph G is the characteristic polynomial of the detour matrix of G. Precomputed detour polynomials for many named graphs are available in the ...

A (p,q)-graph is edge-graceful if the edges can be labeled 1 through q in such a way that the labels induced on the vertices by summing over incident edges modulo p are ...