Search Results for ""

A number which is simultaneously octagonal and heptagonal. Let O_m denote the mth octagonal number and H_n the nth heptagonal number, then a number which is both octagonal ...

A number which is simultaneously octagonal and hexagonal. Let O_n denote the nth octagonal number and H_m the mth hexagonal number, then a number which is both octagonal and ...

A number which is simultaneously octagonal and pentagonal. Let O_n denote the nth octagonal number and P_m the mth pentagonal number, then a number which is both octagonal ...

A number which is simultaneously octagonal and triangular. Let O_n denote the nth octagonal number and T_m the mth triangular number, then a number which is both octagonal ...

The toroidal crossing number cr_(1)(G) of a graph G is the minimum number of crossings with which G can be drawn on a torus. A planar graph has toroidal crossing number 0, ...

The apeirogon is an extension of the definition of regular polygon to a figure with an infinite number of sides. Its Schläfli symbol is {infty}. The apeirogon can produce a ...

An attracting set that has zero measure in the embedding phase space and has fractal dimension. Trajectories within a strange attractor appear to skip around randomly. A ...

Consider the process of taking a number, adding its digits, then adding the digits of the number derived from it, etc., until the remaining number has only one digit. The ...

The clique covering number theta(G) of a graph G is the minimum number of cliques in G needed to cover the vertex set of G. Since theta(G) involves the minimum number of ...

The projective plane crossing number of a graph is the minimal number of crossings with which the graph can be drawn on the real projective plane. A graph with projective ...