Search Results for ""

The Kronecker-Weber theorem, sometimes known as the Kronecker-Weber-Hilbert theorem, is one of the earliest known results in class field theory. In layman's terms, the ...

The large Witt graph, also called the octad graph (Brouwer) or Witt graph (DistanceRegular.org), is the graph whose vertices are the 759 blocks of a Steiner system S(5,8,24) ...

A polygon whose vertices are points of a point lattice. Regular lattice n-gons exists only for n=3, 4, and 6 (Schoenberg 1937, Klamkin and Chrestenson 1963, Maehara 1993). A ...

Lauricella functions are generalizations of the Gauss hypergeometric functions to multiple variables. Four such generalizations were investigated by Lauricella (1893), and ...

A short theorem used in proving a larger theorem. Related concepts are the axiom, porism, postulate, principle, and theorem. The late mathematician P. Erdős has often been ...

The Lemoine axis is the perspectrix of a reference triangle and its tangential triangle, and also the trilinear polar of the symmedian point K of the reference triangle. It ...

Let (P,B) denote a configuration with v points P={p_1,...,p_v} and b lines ("blocks") B=(B_1,...,B_b). Then the Levi graph L(P,B), also called the incidence graph, of a ...

Let L=(L, ^ , v ) be a lattice, and let f,g:L->L. Then the pair (f,g) is a local polarity if and only if for each finite set X subset= L, there is a finitely generated ...

The lower independence number i(G) of a graph G is the minimum size of a maximal independent vertex set in G. The lower indepedence number is equiavlent to the "independent ...

The first few prime Lucas numbers L_n are 2, 3, 7, 11, 29, 47, 199, 521, 2207, 3571, ... (OEIS A005479), corresponding to indices n=0, 2, 4, 5, 7, 8, 11, 13, 16, 17, 19, 31, ...