Combinatorial Structures on van der Waerden sets

DOI10.1017/S0963548314000868zbMATH Open1371.05305arXiv1301.4297OpenAlexW3099101985MaRDI QIDQ5364262FDOQ5364262

Authors: Konstantinos Tyros 

Publication date: 4 October 2017

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Abstract: In this paper we provide two results. The first one consists an infinitary version of the Furstenberg-Weiss Theorem. More precisely we show that every subset $A$ of a homogeneous tree $T$ such that $frac|AcapT(n)||T(n)|geqdelta$, where T(n) denotes the $n$-th level of $T$, for all $n$ in a van der Waerden set, for some positive real $delta$, contains a strong subtree having a level sets which forms a van der Waerden set. The second result is the following. For every sequence $(m_q{)}_q$ of positive integers and for every real $0<delta\le 1$, there exists a sequence $(n_q{)}_q$ of positive integers such that for every $$ satisfying ${\displaystyle }$frac{�ig{|}Dcap prod_{q=0}^{k-1} [n_q]�ig{|}}{prod_{q=0}^{k-1}n_q}geqdelta${\displaystyle }$ for every $k$ in a van der Waerden set, there is a sequence $(J_q{)}_q$, where $J_q$ is an arithmetic progression of length $m_q$ contained in $[n_q]$ for all $q$, such that $pro{d}_{q=0}^{k-1}{J}_{q}subseteqD$ for every $k$ in a van der Waerden set. Moreover, working in an abstract setting, we obtain $J_q$ to be any configuration of natural numbers that can be found in an arbitrary set of positive density.

Full work available at URL: https://arxiv.org/abs/1301.4297

Recommendations

• Discrete structures and van der Waerden sets
• scientific article; zbMATH DE number 3953697
• scientific article; zbMATH DE number 3959436
• scientific article; zbMATH DE number 6005
• Combinatorics of Vassiliev invariants
• scientific article; zbMATH DE number 733411
• scientific article; zbMATH DE number 3414413
• scientific article; zbMATH DE number 847205
• On the algebraic structure of combinatorial problems
• Combinatorial set theory

Mathematics Subject Classification ID

Ramsey theory (05D10)

Cites Work

• On extremal problems of graphs and generalized graphs
• Title not available (Why is that?)
• An ergodic IP polynomial Szemerédi theorem
• Polynomial extensions of van der Waerden’s and Szemerédi’s theorems
• A new proof of Szemerédi's theorem
• On sets of integers containing k elements in arithmetic progression
• A density version of the Carlson-Simpson theorem
• Elemental methods in ergodic Ramsey theory
• Introduction to Ramsey space
• Title not available (Why is that?)
• Subsets of products of finite sets of positive upper density
• Parametrized partitions of products of finite sets
• A Ramsey theorem for trees
• Markov Processes and Ramsey Theory for Trees
• Remarks on a Ramsey theory for trees
• A Partition Theorem for the Infinite Subtrees of a Tree
• A Hardy field extension of Szemerédi's theorem
• A variant of the density Hales-Jewett theorem

Cited In (2)

• Dense Subsets of Products of Finite Trees
• Discrete structures and van der Waerden sets

This page was built for publication: Combinatorial Structures on van der Waerden sets

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