Related papers: On Binomial Identities in Arbitrary Bases
We obtain new combinatorial identities for integral values of binary Krawtchouk polynomials $K^{2m}_p(x)$, $0\le p\le 2m$, by computing the characters of the $p$-exterior representations on certain elements of order 2 of $\mathrm{SO}(2m)$.…
This is a survey of some recent developments in the theory of associative and nonassociative dialgebras, with an emphasis on polynomial identities and multilinear operations. We discuss associative, Lie, Jordan, and alternative algebras,…
Binomial Cayley graphs are obtained by considering the binomial coefficient of the weight function of a given Cayley graph and a natural number. We introduce these objects and study two families: one associated with symmetric groups and the…
The Jacobi identity is one of the properties that are used to define the concept of Lie algebra and in this context is closely related to associativity. In this paper we provide a complete description of all bivariate polynomials that…
Using generating functions, we derive many identities involving balancing and Lucas-balancing polynomials. By relating these polynomials to Chebyshev polynomials of the first and second kind, and Fibonacci and Lucas numbers, we offer some…
We introduce a natural generalization of Maya diagrams -- the space of infinite Fibonacci configurations, which are specified functions on $\mathbb{Z}$ with values $1$ and $0$. Infinite Fibonacci configurations are particularly interesting…
We perform certain alternating binomial summations with parameters that occur in the analysis of algorithms. A combination of integral and special function and special number representations is used. The results are sufficiently general to…
In this note, using the derangement polynomials and their umbral representation, we give another simple proof of an identity conjectured by Lacasse in the study of the PAC-Bayesian machine learning theory.
We provide lower bounds for p-adic valuations of multisums of factorial ratios which satisfy an Ap\'ery-like recurrence relation: these include Ap\'ery, Domb, Franel numbers, the numbers of abelian squares over a finite alphabet, and…
Sury's 2014 proof of an identity for Fibonacci and Lucas numbers (Identity 236 of Benjamin and Quinn's 2003 book: {\em Proofs that count: The art of combinatorial proof}) has excited a lot of comment. We give an alternate, telescoping,…
Some properties of diagonal binomial coefficients were studied in respect to frequency of their units digits. An approach was formulated that led to use of difference tables to predict if certain units digits can appear in the values of…
Using a probabilistic approach, we derive several interesting identities involving beta functions. Our results generalize certain well-known combinatorial identities involving binomial coefficients and gamma functions.
Many digital functions studied in the literature, e.g., the summatory function of the base-$k$ sum-of-digits function, have a behavior showing some periodic fluctuation. Such functions are usually studied using techniques from analytic…
We study the Fibonacci and Lucas numbers and demonstrate how identities can be constructed by investigating trivalent graphs and splitting fields.
In 2016, Edgar and, independently of him, Bhatnagar sta\-ted a nice polynomial identity that connects Fibonacci and Lucas numbers. Shortly after their publications, this identity has been generalized in two different ways: Dafnis, Phillipou…
In this paper, we give some new and interesting identities which are derived from the basis of Frobenius-Euler. Recently, Simsek et als(see [13]) have given some identities of q-analogue of Frobenius-Euler polynomials related to q-Bernstein…
C.H. Yang discovered a polynomial version of the classical Lagrange identity expressing the product of two sums of four squares as another sum of four squares. He used it to give short proofs of some important theorems on composition of…
In this paper we obtain several new identities for Bernoulli and Euler polynomials; some of them extend Miki's and Matiyasevich's identities. Our new method involves differences and derivatives of polynomials.
In [Y.~K.~Hu, K.~A.~Kopotun, X.~M.~Yu, Constr. Approx. 2000], the authors have obtained a characterization of best $n$-term piecewise polynomial approximation spaces as real interpolation spaces between $L^p$ and some spaces of bounded…
We present a computer algebra approach to proving identities on Bernoulli polynomials and Euler polynomials by using the extended Zeilberger's algorithm given by Chen, Hou and Mu. The key idea is to use the contour integral definitions of…