scholarly journals Combinatorial sums and binomial identities associated with the Beta-type polynomials

2017 ◽  
Vol 48 (2) ◽  
Author(s):  
Yılmaz Şimşek
Author(s):  
Taoufik Sabar

Combinatorial sums and binomial identities have appeared in many branches of mathematics, physics, and engineering. They can be established by many techniques, from generating functions to special series. Here, using a simple mathematical induction principle, we obtain a new combinatorial sum that involves ordinary powers, falling powers, and binomial coefficient at once. This way, and without the use of any complicated analytic technique, we obtain a result that already exists and a generalization of an identity derived from Sterling numbers of the second kind. Our formula is new, genuine, and several identities can be derived from it. The findings of this study can help for better understanding of the relation between ordinary and falling powers, which both play a very important role in discrete mathematics.


Author(s):  
ROBERTO TAURASO
Keyword(s):  

Abstract Let p be a prime and let x be a p-adic integer. We prove two supercongruences for truncated series of the form $$\begin{align*}\sum_{k=1}^{p-1} \frac{(x)_k}{(1)_k}\cdot \frac{1}{k}\sum_{1\le j_1\le\cdots\le j_r\le k}\frac{1}{j_1^{}\cdots j_r^{}}\quad\mbox{and}\quad \sum_{k=1}^{p-1} \frac{(x)_k(1-x)_k}{(1)_k^2}\cdot \frac{1}{k}\sum_{1\le j_1\le\cdots\le j_r\le k}\frac{1}{j_1^{2}\cdots j_r^{2}}\end{align*}$$ which generalise previous results. We also establish q-analogues of two binomial identities.


2012 ◽  
Vol 2012 ◽  
pp. 1-18 ◽  
Author(s):  
GwangYeon Lee ◽  
Mustafa Asci

Riordan arrays are useful for solving the combinatorial sums by the help of generating functions. Many theorems can be easily proved by Riordan arrays. In this paper we consider the Pascal matrix and define a new generalization of Fibonacci polynomials called(p,q)-Fibonacci polynomials. We obtain combinatorial identities and by using Riordan method we get factorizations of Pascal matrix involving(p,q)-Fibonacci polynomials.


10.37236/2010 ◽  
2011 ◽  
Vol 18 (2) ◽  
Author(s):  
Justin Brereton ◽  
Amelia Farid ◽  
Maryam Karnib ◽  
Gary Marple ◽  
Alex Quenon ◽  
...  

This paper focuses on two binomial identities. The proofs illustrate the power and elegance in enumerative/algebraic combinatorial arguments, modern machine-assisted techniques of Wilf-Zeilberger and the classical tools of generatingfunctionology.


Filomat ◽  
2016 ◽  
Vol 30 (4) ◽  
pp. 937-943 ◽  
Author(s):  
Buket Simsek ◽  
Ahmet Yardimci

In this paper we survey the 3D reconstruction of an object from its 2D cross-sections has many applications in different fields of sciences such as medical physics and biomedical applications. The aim of this paper is to give not only the Bezier curves in medical applications, but also by using generating functions for the Bernstein basis functions and their identities, some combinatorial sums involving binomial coefficients are deriven. Finally, we give some comments related to the above areas.


Author(s):  
W.-S. Chou ◽  
L. C. Hsu ◽  
P. J.-S. Shiue

The object of this paper is to show that generalized Stirling numbers can be effectively used to evaluate a class of combinatorial sums involving generalized factorials.


2017 ◽  
Vol 2018 (23) ◽  
pp. 7335-7358
Author(s):  
Akishi Kato ◽  
Yuma Mizuno ◽  
Yuji Terashima

Sign in / Sign up

Export Citation Format

Share Document