The Erdős-Szekeres theorem and congruences

The following problem of combinatorial geometry is considered. Given positive integers n and q, find or estimate a minimal number h for which any set of h points in general position in the plane contains n vertices of a convex polygon for which the number of interior points is divisible by q. For a wide range of parameters, the existing bound for h is dramatically improved.     

Interior points in the Erdős-Szekeres theorems

The paper is devoted to selected problems of combinatorial geometry.

     

On Erdős-Rado numbers

In this paper new proofs of the Canonical Ramsey Theorem, which originally has been proved by Erd?s and Rado, are given. These yield improvements over the known bounds for the arising Erd?s-Rado numbersER(k; l), where the numbersER(k; l) are defined as the least positive integern such that for every partition of thek-element subsets of a totally orderedn-element setX into an arbitrary number of classes there exists anl-element subsetY ofX, such that the set ofk-element subsets ofY is partitioned canonically (in the sense of Erd?s and Rado). In particular, it is shown that $$2^{c1} .l^2 \leqslant ER(2;l) \leqslant 2^{c_2 .l^2 .\log l} $$ for every positive integerl≥3, wherec ₁,c ₂ are positive constants. Moreover, new bounds, lower and upper, for the numbersER(k; l) for arbitrary positive integersk, l are given.     

A Weighted Erdős-Ginzburg-Ziv Theorem

An n-set partition of a sequence S is a collection of n nonempty subsequences of S, pairwise disjoint as sequences, such that every term of S belongs to exactly one of the subsequences, and the terms in each subsequence are all distinct so that they can be considered as sets. If S is a sequence of m+n−1 elements from a finite abelian group G of order m and exponent k, and if is a sequence of integers whose sum is zero modulo k, then there exists a rearranged subsequence of S such that . This extends the Erdős–Ginzburg–Ziv Theorem, which is the case when m = n and w_i = 1 for all i, and confirms a conjecture of Y. Caro. Furthermore, we in part verify a related conjecture of Y. Hamidoune, by showing that if S has an n-set partition A=A₁, . . .,A_n such that |w_iA_i| = |A_i| for all i, then there exists a nontrivial subgroup H of G and an n-set partition A′ =A′₁, . . .,A′_n of S such that and for all i, where w_iA_i={w_ia_i |a_i∈A_i}.     

Variants of the Erdős–Szekeres and Erdős–Hajnal Ramsey problems

Given integers $\ell ,n$, the $\ell$th power of the path $P_n$ is the ordered graph $P_n^{\ell }$ with vertex set $v_1<v_2<\cdots <v_n$ and all edges of the form $v_i{v}_j$ where $|i-j|\le \ell$. The Ramsey number $r(P_n^{\ell },P_n^{\ell })$ is the minimum $N$ such that every 2-coloring of $\left(\genfrac{}{}{0ex}{}{\left[N\right]}{2}\right)$ results in a monochromatic copy of $P_n^{\ell }$. It is well-known that $r(P_n^1,P_n^1)={(n-1)}^2+1$. For $\ell >1$, Balko–Cibulka–Král–Kynčl proved that $r(P_n^{\ell },P_n^{\ell })<c_{\ell }{n}^{128\ell }$ and asked for the growth rate for fixed $\ell$. When $\ell =2$, we improve this upper bound substantially by proving $r(P_n^2,P_n^2)<c{n}^{19.5}$. Using this result, we determine the correct tower growth rate of the $k$-uniform hypergraph Ramsey number of a $(k+1)$-clique versus an ordered tight path. Finally, we consider an ordered version of the classical Erdős–Hajnal hypergraph Ramsey problem, improve the tower height given by the trivial upper bound, and conjecture that this tower height is optimal.     

On increasing subsequences of minimal Erdös-Szekeres permutations

Let π be a minimal Erdös-Szekeres permutation of 1, 2, ..., n ², and let l _n,k be the length of the longest increasing subsequence in the segment (π(1), ..., π(k)). Under uniform measure we establish an exponentially decaying bound of the upper tail probability for l _n,k , and as a consequence we obtain a complete convergence, which is an improvement of Romik’s recent result. We also give a precise lower exponential tail for l _n,k .     

On a problem of Erdős

Let s≥2 be an integer. Denote by f ₁(s) the least integer so that every integer l>f ₁(s) is the sum of s distinct primes. Erd?s proved that f ₁(s)<p ₁+p ₂+?+p _s +Cslogs, where p _i is the ith prime and C is an absolute constant. In this paper, we prove that f ₁(s)=p ₁+p ₂+?+p _s +(1+o(1))slogs=p ₂+p ₃+?+p _s+1+o(slogs). This answers a question posed by P. Erd?s.     

Erdős-Ko-Rado theorems in certain semilattices

Suda (2012) extended the Erds-Ko-Rado theorem to designs in strongly regularized semilattices.In this paper we generalize Suda’s results in regularized semilattices and partition regularized semilattices,give many examples for these semilattices and obtain their intersection theorems.     

On Erdős's Eulerian Trail Game

 Paul Erdős proposed the following graph game. Starting with the empty graph on n vertices, two players, Trailmaker and Breaker, draw edges alternatingly. Each edge drawn has to start at the endpoint of the previously drawn edge, so the sequence of edges defines a trail. The game ends when it is impossible to continue the trail, and Trailmaker wins if the trail is eulerian. For all values of n, we determine which player has a winning strategy. Received: November 6, 1996 / Revised: May 2, 1997     

Tauberian Theorem of Erdős Revisited

Dedicated to the memory of Paul Erdős In connection with the elementary proof of the prime number theorem, Erdős obtained a striking quadratic Tauberian theorem for sequences. Somewhat later, Siegel indicated in a letter how a powerful "fundamental relation" could be used to simplify the difficult combinatorial proof. Here the author presents his version of the (unpublished) Erdős–Siegel proof. Related Tauberian results by the author are described. Received December 20, 1999     

Characterizing stable complete Erdős space

Every Polish group is not free whereas some F _σ group may be free. Also, every automorphism group of a structure of cardinality, e.g. ℶ _ω , is not free.     

Some Erdös-Szekeres type results about points in space

The Erdös-Szekeres convexn-gon theorem states that for anyn3, there is a smallest integerf(n) such that any set of at leastf(n) points in the planeE ², no three collinear, contains the vertices of a convexn-gon. We consider three versions of this result as applied to convexly independent points and convex polytopes inE ^d >,d2.     

Erdős-Ginzburg-Ziv theorem for finite commutative semigroups

Let \(\mathcal{S}\) be a finite additively written commutative semigroup, and let \(\exp(\mathcal{S})\) be its exponent which is defined as the least common multiple of all periods of the elements in \(\mathcal{S}\) . For every sequence T of elements in \(\mathcal{S}\) (repetition allowed), let \(\sigma(T) \in\mathcal{S}\) denote the sum of all terms of T. Define the Davenport constant \(\mathsf{D}(\mathcal{S})\) of \(\mathcal{S}\) to be the least positive integer d such that every sequence T over \(\mathcal{S}\) of length at least d contains a proper subsequence T′ with σ(T′)=σ(T), and define \(\mathsf{E}(\mathcal{S})\) to be the least positive integer ? such that every sequence T over \(\mathcal{S}\) of length at least ? contains a subsequence T′ with \(|T|-|T'|= \lceil\frac{|\mathcal{S}|}{\exp(\mathcal{S})} \rceil \exp(\mathcal{S})\) and σ(T′)=σ(T). When \(\mathcal{S}\) is a finite abelian group, it is well known that \(\lceil\frac{|\mathcal{S}|}{\exp(\mathcal{S})} \rceil\exp (\mathcal{S})=|\mathcal{S}|\) and \(\mathsf{E}(\mathcal{S})=\mathsf{D}(\mathcal{S})+|\mathcal{S}|-1\) . In this paper we investigate whether \(\mathsf{E}(\mathcal{S})\leq \mathsf{D}(\mathcal{S})+ \lceil\frac{|\mathcal{S}|}{\exp(\mathcal {S})} \rceil \exp(\mathcal{S})-1\) holds true for all finite commutative semigroups \(\mathcal{S}\) . We provide a positive answer to the question above for some classes of finite commutative semigroups, including group-free semigroups, elementary semigroups, and archimedean semigroups with certain constraints.     

Erdős–Szekeres Theorem for Lines

According to the Erd?s–Szekeres theorem, for every n, a sufficiently large set of points in general position in the plane contains n in convex position. In this note we investigate the line version of this result, that is, we want to find n lines in convex position in a sufficiently large set of lines that are in general position. We prove almost matching upper and lower bounds for the minimum size of the set of lines in general position that always contains n in convex position. This is quite unexpected, since in the case of points, the best known bounds are very far from each other. We also establish the dual versions of many variants and generalizations of the Erd?s–Szekeres theorem.     

The Erdős-Heilbronn problem in Abelian groups

Solving a problem of Erdős and Heilbronn, in 1994 Dias da Silva and Hamidoune proved that ifA is a set ofk residues modulo a primep,p≥2k−3, then the number of different elements of ℤ/pℤ that can be written in the forma+a′ wherea, a′ ∈A,a∈a′, is at least 2k−3. Here we extend this result to arbitrary Abelian groups in which the order of any nonzero element is at least 2k−3. Visiting the Rényi Institute of the Hungarian Academy of Sciences. Research partially supported by Hungarian Scientific Research Grants OTKA T043623 and T043631 and the CRM, University of Montreal.