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.     

Probabilistic Extensions of the Erdős–Ko–Rado Property

The classical Erdős–Ko–Rado (EKR) Theorem states that if we choose a family of subsets, each of size k, from a fixed set of size , then the largest possible pairwise intersecting family has size . We consider the probability that a randomly selected family of size t=t _n has the EKR property (pairwise nonempty intersection) as n and k=k _n tend to infinity, the latter at a specific rate. As t gets large, the EKR property is less likely to occur, while as t gets smaller, the EKR property is satisfied with high probability. We derive the threshold value for t using Janson’s inequality. Using the Stein–Chen method we show that the distribution of X ₀, defined as the number of disjoint pairs of subsets in our family, can be approximated by a Poisson distribution. We extend our results to yield similar conclusions for X _i , the number of pairs of subsets that overlap in exactly i elements. Finally, we show that the joint distribution (X ₀, X ₁, ..., X _b ) can be approximated by a multidimensional Poisson vector with independent components.      

Vertex-minors and the Erdős–Hajnal conjecture

We prove that for every graph $H$, there exists $\epsilon >0$ such that every $n$-vertex graph with no vertex-minors isomorphic to $H$ has a pair of disjoint sets $A$, $B$ of vertices such that $\left|A\right|,\left|B\right|\ge \epsilon n$ and $A$ is complete or anticomplete to $B$. We deduce this from recent work of Chudnovsky, Scott, Seymour, and Spirkl (2018). This proves the analog of the Erd?s–Hajnal conjecture for vertex-minors.     

On the weak–strong uniqueness of Koch–Tataruʼs solution for the Navier–Stokes equations

We prove the weak–strong uniqueness between Koch–Tataru?s solution and Leray?s weak solution for three-dimensional incompressible Navier–Stokes equations.     

New upper bounds for the Davenport and for the Erdős–Ginzburg–Ziv constants

Let G be a finite abelian group (written additively) of rank r with invariants n ₁, n ₂, . . . , n _r , where n _r is the exponent of G. In this paper, we prove an upper bound for the Davenport constant D(G) of G as follows; D(G) ≤ n _r + n _r-1 + (c(3) − 1)n _r-2 + (c(4) − 1) n _r-3 + · · · + (c(r) − 1)n ₁ + 1, where c(i) is the Alon–Dubiner constant, which depends only on the rank of the group \mathbb Z_nrⁱ{{\mathbb Z}_{n_r}^i}. Also, we shall give an application of Davenport’s constant to smooth numbers related to the Quadratic sieve.     

On the Erdös–Lax inequality concerning polynomials

Let $P(z)$ be a polynomial of degree n and for any complex number α, let $D_{\alpha }P(z):=nP(z)+(\alpha ?z)P^{\prime }(z)$ denote the polar derivative of $P(z)$ with respect to α. In this paper, we present an integral inequality for the polar derivative of a polynomial. Our theorem includes as special cases several interesting generalisations and refinements of Erdöx–Lax theorem.     

Proof of the Erdős–Faudree Conjecture on Quadrilaterals

In this paper, we prove the Erdős–Faudree’s conjecture: If G is a graph of order 4k and the minimum degree of G is at least 2k then G contains k disjoint cycles of length 4.     

Dade’s ordinary conjecture implies the Alperin–McKay conjecture

Archiv der Mathematik - We show that Dade’s ordinary conjecture implies the Alperin–McKay conjecture. We remark that some of the methods can be used to identify a canonical height zero...     

Fatou’s Interpolation Theorem Implies the Rudin–Carleson Theorem

The purpose of this paper is to show that the Rudin–Carleson interpolation theorem is a direct corollary of Fatou’s much older interpolation theorem (of 1906).     

Cubic symmetric polynomials yielding variations of the Erdős–Ginzburg–Ziv theorem

Let p be a prime and let $\varphi\in\mathbb{Z}_{p}[x_{1},x_{2},\ldots, x_{p}]$ be a symmetric polynomial, where  $\mathbb {Z}_{p}$ is the field of p elements. A sequence T in  $\mathbb {Z}_{p}$ of length p is called a φ-zero sequence if φ(T)=0; a sequence in $\mathbb {Z}_{p}$ is called a φ-zero free sequence if it does not contain any φ-zero subsequence. Motivated by the EGZ theorem for the prime p, we consider symmetric polynomials $\varphi\in \mathbb {Z}_{p}[x_{1},x_{2},\ldots, x_{p}]$ , which satisfy the following two conditions: (i) every sequence in  $\mathbb {Z}_{p}$ of length 2p?1 contains a φ-zero subsequence, and (ii) the φ-zero free sequences in  $\mathbb {Z}_{p}$ of maximal length are all those containing exactly two distinct elements, where each element appears p?1 times. In this paper, we determine all symmetric polynomials in $\mathbb {Z}_{p}[x_{1},x_{2},\ldots, x_{p}]$ of degree not exceeding 3 satisfying the conditions above.     

Modeling the Influence of Public’s Memory on the Corruption–Popularity Dilemma in Politics

We consider the problem of a rational politician who gains benefit from both being popular and corrupt. In 1994, Feichtinger and Wirl studied this trade-off by means of an infinite-horizon optimal control approach. We reconsider the problem over a finite time horizon, to model the dilemma of a politician who stays in office for a limited period of time and wishes to be reelected. We also include explicitly the possibility that awareness of politician’s conduct to the general population is delayed and the effect of such delay on the politician’s optimal behavior is analyzed. We show the outcomes under several different scenarios, with particular reference to the role of the politician’s communication skills. One general conclusion is that the synergy of a good public’s memory and immediate knowledge of corruption may often help the people to protect themselves from political corruption. Moreover, this synergy may greatly enhance the popularity of a politician with poor communication skills, provided that he/she aims at maximizing benefit from popularity during his/her mandate.