Search arXivSearch

arXiv · 2503.12748

Arithmetic properties of generalized Delannoy polynomials and Schröder polynomials

Abstract

Let $n$ be any nonnegative integer and \[ D_n^{(h)}(x)=\sum_{k=0}^{n}\binom{n+k}{2k}^{h}\binom{2k}{k}^{h}{x}^{k} \text{ and } S_{n}^{(h)}(x)=\sum_{k=0}^{n}\binom{n+k}{2k}^{h}C_{k}^{h}{x}^{k} \] be the generalized Delannoy polynomials and Schröder polynomials respectively. Here $C_k$ is the Catalan number and $h$ is a positive integer. In this paper, we prove that $$\begin{align*} & \frac{(2,n)}{n(n+1)(n+2)} \sum_{k=1}^{n}k^a(k+1)^a(2k+1)D_{k}^{(h)}(x)^{m}\in\mathbb{Z}[x],\\ &\frac{(2,hm-1,n)}{n(n+1)(n+2)} \sum_{k=1}^{n}(-1)^{k}k^a(k+1)^a(2k+1)D_{k}^{(h)}(x)^{m}\in\mathbb{Z}[x],\\ &\frac{(2,n)}{n(n+1)(n+2)} \sum_{k=1}^{n}k^a(k+1)^a(2k+1)S_{k}^{(h)}(x)^{m}\in\mathbb{Z}[x],\\ &\frac{(2,m-1,n)}{n(n+1)(n+2)} \sum_{k=1}^{n}(-1)^{k}k^a(k+1)^a(2k+1)S_{k}^{(h)}(x)^{m}\in\mathbb{Z}[x]. \end{align*}$$ Taking $a=1$ will confirm some of Z.-W. Sun's conjectures.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Lin-Yue Li, Rong-Hua Wang. 2025-03-17. Arithmetic properties of generalized Delannoy polynomials and Schröder polynomials. https://arxiv.org/abs/2503.12748

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Asymptotic density of k-almost primes

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : Ω(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$π_k(x):=\ \mid\{n\leq x : ω(n)=k\}\mid,$$ is known to be fairly poor for $k > 1$, and when $k$ is allowed to tend to infinity with $x$, the study of $N_k(x)$ and $π_k(x)$ becomes very technical [1, Chapter II.6, $§$ 6.1, p.200]. I hope to show that the method described below provides not only a more accurate approach, but rather increases in its asymptotic accuracy as $k$ tends to infinity.

math.NT

Transcendence Meets Normality: Construction of Transcendentally Normal Numbers

In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally normal and provide an explicit construction of such a number, based on Sierpinski's covering method and novel ideas involving the so-called stretch function. In the next step, we transform this construction into an algorithm that computes the digits of a t-normal number recursively in all integer bases. Moreover, we extend our covering approach to construct and compute LIL-normal numbers whose discrepancies are of the order predicted by the law of the iterated logarithm. We also take the opportunity to discuss several interesting open problems.

math.NT