Search Results for ""

Angle trisection is the division of an arbitrary angle into three equal angles. It was one of the three geometric problems of antiquity for which solutions using only compass ...

A complete bipartite graph, sometimes also called a complete bicolored graph (Erdős et al. 1965) or complete bigraph, is a bipartite graph (i.e., a set of graph vertices ...

The Dedekind eta function is defined over the upper half-plane H={tau:I[tau]>0} by eta(tau) = q^_^(1/24)(q^_)_infty (1) = q^_^(1/24)product_(k=1)^(infty)(1-q^_^k) (2) = ...

The second knot polynomial discovered. Unlike the first-discovered Alexander polynomial, the Jones polynomial can sometimes distinguish handedness (as can its more powerful ...

A point lattice is a regularly spaced array of points. In the plane, point lattices can be constructed having unit cells in the shape of a square, rectangle, hexagon, etc. ...

A regular graph that is edge-transitive but not vertex-transitive is called a semisymmetric graph (Marušič and Potočnik 2001). In contrast, any graph that is both ...

A regular graph that is not strongly regular is known as a weakly regular graph. There are no weakly regular simple graphs on fewer than six nodes, and the numbers on n=6, 7, ...

In April 1999, Ed Pegg conjectured on sci.math that there were only finitely many zerofree cubes, to which D. Hickerson responded with a counterexample. A few days later, Lew ...

A generalization of the Fibonacci numbers defined by the four constants (p,q,r,s) and the definitions H_0=p and H_1=q together with the linear recurrence equation ...

The largest square dividing a positive integer n. For n=1, 2, ..., the first few are 1, 1, 1, 4, 1, 1, 1, 4, 9, 1, 1, 4, ... (OEIS A008833).