Binomial coefficients have been used for centuries in a variety of fields and have accumulated numerous definitions. In this paper, we introduce a new way of defining binomial coefficients as repeated sums of ones. A multitude of binomial coefficient identities will be shown in order to prove this definition. Using this new definition, we simplify some particular sums such as the repeated Harmonic sum and the repeated Binomial-Harmonic sum. We derive formulae for simplifying general <i> repeated sums</i> as well as a variant containing binomial coefficients. Additionally, we study the \(m\)-th difference of a sequence and show how sequences whose \(m\)-th difference is constant can be related to binomial coefficients.
Repeated integration is a major topic of integral calculus. In this article, we study repeated integration. In particular, we study repeated integrals and recurrent integrals. For each of these integrals, we develop reduction formulae for both the definite as well as indefinite form. These reduction formulae express these repetitive integrals in terms of single integrals. We also derive a generalization of the fundamental theorem of calculus that expresses a definite integral in terms of an indefinite integral for repeated and recurrent integrals. From the recurrent integral formulae, we derive some partition identities. Then we provide an explicit formula for the \(n\)-th integral of \(x^m(\ln x)^{m'}\) in terms of a shifted multiple harmonic star sum. Additionally, we use this integral to derive new expressions for the harmonic sum and repeated harmonic sum.
Multiple zeta star values have become a central concept in number theory with a wide variety of applications. In this article, we propose a generalization, which we will refer to as recurrent sums, where the reciprocals are replaced by arbitrary sequences. We introduce a toolbox of formulas for the manipulation of such sums. We begin by developing variation formulas that allow the variation of a recurrent sum of order $m$ to be expressed in terms of lower order recurrent sums. We then proceed to derive theorems (which we will call inversion formulas) which show how to interchange the order of summation in a multitude of ways. Later, we introduce a set of new partition identities in order to then prove a reduction theorem which permits the expression of a recurrent sum in terms of a combination of non-recurrent sums. Finally, we use these theorems to derive new results for multiple zeta star values and recurrent sums of powers.
Leibniz’s rule for the \(n\)-th derivative of a product is a very well-known and extremely useful formula. This article introduces an analogous explicit formula for the \(n\)-th derivative of a quotient of two functions. Later, we use this formula to derive new partition identities and to develop expressions for some particular \(n\)-th derivatives.
{\bf Abstract:} Multiple zeta values have become of great interest due to their numerous applications in mathematics and physics. In this article, we present a generalization, which we will refer to as multiple sums, where the reciprocals are replaced with arbitrary sequences. We develop formulae to help with manipulating such sums. We develop variation formulae that express the variation of multiple sums in terms of lower order multiple sums. Additionally, we derive a set of partition identities that we use to prove a reduction theorem that expresses multiple sums as a combination of simple sums. We present a variety of applications including applications concerning polynomials and MZVs such as generating functions and expressions for $\zeta(\{2p\}_m)$ and $\zeta^\star(\{2p\}_m)$. Finally, we establish the connection between multiple sums and a type of sums called recurrent sums. By exploiting this connection, we provide additional partition identities for odd and even partitions.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.