✦ LIBER ✦

On IP*sets and central sets

✍ Scribed by Vitaly Bergelson; Neil Hindman

Publisher: Springer-Verlag
Year: 1994
Tongue: English
Weight: 519 KB
Volume: 14
Category: Article
ISSN: 0209-9683
DOI: 10.1007/bf01212975

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Recurrent sequences and IP sets

✍ Kamel N. Haddad; Aimee S.A. Johnson 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 86 KB

Sets satisfying the Central Sets Theorem

✍ Neil Hindman; Dona Strauss 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 642 KB

Central lacunary sets

✍ Daniel Rider 📂 Article 📅 1972 🏛 Springer Vienna 🌐 English ⚖ 410 KB

Central Sets and Their Combinatorial Cha

Central Sets and Their Combinatorial Characterization

✍ Neil Hindman; Amir Maleki; Dona Strauss 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 1023 KB

Central sets in semigroups are known to have very rich combinatorial structure, described by the ``Central Sets Theorem''. It has been unknown whether the Central Sets Theorem in fact characterizes central sets, and if not whether some other combinatorial characterization could be found. We derive h

Central set influences on gait

✍ Lesley A. Brown; William H. Gage; Melody A. Polych; Ryan J. Sleik; Toni R. Winde 📂 Article 📅 2002 🏛 Springer-Verlag 🌐 English ⚖ 419 KB

On Crossing Sets, Disjoint Sets, and Pag

On Crossing Sets, Disjoint Sets, and Pagenumber

✍ Farhad Shahrokhi; Weiping Shi 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 109 KB

Let G s V, E be a t-partite graph with n vertices and m edges, where the Ž 2 1.5 . partite sets are given. We present an O n m time algorithm to construct drawings of G in the plane so that the size of the largest set of pairwise crossing Ž edges and, at the same time, the size of the largest set of