Search Results for ""

A problem posed by the Slovak mathematician Stefan Znám in 1972 asking whether, for all integers k>=2, there exist k integers x_1,...,x_k all greater than 1 such that x_i is ...

"The" octahedral graph is the 6-node 12-edge Platonic graph having the connectivity of the octahedron. It is isomorphic to the circulant graph Ci_6(1,2), the cocktail party ...

The Lucas polynomials are the w-polynomials obtained by setting p(x)=x and q(x)=1 in the Lucas polynomial sequence. It is given explicitly by ...

The cuboctahedron, also called the heptaparallelohedron or dymaxion (the latter according to Buckminster Fuller; Rawles 1997), is the Archimedean solid with faces 8{3}+6{4}. ...

Four line geometry is a finite geometry subject to the following three axioms: 1. there exist exactly four lines, 2. any two distinct lines have exactly one point of on both ...

The folded n-cube graph, perhaps better termed "folded hypercube graph," is a graph obtained by merging vertices of the n-hypercube graph Q_n that are antipodal, i.e., lie at ...

The Laguerre polynomials are solutions L_n(x) to the Laguerre differential equation with nu=0. They are illustrated above for x in [0,1] and n=1, 2, ..., 5, and implemented ...

A chain complex is a sequence of maps ...-->^(partial_(i+1))C_i-->^(partial_i)C_(i-1)-->^(partial_(i-1))..., (1) where the spaces C_i may be Abelian groups or modules. The ...

The link of 2-spheres in R^4 obtained by spinning intertwined arcs. The link consists of a knotted 2-sphere and a spun trefoil knot.

A term sometimes used to describe a map projection which is neither equal-area nor conformal (Lee 1944; Snyder 1987, p. 4).