Search Results for ""

Given a sequence of real numbers a_n, the supremum limit (also called the limit superior or upper limit), written lim sup and pronounced 'lim-soup,' is the limit of ...

The 12-vertex graph consisting of a cube in which two opposite faces (say, top and bottom) have edges drawn across them which connect the centers of opposite sides of the ...

Given a sequence S_i as input to stage i, form sequence S_(i+1) as follows: 1. For k in [1,...,i], write term i+k and then term i-k. 2. Discard the ith term. 3. Write the ...

Closed forms are known for the sums of reciprocals of even-indexed Lucas numbers P_L^((e)) = sum_(n=1)^(infty)1/(L_(2n)) (1) = sum_(n=1)^(infty)1/(phi^(2n)+phi^(-2n)) (2) = ...

The deltoidal hexecontahedral graph is an Archimedean dual graph which is the skeleton of the deltoidal hexecontahedron as well as the rhombic hexecontahedron. It is ...

In graph theory, a cycle graph C_n, sometimes simply known as an n-cycle (Pemmaraju and Skiena 2003, p. 248), is a graph on n nodes containing a single cycle through all ...

The first (called the "Blanuša double" by Orbanić et al. 2004) and second (called the "Blanuša snark" by Orbanić et al. 2004) Blanuša snarks were the second and third snarks ...

An exponential sum of the form sum_(n=1)^Ne^(2piiP(n)), (1) where P(n) is a real polynomial (Weyl 1914, 1916; Montgomery 2001). Writing e(theta)=e^(2piitheta), (2) a notation ...

"The" butterfly graph is a name sometimes given to the 5-vertex graph illustrated above. This graph is also known as the "bowtie graph" (West 2000, p. 12) and is the ...

The n-centipede graph, n-centipede tree, n-comb graph (Seoud and Youssef 2017), or simply "n-centipede," is the tree on 2n nodes obtained by joining the bottoms of n copies ...