Search Results for ""

A figurate number which is constructed as an octahedral number with a square pyramid removed from each of the six graph vertices, TO_n = O_(3n-2)-6P_(n-1)^((4)) (1) = ...

A figurate number constructed by taking the (3n-2)th tetrahedral number and removing the (n-1)th tetrahedral number from each of the four corners, Ttet_n = ...

The twinplex graph is the graph illustrated above in a number of embeddings which corresponds to the graph labeled Gamma_2 in Fischer and Little (2011). It is a cubic ...

A two-regular graph is a regular graph for which all local degrees are 2. A two-regular graph consists of one or more (disconnected) cycles. The numbers a_n of two-regular ...

A graph is said to be unswitchable if it cannot be reduced to another graph with the same degree sequence by edge-switching. Conversely, a graph that can be reduced to ...

For a given point lattice, some number of points will be within distance d of the origin. A Waterman polyhedron is the convex hull of these points. A progression of Waterman ...

Let X=(X,tau) be a topological vector space whose continuous dual X^* may or may not separate points (i.e., may or may not be T2). The weak-* (pronounced "weak star") ...

The identity element of an additive group G, usually denoted 0. In the additive group of vectors, the additive identity is the zero vector 0, in the additive group of ...

A procedure for finding the quadratic factors for the complex conjugate roots of a polynomial P(x) with real coefficients. (1) Now write the original polynomial as ...

The nth order Bernstein expansion of a function f(x) in terms of a variable x is given by B_n(f,x)=sum_(j=0)^n(n; j)x^j(1-x)^(n-j)f(j/n), (1) (Gzyl and Palacios 1997, Mathé ...