scholarly journals A Note on the Difference of Powers and Falling Powers

2021 ◽  
Vol 2021 ◽  
pp. 1-4
Author(s):  
Taoufik Sabar
Keyword(s):  
Generating Functions ◽  
Binomial Coefficient ◽  
Mathematical Induction ◽  
Discrete Mathematics ◽  
Special Series ◽  
Induction Principle ◽  
Combinatorial Sums ◽  
The Difference ◽  
Binomial Identities

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.

scholarly journals Some Properties of the(p,q)-Fibonacci and(p,q)-Lucas Polynomials

2012 ◽  
Vol 2012 ◽  
pp. 1-18 ◽  
Author(s):  
GwangYeon Lee ◽  
Mustafa Asci
Keyword(s):  
Generating Functions ◽  
Combinatorial Identities ◽  
Fibonacci Polynomials ◽  
Lucas Polynomials ◽  
Pascal Matrix ◽  
Riordan Arrays ◽  
Combinatorial Sums

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.

scholarly journals Discrete Mathematics into K-11 and K-12 Grade Education

2021 ◽  
Vol 23 (05) ◽  
pp. 319-324
Author(s):  
Mr. Balaji. N ◽  
◽  
Dr. Karthik Pai B H ◽  
Keyword(s):  
Set Theory ◽  
Mathematical Reasoning ◽  
Mathematical Induction ◽  
Discrete Mathematics ◽  
College Classrooms ◽  
Underlying Principle ◽  
Education Study ◽  
Strongly Connected ◽  
Proof Techniques ◽  
K 12

Discrete mathematics is one of the significant part of K-11 and K-12 grade college classrooms. In this contribution, we discuss the usefulness of basic elementary, some of the intermediate discrete mathematics for K-11 and K-12 grade colleges. Then we formulate the targets and objectives of this education study. We introduced the discrete mathematics topics such as set theory and their representation, relations, functions, mathematical induction and proof techniques, counting and its underlying principle, probability and its theory and mathematical reasoning. Core of this contribution is proof techniques, counting and mathematical reasoning. Since all these three concepts of discrete mathematics is strongly connected and creates greater impact on students. Moreover, it is potentially useful in their life also out of the college study. We explain the importance, applications in computer science and the comments regarding introduction of such topics in discrete mathematics. Last part of this article provides the theoretical knowledge and practical usability will strengthen the made them understand easily.

scholarly journals Generating Functions for New Families of Combinatorial Numbers and Polynomials: Approach to Poisson–Charlier Polynomials and Probability Distribution Function

Axioms ◽  
2019 ◽  
Vol 8 (4) ◽  
pp. 112 ◽  
Author(s):  
Irem Kucukoglu ◽  
Burcin Simsek ◽  
Yilmaz Simsek
Keyword(s):  
Probability Distribution ◽  
Generating Functions ◽  
Stirling Numbers ◽  
Bernoulli Numbers ◽  
Distribution Functions ◽  
Binomial Coefficients ◽  
Bell Polynomials ◽  
Exponential Polynomials ◽  
Charlier Polynomials ◽  
Combinatorial Sums

The aim of this paper is to construct generating functions for new families of combinatorial numbers and polynomials. By using these generating functions with their functional and differential equations, we not only investigate properties of these new families, but also derive many new identities, relations, derivative formulas, and combinatorial sums with the inclusion of binomials coefficients, falling factorial, the Stirling numbers, the Bell polynomials (i.e., exponential polynomials), the Poisson–Charlier polynomials, combinatorial numbers and polynomials, the Bersntein basis functions, and the probability distribution functions. Furthermore, by applying the p-adic integrals and Riemann integral, we obtain some combinatorial sums including the binomial coefficients, falling factorial, the Bernoulli numbers, the Euler numbers, the Stirling numbers, the Bell polynomials (i.e., exponential polynomials), and the Cauchy numbers (or the Bernoulli numbers of the second kind). Finally, we give some remarks and observations on our results related to some probability distributions such as the binomial distribution and the Poisson distribution.

Good’s theory of cascade processes applied to the statistics of polymer distributions

1962 ◽  
Vol 268 (1333) ◽  
pp. 240-256 ◽  
Keyword(s):  
Molecular Weight ◽  
Generating Functions ◽  
Repeat Unit ◽  
Average Molecular Weight ◽  
Stochastic Theory ◽  
Direct Calculation ◽  
Gel Point ◽  
Statistical Parameters ◽  
Cascade Processes ◽  
The Difference

Important statistics of polymerization reactions, whether of the condensation or addition type, can be calculated rather simply and in a standardized way, by an adaptation of Good’s stochastic theory of cascade processes. Examples of such statistics are the various molecular weight averages, the gel point, and the sol fraction. The use of generating functions in the theory greatly reduces the use of probability theory and it allows the direct calculation of the required statistics without the need of explicit expressions for the distributions concerned, or for the summations required in calculating their moments. The generating functions required are mostly combinations of powers of the basic form (1— α) θ 1 + αθ 2 where θ 1 and θ 2 are dummy variables (or unity) and α some parameter measuring the conversion of a functionality. Ordinary (non-vectorial) generating functions suffice when the system contains essentially one type of repeat unit, but for copolymers (in a broad sense) generalization to vectorial generating functions is required. Calculations of the former type, useful in describing the principles involved, include the calculation of new sol-fraction equations for simple polycondensation reactions, and a somewhat more exact sol-fraction equation for the vulcanization of chains initially distributed randomly in length. Copolymerization systems are then exemplified by calculating the weight-average molecular weight and sol fraction for the system glycerol/adipic acid from general formulae derived. Exact allowance is made for the statistical effects due to complete or partial elimination of water and to the difference in rate of esterification of primary and secondary hydroxyls. The gel-point condition for a system involving copolymerization of s different units is generally found by equating to zero a determinant of order s . The mechanism of polycondensation reactions could be elucidated by comparing experimental measurements of the statistical parameters with those calculated from postulated kinetic schemes using the unified and comparatively simple theory here presented.

scholarly journals Identities and derivative formulas for the combinatorial and Apostol-Euler type numbers by their generating functions

Filomat ◽  
2018 ◽  
Vol 32 (20) ◽  
pp. 6879-6891
Author(s):  
Irem Kucukoglu ◽  
Yilmaz Simsek
Keyword(s):  
Recurrence Relation ◽  
Generating Functions ◽  
Stirling Numbers ◽  
Bell Numbers ◽  
New Family ◽  
Derivative Formulas ◽  
Combinatorial Sums ◽  
Computation Algorithm ◽  
Fractional Derivative Operators ◽  
And Inversion

The first aim of this paper is to give identities and relations for a new family of the combinatorial numbers and the Apostol-Euler type numbers of the second kind, the Stirling numbers, the Apostol-Bernoulli type numbers, the Bell numbers and the numbers of the Lyndon words by using some techniques including generating functions, functional equations and inversion formulas. The second aim is to derive some derivative formulas and combinatorial sums by applying derivative operators including the Caputo fractional derivative operators. Moreover, we give a recurrence relation for the Apostol-Euler type numbers of the second kind. By using this recurrence relation, we construct a computation algorithm for these numbers. In addition, we derive some novel formulas including the Stirling numbers and other special numbers. Finally, we also some remarks, comments and observations related to our results.

scholarly journals Accuracy of Approximation for Discrete Distributions

2016 ◽  
Vol 2016 ◽  
pp. 1-6
Author(s):  
Tamás F. Móri
Keyword(s):  
Total Variation ◽  
Generating Functions ◽  
Probability Distributions ◽  
Discrete Distributions ◽  
Discrete Probability ◽  
Order Of Magnitude ◽  
Variation Distance ◽  
The Difference ◽  
Discrete Probability Distributions ◽  
Accuracy Of Approximation

The paper is a contribution to the problem of estimating the deviation of two discrete probability distributions in terms of the supremum distance between their generating functions over the interval [0,1]. Deviation can be measured by the difference of the kth terms or by total variation distance. Our new bounds have better order of magnitude than those proved previously, and they are even sharp in certain cases.

Multisection of series

2016 ◽  
Vol 100 (549) ◽  
pp. 460-470
Author(s):  
Raymond A. Beauregard ◽  
Vladimir A. Dobrushkin
Keyword(s):  
Generating Functions ◽  
Analysis Of Algorithms ◽  
Binomial Coefficients ◽  
Discrete Mathematics ◽  
Mathematical Tool ◽  
New Birth ◽  
Leonhard Euler ◽  
Finite Sums ◽  
Symbolic Methods ◽  
Infinite Sums

In a recent paper [1], the authors gave a combinatorial interpretation to sums of equally spaced binomial coefficients. Others have been interested in finding such sums, known as multisection of series. For example, Gould [2] derived interesting formulas but much of his work involved complicated manipulations of series. When the combinatorial approach can be implemented, it is neat and efficient. In this paper, we present another approach for finding equally spaced sums. We consider both infinite sums and partial finite sums based on generating functions and extracting coefficients.While generating functions were first introduced by Abraham de Moivre at the end of seventeen century, its systematic use in combinatorial analysis was inspired by Leonhard Euler. Generating functions got a new birth in the twentieth century as a part of symbolic methods. As a central mathematical tool in discrete mathematics, generating functions are an essential part of the curriculum in the analysis of algorithms [3, 4]. They provide a bridge between discrete and continuous mathematics, as illustrated by the fact that the generating functions presented here appear as solutions to corresponding differential equations.

scholarly journals New classes of recurrence relations involving hyperbolic functions, special numbers and polynomials

2021 ◽  
pp. 15-15
Author(s):  
Yilmaz Simsek
Keyword(s):  
Generating Functions ◽  
Recurrence Relations ◽  
Stirling Numbers ◽  
Umbral Calculus ◽  
Discrete Mathematics ◽  
New Class ◽  
Integral Formulas ◽  
Euler Numbers And Polynomials ◽  
Derivative Formulas ◽  
Special Numbers And Polynomials

By using the calculus of finite differences methods and the umbral calculus, we construct recurrence relations for a new class of special numbers. Using this recurrence relation, we define generating functions for this class of special numbers and also new classes of special polynomials. We investigate some properties of these generating functions. By using these generating functions with their functional equations, we obtain many new and interesting identities and relations related to these classes of special numbers and polynomials, the Bernoulli numbers and polynomials, the Euler numbers and polynomials, the Stirling numbers. Finally, some derivative formulas and integral formulas for these classes of special numbers and polynomials are given. In general, this article includes results that have the potential to be used in areas such as discrete mathematics, combinatorics analysis and their applications.

scholarly journals Induction Models on $\mathbb{N}$

10.29007/kvp3 ◽  
2020 ◽  
Author(s):  
A. Dileep ◽  
Kuldeep S. Meel ◽  
Ammar F. Sabili
Keyword(s):  
Computer Science ◽  
Generating Function ◽  
Generating Functions ◽  
Mathematical Induction ◽  
Base Case ◽  
And Mathematics ◽  
Definition Of ◽  
Induction Model

Mathematical induction is a fundamental tool in computer science and mathematics. Henkin [12] initiated the study of formalization of mathematical induction restricted to the setting when the base case B is set to singleton set containing 0 and a unary generating function S. The usage of mathematical induction often involves wider set of base cases and k−ary generating functions with different structural restrictions. While subsequent studies have shown several Induction Models to be equivalent, there does not exist precise logical characterization of reduction and equivalence among different Induction Models. In this paper, we generalize the definition of Induction Model and demonstrate existence and construction of S for given B and vice versa. We then provide a formal characterization of the reduction among different Induction Models that can allow proofs in one Induction Models to be expressed as proofs in another Induction Models. The notion of reduction allows us to capture equivalence among Induction Models.

Sign in / Sign up

Export Citation Format

Share Document