Related papers: Rado Numbers of Regular Nonhomogeneous Equations
For a positive integer $r$, let $G(r)$ be the smallest $N$ such that, whenever the edges of the Cartesian product $K_N \times K_N$ are $r$-coloured, then there is a rectangle in which both pairs of opposite edges receive the same colour. In…
For positive integers $n,r,s$ with $r > s$, the set-coloring Ramsey number $R(n;r,s)$ is the minimum $N$ such that if every edge of the complete graph $K_N$ receives a set of $s$ colors from a palette of $r$ colors, then there is a subset…
Let $b_{\alpha}^{p}(\mathbb{R}^{1+n}_{+})$ be the space of solutions to the parabolic equation $\partial_{t}u+(-\triangle)^{\alpha}u=0$ $(\alpha\in(0, 1])$ having finite $L^{p}(\mathbb{R}^{1+n}_{+})$ norm. We characterize nonnegative Radon…
This paper describes an improvement in the upper bound for the magnitude of a coefficient of a term in the chromatic polynomial of a general graph. If $a_r$ is the coefficient of the $q^r$ term in the chromatic polynomial $P(G,q)$, where…
Let $P$ be a set of $n$ green and $n - k$ red points in $\mathbb{C}^2$. A line determined by $i$ green and $j$ red points such that $i + j \ge 2$ and $|i - j| \le r$ is called \emph{r-equichromatic}. We establish lower bounds for…
In this paper, we prove the existence of multiple nontrivial solutions of the following equation. \begin{align*} \begin{split} -\Delta_{p}u & = \frac{\lambda}{u^{\gamma}}+g(u)+\mu~\mbox{in}\,\,\Omega, u & = 0\,\, \mbox{on}\,\,…
The multicolor Ramsey number problem asks, for each pair of natural numbers $\ell$ and $t$, for the largest $\ell$-coloring of a complete graph with no monochromatic clique of size $t$. Recent works of Conlon-Ferber and Wigderson have…
Let $\Omega$ be a bounded strictly pseudoconvex domain of $\mathbb{C}^n$. We solve degenerate complex Monge-Amp\`ere equations of the form $(\omega + dd^c \varphi)^n = \mu$ in the generalized Cegrell classes $\mathcal{K}(\Omega,\omega,H)$,…
We give an explicit upper bound for the number of equivalence classes of binary forms with rational integral coefficients of given degree and given discriminant, and with given splitting field. Further, we give an explicit upper bound for…
Let $r_k(C_{2m+1})$ be the $k$-color Ramsey number of an odd cycle $C_{2m+1}$ of length $2m+1$. It is shown that for each fixed $m\ge2$, \[r_k(C_{2m+1})<c^{k}\sqrt{k!}\] for all sufficiently large $k$, where $c=c(m)>0$ is a constant. This…
We consider some coloring issues related to the famous Erd\H {o}s Discrepancy Problem. A set of the form $A_{s,k}=\{s,2s,\dots,ks\}$, with $s,k\in \mathbb{N}$, is called a \emph{homogeneous arithmetic progression}. We prove that for every…
For positive integers $n,r,s$ with $r > s$, the set-coloring Ramsey number $R(n;r,s)$ is the minimum $N$ such that if every edge of the complete graph $K_N$ receives a set of $s$ colors from a palette of $r$ colors, then there is guaranteed…
This article is devoted to the study of solutions of non-homogenous linear differential equations having entire coefficients. We get all non-trivial solutions of infinite order of equation $f^{(n)}+a_{n-1}(z)f^{(n-1)}+\ldots…
For a given graph $H$ and $n\geq 1$, let $f(n,H)$ denote the maximum number $c$ for which there is a way to color the edges of the complete graph $K_n$ with $c$ colors such that every subgraph $H$ of $K_n$ has at least two edges of the same…
An exact r-coloring of a set $S$ is a surjective function $c:S \rightarrow \{1, 2, \ldots,r\}$. A rainbow solution to an equation over $S$ is a solution such that all components are a different color. We prove that every 3-coloring of…
Using Plemelj formula we obtain three circular harmonic inversion formulas of the exponential Radon transform with complex coefficients. We also derive two different range conditions and prove that Novikov's range condition does imply the…
An effective upper bound is established for the least non-trivial integer solution to the system of cubic forms \[ \begin{cases} F = c_{1}x_1^3 + c_{2}x_2^3 + \cdots + c_{n}x_n^3 = 0, \\ G = d_{1}x_1^3 + d_{2}x_2^3 + \cdots + d_{n}x_n^3 =…
We consider the rainbow Schur number $RS_m(n)$, defined to be the minimum number of colors such that every coloring of $\{1,2,\ldots,n\}$, using all $RS_m(n)$ colors, contains a rainbow solution to the equation $x_1+x_2+\cdots…
Let $c$ be a positive odd integer and $R$ a set of $n$ primes coprime with $c$. We consider equations $X + Y = c^z$ in three integer unknowns $X$, $Y$, $z$, where $z > 0$, $Y > X > 0$, and the primes dividing $XY$ are precisely those in…
We prove general sufficient and necessary conditions for the partition regularity of Diophantine equations, which extend the classic Rado's Theorem by covering large classes of nonlinear equations. Sufficient conditions are obtained by…