On dynamical C-set and its combinatorial consequences

Abstract

Using the methods from topological dynamics, H. Furstenberg introduced the notion of a central set and proved the famous Central Sets Theorem. Later D. De, Neil Hindman, and D. Strauss [Fund. Math.199 (2008), 155-175.] established a stronger version of the Central Sets Theorem and then introduced the notion of C-sets satisfying the Central Sets Theorem and studied the properties of these sets. For any weak mixing system (X, B,μ, T), and A0,A1∈B, with μ(A0)μ(A1)>0, R. Kung and X.Ye [Disc. Cont. Dyn. sys., 18 (2007) 817-827.] proved that the set N(A,B)= \n:μ(A0 T-nA1)>0\ intersects all sets of positive upper Banach density. However, later N. Hindman and D. Strauss [New York J. Math. 26 (2020) 230-260.] proved that there exist C-sets having zero upper Banach density. Inspired by this result, in this article, we prove that N(A, B ) intersects with all C-sets. Then we introduce the notion of a dynamical C-set and then we study their combinatorial properties.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…