Related papers: Rado Numbers of Regular Nonhomogeneous Equations

Let $r$ and $k$ be positive integers with $r \mid k$. Denote by $S_{\mathrm{\mathfrak{z}}}(k;r)$ the minimum integer $n$ such that every coloring $\chi:[1,n] \rightarrow \{0,1,\dots,r-1\}$ admits a solution to $\sum_{i=1}^{k-1} x_i = x_k$…

The lower bound for the classical Ramsey number R(4, 8) is improved from 56 to 58. The author has found a new edge coloring of K_{57} that has no complete graphs of order 4 in the first color, and no complete graphs of order 8 in the second…

If $\Omega$ is a bounded domain in $\mathbb R^N$, we study conditions on a Radon measure $\mu$ on $\partial\Omega$ for solving the equation $-\Delta u+e^{u}-1=0$ in $\Omega$ with $u=\mu$ on $\partial\Omega$. The conditions are expressed in…

The set-colouring Ramsey number $R_{r,s}(k)$ is defined to be the minimum $n$ such that if each edge of the complete graph $K_n$ is assigned a set of $s$ colours from $\{1,\ldots,r\}$, then one of the colours contains a monochromatic clique…

We show that for any positive integer $r$ there exists an integer $k$ and a $k$-colouring of the edges of $K_{2^{k}+1}$ with no monochromatic odd cycle of length less than $r$. This makes progress on a problem of Erd\H{o}s and Graham and…

The induced Ramsey number $R_{\mathrm{ind}}(H; r)$ of a graph $H$ is the minimum number $N$ such that there exists a graph with $N$ vertices for which all $r$-colourings of its edges contain a monochromatic induced copy of $H$. Our main…

We give an exponential improvement to the lower bound on diagonal Ramsey numbers for any fixed number of colors greater than two.

We consider systems of $n$ diagonal equations in $k$th powers. Our main result shows that if the coefficient matrix of such a system is sufficiently non-singular, then the system is partition regular if and only if it satisfies Rado's…

In this paper, we establish some upper bounds for numerical radius inequalities including of $2\times 2$ operator matrices and their off-diagonal parts. Among other inequalities, it is shown that if $T=\left[\begin{array}{cc} 0&X, Y&0…

We give upper and lower bounds for the spectral radius of a nonnegative matrix by using its average 2-row sums, and characterize the equality cases if the matrix is irreducible. We also apply these bounds to various nonnegative matrices…

The so-called Dao numbers are a sort of measure of the asymptotic behaviour of full properties of certain product ideals in a Noetherian local ring $R$ with infinite residue field and positive depth. In this paper, we answer a question of…

We establish higher regularity properties of solutions to fully nonlinear elliptic equations at interior critical points. The key novelty of our estimates lies in the fact that they yield smoothness properties that go beyond the inherent…

We study a wide class of linear inhomogeneous boundary-value problems for $r$th order ODE-systems depending on a parameter $\mu$ belonging to a general metric space $\mathcal M$. The solutions belong to the Sobolev spaces $(W^{n+r}_p)^m$,…

Ramsey's theorem for pairs asserts that every 2-coloring of the pairs of integers has an infinite monochromatic subset. In this paper, we study a strengthening of Ramsey's theorem for pairs due to Erdos and Rado, which states that every…

We consider degenerate and singular parabolic equations with $p$-Laplacian structure in bounded nonsmooth domains when the right-hand side is a signed Radon measure with finite total mass. We develop a new tool that allows global regularity…

Let $\Omega$ be a bounded domain in ${\mathbb R}^N$ and $T>0$. We study the problem \begin{equation} (P)\left\{ \begin{array}{lll} u_t - \Delta u \pm g(u) &= \mu \quad &\text{in } Q_T:=\Omega \times (0,T) \\ \phantom{------,} u&=0 &\text{on…

The classical recursive upper bound on hypergraph Ramsey numbers due to Erd\H{o}s and Rado states that for $2 \leq k < s \leq t$, \[ r_k(s,t) \leq 2^{\binom{r_{k-1}(s-1,t-1)}{k-1}}. \] In 2010, Conlon, Fox, and Sudakov introduced the…

The Erd\H{o}s-Rado canonization theorem generalizes Ramsey's theorem to edge-colorings with an unbounded number of colors, in the sense that for $n = ER(m)$ sufficiently large, any edge-coloring of $E(K_n) \to \mathbb{N}$ will yield some…

For $n \geq k \geq 4$, let $AR_{X + Y = Z + T}^k (n)$ be the maximum number of rainbow solutions to the Sidon equation $X+Y = Z + T$ over all $k$-colorings $c:[n] \rightarrow [k]$. It can be shown that the total number of solutions in $[n]$…

Suppose that each number $1,2,...,N$ has one of n colours assigned. We show that if there are no monochromatic solutions to the equation $x_1+x_2+x_3=y_1+y_2$, then $N=O((n!)^{1/2})$, improving upon a result of Cwalina and Schoen. Further,…