中文
相关论文

相关论文: An identity relating Catalan numbers to tangent nu…

200 篇论文

In this paper we initiate the study of products and sums divisible by central binomial coefficients. We show that 2(2n+1)binom(2n,n)| binom(6n,3n)binom(3n,n) for every n=1,2,3,... Also, for any nonnegative integers $k$ and $n$ we have…

数论 · 数学 2010-05-06 Zhi-Wei Sun

A new polynomial identity is found for Dickson polynomials in characteristic 2. The identity is used to prove that the two polynomials $x^{q+1}+x+1/a$ and $C(x)+a$ have the same splitting field over $F$, where $F$ is a field of…

数论 · 数学 2022-03-09 Antonia W. Bluher

We confirm a conjectural supercongruence involving Catalan numbers, which is one of the 100 selected open conjectures on congruences of Sun. The proof makes use of hypergeometric series identities and symbolic summation method.

数论 · 数学 2020-01-14 Ji-Cai Liu

In this note, we present some basic properties of $q$-Fibonacci numbers and their relationship to the $q$-golden ratio and Catalan numbers. We then use this relationship to give a short proof of a combinatorial identity.

组合数学 · 数学 2021-08-12 Kevin Carde

We study polynomial summation over unit circles over finite fields of odd characteristic, obtaining a purely algebraic integration theory without recourse to infinite procedures. There are nonetheless strong parallels to classical…

组合数学 · 数学 2022-08-04 Kevin Limanta , Norman J. Wildberger

We find a $q$-analog of the following symmetrical identity involving binomial coefficients $\binom{n}{m}$ and Eulerian numbers $A_{n,m}$, due to Chung, Graham and Knuth [{\it J. Comb.}, {\bf 1} (2010), 29--38]: {equation*} \sum_{k\geq…

组合数学 · 数学 2012-04-02 Guoniu Han , Zhicong Lin , Jiang Zeng

This (partly expository) paper originated from the study of Hankel determinants of convolution powers of Catalan numbers and of Narayana polynomials. This led to some Hankel determinants of signed Catalan numbers whose values are multiples…

组合数学 · 数学 2018-04-10 Johann Cigler

A new class of alternating convolutions concerning binomial coefficients and Catalan numbers are evaluated in closed forms.

经典分析与常微分方程 · 数学 2021-03-09 Wenchang Chu

In this paper we obtain a new curious identity involving trigonometric functions. Namely, for any positive odd integer $n$ we prove that $$\sum_{k=1}^n(-1)^k(\cot kx)\sin k(n-k)x=\frac{1-n}2,$$ which is equivalent to the identity…

组合数学 · 数学 2024-10-08 Zhi-Wei Sun , Hao Pan

We establish two binomial coefficient--generalized harmonic sum identities using the partial fraction decomposition method. These identities are a key ingredient in the proofs of numerous supercongruences. In particular, in other works of…

数论 · 数学 2012-04-10 Dermot McCarthy

In this note we prove that \[ j!\,2^N \, \binom{N+j-1}{j} \, {}_2F_1\left(\begin{matrix}-j,-2j \\ -N-j+1 \end{matrix};-1\right) = \sum_{l=0}^N \binom{N}{l}\prod_{i=0}^{j-1}2(2i+1+l), \] where $ N $ and $ j $ are positive integers, which…

经典分析与常微分方程 · 数学 2024-01-19 Maxim L. Yattselev

We consider Tuenter polynomials as linear combinations of descending factorials and show that coefficients of these linear combinations are expressed via a Catalan triangle of numbers. We also describe a triangle of coefficients in terms of…

组合数学 · 数学 2016-06-15 Andrei K. Svinin

The super Catalan numbers $T(m,n)=(2m)!(2n)!/2m!n!(m+n)!$ are integers which generalize the Catalan numbers. With the exception of a few values of $m$, no combinatorial interpretation in known for $T(m,n)$. We give a weighted interpretation…

组合数学 · 数学 2014-08-27 Emily Allen , Irina Gheorghiciuc

We show that the Schubert polynomial S_w specializes to the Catalan number C_n when $w=1(n+1)...2$. Several proofs of this result as well as a q-analog are given. An application to the singularities of Schubert varieties is given.

组合数学 · 数学 2007-05-23 Alexander Woo

In the paper, the author establishes some identities which show that the functions $\frac1{(1-e^{\pm t})^k}$ and the derivatives $\bigl(\frac1{e^{\pm t}-1}\bigr)^{(i)}$ can be expressed each other by linear combinations with coefficients…

经典分析与常微分方程 · 数学 2014-03-07 Feng Qi

An identity by Chaundy and Bullard writes 1/(1-x)^n (n=1,2,...) as a sum of two truncated binomial series. This identity was rediscovered many times. Notably, a special case was rediscovered by I. Daubechies, while she was setting up the…

经典分析与常微分方程 · 数学 2009-02-20 Tom H. Koornwinder , Michael J. Schlosser

In this paper, we generalize the Catalan number to the $(n,k)$-th Catalan numbers and find a combinatorial description that the $(n,k)$-th Catalan numbers is equal to the number of partitions of $n(k-1)+2$ polygon by $(k+1)$-gon where all…

组合数学 · 数学 2015-01-28 Dongseok Kim

In previous work on Clebsch-Gordan coefficients, certain remarkable hexagonal arrays of integers are constructed that display behaviors found in Pascal's Triangle. We explain these behaviors further using the binomial transform and discrete…

组合数学 · 数学 2019-05-07 Robert W. Donley,

We show for even positive integers $n$ that the quotient of the Riemann zeta values $\zeta(n+1)$ and $\zeta(n)$ satisfies the equation $$\frac{\zeta(n+1)}{\zeta(n)} = (1-\frac{1}{n}) (1-\frac{1}{2^{n+1}-1})…

数论 · 数学 2014-10-30 Bernd C. Kellner

For $0\leq k \leq n$, the number $C(n,k)$ represents the number of all lattice paths in the plane from the point $(0,0)$ to the point $(n,k)$, using steps $(1,0)$ and $(0,1)$, that never rise above the main diagonal $y=x$. The Fuss-Catalan…

组合数学 · 数学 2025-03-10 Jovan Mikić