Arithmetic progressions in partially ordered sets
暂无分享,去创建一个
Van der Waerden's arithmetic sequence theorem—in particular, the ‘density version’ of Szemerédi—is generalized to partially ordered sets in the following manner. Let w and t be fixed positive integers and ε>0. Then for every sufficiently large partially ordered set P of width at most w, every subset S of P satisfying |S|≥ε|P| contains a chain a1, a2,..., a1 such that the cardinality of the interval [ai, ai+1] in P is the same for each i.
[1] Michael E. Saks,et al. On the widths of finite distributive lattices , 1987, Discret. Math..
[2] E. Szemerédi. On sets of integers containing k elements in arithmetic progression , 1975 .
[3] E. Szemeri~di,et al. On Sets of Integers Containing No Four Elements in Arithmetic Progression , .
[4] Dwight R. Bean,et al. Avoidable patterns in strings of symbols , 1979 .