Search Results for ""

A combinatorial conjecture formulated by Kneser (1955). It states that whenever the n-subsets of a (2n+k)-set are divided into k+1 classes, then two disjoint subsets end up ...

Kobon Fujimura asked for the largest number N(n) of nonoverlapping triangles that can be constructed using n lines (Gardner 1983, p. 170). A Kobon triangle is therefore ...

Every finite Abelian group can be written as a group direct product of cyclic groups of prime power group orders. In fact, the number of nonisomorphic Abelian finite groups ...

If theta is a given irrational number, then the sequence of numbers {ntheta}, where {x}=x-|_x_|, is dense in the unit interval. Explicitly, given any alpha, 0<=alpha<=1, and ...

A Laman graph is a graph satisfying Laman's theorem. In other words, it is a graph G have exactly 2n-3 graph edges, where n is the number of graph vertices in G and for which ...

There are a number of functions in mathematics commonly denoted with a Greek letter lambda. Examples of one-variable functions denoted lambda(n) with a lower case lambda ...

The Landau-Mignotte bound, also known as the Mignotte bound, is used in univariate polynomial factorization to determine the number of Hensel lifting steps needed. It gives ...

A grand unified theory of mathematics which includes the search for a generalization of Artin reciprocity (known as Langlands reciprocity) to non-Abelian Galois extensions of ...

A path composed of connected horizontal and vertical line segments, each passing between adjacent lattice points. A lattice path is therefore a sequence of points P_0, P_1, ...

Let n>1 be any integer and let lpf(n) (also denoted LD(n)) be the least integer greater than 1 that divides n, i.e., the number p_1 in the factorization ...