Search Results for ""

The Young tableau (plural, "tableaux") of a Ferrers diagram is obtained by placing the numbers 1, ..., n in the n boxes of the diagram. A "standard" Young tableau is a Young ...

The inequality sinAsinBsinC<=((3sqrt(3))/(2pi))^3ABC, where A, B, and C are the vertex angles of a triangle. The maximum is reached for an equilateral triangle (and therefore ...

Let K be a field, and A a K-algebra. Elements y_1, ..., y_n are algebraically independent over K if the natural surjection K[Y_1,...,Y_n]->K[y_1,...,y_n] is an isomorphism. ...

An aperiodic monotile, also somewhat humorously known as an einstein (where "einstein" means "one stone", perhaps generalizable to "one tile," in German), is a single tile ...

An aperiodic tiling is a non-periodic tiling in which arbitrarily large periodic patches do not occur. A set of tiles is said to be aperiodic if they can form only ...

A Berge graph is a simple graph that contains no odd graph hole and no odd graph antihole. The strong perfect graph theorem asserts that a graph is perfect iff it is a Berge ...

A bitwin chain of length one consists of two pairs of twin primes with the property that they are related by being of the form: (n-1,n+1) and (2n-1,2n+1). (1) The first few ...

The blow-up lemma essentially says that regular pairs in Szemerédi's regularity lemma behave like complete bipartite graphs from the point of view of embedding bounded degree ...

Use the definition of the q-series (a;q)_n=product_(j=0)^(n-1)(1-aq^j) (1) and define [N; M]=((q^(N-M+1);q)_M)/((q;q)_m). (2) Then P. Borwein has conjectured that (1) the ...

A bridgeless graph, also called an isthmus-free graph, is a graph that contains no graph bridges. Examples of bridgeless graphs include complete graphs on n>2 nodes, cycle ...