Long arithmetic progressions in sum-sets and the number x-sum-free sets

2005 ◽  
Vol 90 (02) ◽  
pp. 273-296 ◽  
Author(s):  
E. Szemerédi ◽  
V. H. Vu
2002 ◽  
Vol 65 (1) ◽  
pp. 137-144 ◽  
Author(s):  
Alain Plagne

Given two different positive integers k and l, a (k, l)-free set of some group (G, +) is defined as a set  ⊂ G such that k∩l = ∅. This paper is devoted to the complete determination of the structure of (k, l)-free sets of ℤ/pℤ (p an odd prime) with maximal cardinality. Except in the case where k = 2 and l = 1 (the so-called sum-free sets), these maximal sets are shown to be arithmetic progressions. This answers affirmatively a conjecture by Bier and Chin which appeared in a recent issue of this Bulletin.


10.37236/1639 ◽  
2002 ◽  
Vol 9 (1) ◽  
Author(s):  
Dennis Davenport ◽  
Neil Hindman ◽  
Dona Strauss

Let ${\cal P}_f({\bf N})$ be the set of finite nonempty subsets of ${\bf N}$ and for $F,G\in{\cal P}_f({\bf N})$ write $F < G$ when $\max F < \min G$. Let $X=\{(F,G):F,G\in{\cal P}_f({\bf N})$ and $F < G\}$. A triangle in $X$ is a set of the form $\{(F\cup H,G),(F,G),(F,H\cup G)\}$ where $F < H < G$. Motivated by a question of Erdős, Nešetríl, and Rödl regarding three term arithmetic progressions, we show that any finite subset $Y$ of $X$ contains a relatively large triangle free subset. Exact values are obtained for the largest triangle free sets which can be guaranteed to exist in any set $Y\subseteq X$ with $n$ elements for all $n\leq 14$.


2020 ◽  
Vol 52 (4) ◽  
pp. 1249-1283
Author(s):  
Masatoshi Kimura ◽  
Tetsuya Takine

AbstractThis paper considers ergodic, continuous-time Markov chains $\{X(t)\}_{t \in (\!-\infty,\infty)}$ on $\mathbb{Z}^+=\{0,1,\ldots\}$ . For an arbitrarily fixed $N \in \mathbb{Z}^+$ , we study the conditional stationary distribution $\boldsymbol{\pi}(N)$ given the Markov chain being in $\{0,1,\ldots,N\}$ . We first characterize $\boldsymbol{\pi}(N)$ via systems of linear inequalities and identify simplices that contain $\boldsymbol{\pi}(N)$ , by examining the $(N+1) \times (N+1)$ northwest corner block of the infinitesimal generator $\textbf{\textit{Q}}$ and the subset of the first $N+1$ states whose members are directly reachable from at least one state in $\{N+1,N+2,\ldots\}$ . These results are closely related to the augmented truncation approximation (ATA), and we provide some practical implications for the ATA. Next we consider an extension of the above results, using the $(K+1) \times (K+1)$ ( $K > N$ ) northwest corner block of $\textbf{\textit{Q}}$ and the subset of the first $K+1$ states whose members are directly reachable from at least one state in $\{K+1,K+2,\ldots\}$ . Furthermore, we introduce new state transition structures called (K, N)-skip-free sets, using which we obtain the minimum convex polytope that contains $\boldsymbol{\pi}(N)$ .


2020 ◽  
Vol 161 (2) ◽  
pp. 507-515
Author(s):  
J. Pach ◽  
I. Tomon

Sign in / Sign up

Export Citation Format

Share Document