相关论文: The Determination of 2-color zero-sum generalized …

Let $n$ and $r$ be positive integers. Define the numbers $S_n^{(r)}$ by $S_n^{(r)}=\sum_{k=0}^n\binom{n}{k}^2\binom{2k}{k}(2k+1)^r.$ In this paper we prove some conjectures of Guo and Liu which extend some conjectures of Z.-W. Sun…

Let $k$ be an positive integer. For any two integers $i$ and $j$ in $\{0,1,\dots,k-1\}$, let $|i-j|_k=\min\{|i-j|,k-|i-j|\}$ be the circular distance between $i$ and $j$. Let $t$ be a nonnegative integer. Suppose $f$ is a mapping from…

We mainly introduce two new kinds of numbers given by $$R_n=\sum_{k=0}^n\binom nk\binom{n+k}k\frac1{2k-1}\quad\ (n=0,1,2,...)$$ and $$S_n=\sum_{k=0}^n\binom nk^2\binom{2k}k(2k+1)\quad\ (n=0,1,2,...).$$ We find that such numbers have many…

A famous result in arithmetic Ramsey theory says that for many linear homogeneous equations $E$ there is a threshold value $R_k(E)$ (the Rado number of $E$) such that for any $k$-coloring of the integers in the interval $[1,n]$, with $n \ge…

We prove an old conjecture of Erd{\H o}s and Graham on sums of unit fractions: There exists a constant $b>0$ such that if we $r$-color the integers in $2,b^r]$, then there exists a monochromatic set $S$ such that $\sum_{n \in S} 1/n=1$.

Van der Waerden's classical theorem on arithmetic progressions states that for any positive integers k and r, there exists a least positive integer, w(k,r), such that any r-coloring of {1,2,...,w(k,r)} must contain a monochromatic k-term…

For any positive integers l and m, a set of integers is said to be (weakly) l-sum-free modulo m if it contains no (pairwise distinct) elements $x_1,x_2,...,x_l,y$ satisfying the congruence $x_1+\...+x_l\equiv y\bmod{m}$. It is proved that,…

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…

The $r$-colour Ramsey number $R_r(k)$ is the minimum $n \in \mathbb{N}$ such that every $r$-colouring of the edges of the complete graph $K_n$ on $n$ vertices contains a monochromatic copy of $K_k$. We prove, for each fixed $r \geqslant 2$,…

For a positive integer $n$ let $H_n=\sum_{k=1}^{n}1/k$ be the $n$th harmonic number. Z. W. Sun conjectured that for any prime $p\ge 5$, $$ \sum_{k=1}^{p-1}\frac{H_k}{k\cdot 2^k} \equiv7/24pB_{p-3}\pmod{p^2}. $$ This conjecture is recently…

We derive exact and sharp lower bounds for the number of monochromatic generalized Schur triples $(x,y,x+ay)$ whose entries are from the set $\{1,\dots,n\}$, subject to a coloring with two different colors. Previously, only asymptotic…

We give an upper bound on the list chromatic number of a 2-colorable hypergraph which generalizes the bound of Schauz on $k$-partite $k$-uniform hypergraphs. It makes sense for sparse hypergraphs: in particular we show that a $k$-uniform…

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…

We prove that for any nonnegative integers $n$ and $r$ the binomial sum $$ \sum_{k=-n}^n\binom{2n}{n-k}k^{2r} $$ is divisible by $2^{2n-\min\{\alpha(n),\alpha(r)\}}$, where $\alpha(n)$ denotes the number of 1's in the binary expansion of…

For $k \in \mathbb{N}$, write $S(k)$ for the largest natural number such that there is a $k$-colouring of $\{1,\dots,S(k)\}$ with no monochromatic solution to $x-y=z^2$. That $S(k)$ exists is a result of Bergelson, and a simple example…

Z.-W. Sun introduced three kinds of numbers: \begin{align*}S_n=\sum_{k=0}^{n}{n\choose k}^2{2k\choose k}(2k+1),\qquad s_n=\sum_{k=0}^{n}{n\choose k}^2{2k\choose k}\frac{1}{2k-1}, \end{align*} and $S_n^{+}=\sum_{k=0}^{n}{n\choose…

For integers r and k > 0(k>r),a conditional (k, r)-coloring of a graph G is a proper k-coloring of G such that every vertex v of G has at least min{r,d(v)} differently colored neighbors, where d(v) is the degree of v. In this note, for…

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…

In 2022, Z.-W. Sun defined \begin{equation*} w_k^{(\alpha)}{(x)}=\sum_{j=1}^{k}w(k,j)^{\alpha}x^{j-1}, \end{equation*} where $k,\alpha$ are positive integers and $w(k,j)=\frac{1}{j}\binom{k-1}{j-1}\binom{k+j}{j-1}$. Let $(x)_{0}=1$ and…

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…