TOPICS
Search

Search Results for ""


131 - 140 of 13135 for Combinatorial MathematicsSearch Results
A presentation of a group is a description of a set I and a subset R of the free group F(I) generated by I, written <(x_i)_(i in I)|(r)_(r in R)>, where r=1 (the identity ...
Low-dimensional topology usually deals with objects that are two-, three-, or four-dimensional in nature. Properly speaking, low-dimensional topology should be part of ...
(1) where H_n(x) is a Hermite polynomial (Watson 1933; Erdélyi 1938; Szegö 1975, p. 380). The generating function ...
A monoid is a set that is closed under an associative binary operation and has an identity element I in S such that for all a in S, Ia=aI=a. Note that unlike a group, its ...
A RAT-free ("right angle triangle-free") set is a set of points, no three of which determine a right triangle. Let f(n) be the largest integer such that a RAT-free subset of ...
A mathematical object defined for a set and a binary operator in which the multiplication operation is associative. No other restrictions are placed on a semigroup; thus a ...
A simplicial complex is a space with a triangulation. Formally, a simplicial complex K in R^n is a collection of simplices in R^n such that 1. Every face of a simplex of K is ...
A surface with boundary is a topological space obtained by identifying edges and vertices of a set of triangles according to all the requirements of a surface except that ...
Two distinct theorems are referred to as "the de Bruijn-Erdős theorem." One of them (de Bruijn and Erdős 1951) concerns the chromatic number of infinite graphs; the other (de ...
The important binomial theorem states that sum_(k=0)^n(n; k)r^k=(1+r)^n. (1) Consider sums of powers of binomial coefficients a_n^((r)) = sum_(k=0)^(n)(n; k)^r (2) = ...
1 ... 11|12|13|14|15|16|17 ... 1314 Previous Next

...