4 papers
RPM-MCTS: Knowledge-Retrieval as Process Reward Model with Monte Carlo Tree Search for Code Generation
Yuanyuan Lin, Xiangyu Ouyang, Teng Zhang +1
Tree search-based methods have made significant progress in enhancing the code generation capabilities of large language models. However, due to the difficulty in effectively evalu…
A refinement of Pawlowski's result
Teng Zhang
Let \(F(z) = \prod_{k=1}^{n}(z - z_k)\) be a monic complex polynomial of degree \(n\) whose zeros satisfy \(\max\limits_{1 \le k \le n} |z_k| \le 1\). PawÅowski [Trans. Amer. Math…
Several combinatorial results generalized from one large subset of semigroups to infinitely many
Teng Zhang
In 2015, Phulara established a generalization of the famous central set theorem by an original idea. Roughly speaking, this idea extends a combinatorial result from one large subse…
On partition and almost disjoint properties of combinatorial notions
Teng Zhang
It is known that there are many notions of largeness in a semigroup that own rich combinatorial properties. In this paper, we focus on partition and almost disjoint properties of t…