Search Results for ""

A system in which a strange loop appears.

An operator T which maps some basic polynomial sequence p_n(x) into another basic polynomial sequence q_n(x).

An aliquot sequence computed using the analog of the restricted divisor function s^*(n) in which only unitary divisors are included.

Given a planar graph G, a geometric dual graph and combinatorial dual graph can be defined. Whitney showed that these are equivalent (Harary 1994), so that one may speak of ...

The quadratic embedding constant QEC(G) of a finite simple connected graph G on n vertices is defined as the maximum of the product vDv over all real n-vectors v satisfying ...

Let c_k be the number of vertex covers of a graph G of size k. Then the vertex cover polynomial Psi_G(x) is defined by Psi_G(x)=sum_(k=0)^(|G|)c_kx^k, (1) where |G| is the ...

What is the probability that a chord drawn at random on a circle of radius r (i.e., circle line picking) has length >=r (or sometimes greater than or equal to the side length ...

Perspective is the art and mathematics of realistically depicting three-dimensional objects in a two-dimensional plane, sometimes called centric or natural perspective to ...

The simple process of voting leads to surprisingly counterintuitive paradoxes. For example, if three people vote for three candidates, giving the rankings A, B, C; B, C, A; ...

A graph is called cordial if it is possible to label its vertices with 0s and 1s so that when the edges are labeled with the difference of the labels at their endpoints, the ...