Is there a symmetric version of Hindman's theorem?

DOI10.1016/J.JCTA.2016.03.002zbMATH Open1337.05108OpenAlexW2328737477MaRDI QIDQ285059FDOQ285059

Authors: Ethan Akin, Eli Glasner 

Publication date: 18 May 2016

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcta.2016.03.002

Recommendations

• scientific article; zbMATH DE number 4063093
• Hindman's theorem is only a countable phenomenon
• Strong failures of higher analogs of Hindman's theorem
• Hilbert versus Hindman
• Finite products sets and minimally almost periodic groups

zbMATH Keywords

difference setsHindman theoremIP-setsmild mixingRamsey theoremSIP-sets

Mathematics Subject Classification ID

Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) Ramsey theory (05D10)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Topological complexity, return times and weak disjointness
• Finite sums from sequences within cells of a partition of N
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (4)

• Predictive sets
• WAP systems and labeled subshifts
• Title not available (Why is that?)
• Polynomial extension of some symmetric partition regular structures

This page was built for publication: Is there a symmetric version of Hindman's theorem?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q285059)