scholarly journals Generating Functions for Certain Weighted Cranks

2022 ◽  
Vol Volume 44 - Special... ◽  
Author(s):  
Shreejit Bandyopadhyay ◽  
Ae Yee
Keyword(s):  
Generating Function ◽  
Generating Functions ◽  
Colored Partitions ◽  
Unimodal Sequences

Recently, George Beck posed many interesting partition problems considering the number of ones in partitions. In this paper, we first consider the crank generating function weighted by the number of ones and obtain analytic formulas for this weighted crank function under conditions of the crank being less than or equal to some specific integer. We connect these cumulative and point crank functions to the generating functions of partitions with certain sizes of Durfee rectangles. We then consider a generalization of the crank for $k$-colored partitions, which was first introduced by Fu and Tang, and investigate the corresponding generating function for this crank weighted by the number of parts in the first subpartition of a $k$-colored partition. We show that the cumulative generating functions are the same as the generating functions for certain unimodal sequences.

scholarly journals A General Family of q-Hypergeometric Polynomials and Associated Generating Functions

Mathematics ◽  
2021 ◽  
Vol 9 (11) ◽  
pp. 1161
Author(s):  
Hari Mohan Srivastava ◽  
Sama Arjika
Keyword(s):  
Generating Function ◽  
Generating Functions ◽  
Hypergeometric Functions ◽  
Additional Parameter ◽  
Physical Sciences ◽  
General Family ◽  
Hypergeometric Polynomials

Basic (or q-) series and basic (or q-) polynomials, especially the basic (or q-) hypergeometric functions and the basic (or q-) hypergeometric polynomials are studied extensively and widely due mainly to their potential for applications in many areas of mathematical and physical sciences. Here, in this paper, we introduce a general family of q-hypergeometric polynomials and investigate several q-series identities such as an extended generating function and a Srivastava-Agarwal type bilinear generating function for this family of q-hypergeometric polynomials. We give a transformational identity involving generating functions for the generalized q-hypergeometric polynomials which we have introduced here. We also point out relevant connections of the various q-results, which we investigate here, with those in several related earlier works on this subject. We conclude this paper by remarking that it will be a rather trivial and inconsequential exercise to give the so-called (p,q)-variations of the q-results, which we have investigated here, because the additional parameter p is obviously redundant.

scholarly journals Labels distance in bucket recursive trees with variable capacities of buckets

2021 ◽  
Vol 13 (2) ◽  
pp. 413-426
Author(s):  
S. Naderi ◽  
R. Kazemi ◽  
M. H. Behzadi
Keyword(s):  
Partial Differential Equations ◽  
Probability Distribution ◽  
Differential Equations ◽  
Generating Function ◽  
Generating Functions ◽  
Function Approach ◽  
Closed Formula ◽  
Tree Model ◽  
Partial Differential ◽  
Recursive Trees

Abstract The bucket recursive tree is a natural multivariate structure. In this paper, we apply a trivariate generating function approach for studying of the depth and distance quantities in this tree model with variable bucket capacities and give a closed formula for the probability distribution, the expectation and the variance. We show as j → ∞, lim-iting distributions are Gaussian. The results are obtained by presenting partial differential equations for moment generating functions and solving them.

COUNTING NUMERICAL SEMIGROUPS WITH SHORT GENERATING FUNCTIONS

2011 ◽  
Vol 21 (07) ◽  
pp. 1217-1235 ◽  
Author(s):  
VÍCTOR BLANCO ◽  
PEDRO A. GARCÍA-SÁNCHEZ ◽  
JUSTO PUERTO
Keyword(s):  
Generating Function ◽  
Polynomial Time ◽  
Generating Functions ◽  
Time Complexity ◽  
Frobenius Number ◽  
Numerical Semigroups ◽  
Polynomial Time Complexity ◽  
Theoretical Results

This paper presents a new methodology to compute the number of numerical semigroups of given genus or Frobenius number. We apply generating function tools to the bounded polyhedron that classifies the semigroups with given genus (or Frobenius number) and multiplicity. First, we give theoretical results about the polynomial-time complexity of counting these semigroups. We also illustrate the methodology analyzing the cases of multiplicity 3 and 4 where some formulas for the number of numerical semigroups for any genus and Frobenius number are obtained.

A General Asymptotic Scheme for the Analysis of Partition Statistics

2014 ◽  
Vol 23 (6) ◽  
pp. 1057-1086 ◽  
Author(s):  
PETER J. GRABNER ◽  
ARNOLD KNOPFMACHER ◽  
STEPHAN WAGNER
Keyword(s):  
Generating Function ◽  
Asymptotic Expansions ◽  
Generating Functions ◽  
Singularity Analysis ◽  
Higher Moments ◽  
Integer Partitions ◽  
Classical Singularity ◽  
Random Integer ◽  
Partition Statistics ◽  
New Statistics

We consider statistical properties of random integer partitions. In order to compute means, variances and higher moments of various partition statistics, one often has to study generating functions of the form P(x)F(x), where P(x) is the generating function for the number of partitions. In this paper, we show how asymptotic expansions can be obtained in a quasi-automatic way from expansions of F(x) around x = 1, which parallels the classical singularity analysis of Flajolet and Odlyzko in many ways. Numerous examples from the literature, as well as some new statistics, are treated via this methodology. In addition, we show how to compute further terms in the asymptotic expansions of previously studied partition statistics.

Polynomial bounds for probability generating functions

1975 ◽  
Vol 12 (3) ◽  
pp. 507-514 ◽  
Author(s):  
Henry Braun
Keyword(s):  
Lower Bound ◽  
Generating Function ◽  
Generating Functions ◽  
Branching Process ◽  
Probability Generating Function ◽  
Extinction Time ◽  
Probability Generating Functions ◽  
Extinction Probabilities ◽  
Polynomial Bounds

The problem of approximating an arbitrary probability generating function (p.g.f.) by a polynomial is considered. It is shown that if the coefficients rj are chosen so that LN(·) agrees with g(·) to k derivatives at s = 1 and to (N – k) derivatives at s = 0, then LN is in fact an upper or lower bound to g; the nature of the bound depends only on k and not on N. Application of the results to the problems of finding bounds for extinction probabilities, extinction time distributions and moments of branching process distributions are examined.

scholarly journals Restricted k-color partitions, II

2020 ◽  
pp. 1-11
Author(s):  
William J. Keith
Keyword(s):  
Generating Function ◽  
Colored Partitions

We consider [Formula: see text]-colored partitions, partitions in which [Formula: see text] colors exist but at most [Formula: see text] colors may be chosen per size of part. In particular these generalize overpartitions. Advancing previous work, we find new congruences, including in previously unexplored cases where [Formula: see text] and [Formula: see text] are not coprime, as well as some noncongruences. As a useful aside, we give the apparently new generating function for the number of partitions in the [Formula: see text] box with a given number of part sizes, and extend to multiple colors a conjecture of Dousse and Kim on unimodality in overpartitions.

scholarly journals A PROOF OF ANDREWS’ CONJECTURE ON PARTITIONS WITH NO SHORT SEQUENCES

2019 ◽  
Vol 7 ◽  
Author(s):  
DANIEL M. KANE ◽  
ROBERT C. RHOADES
Keyword(s):  
Asymptotic Behavior ◽  
Modular Form ◽  
Generating Function ◽  
Generating Functions ◽  
Asymptotic Properties ◽  
Bootstrap Percolation ◽  
Asymptotic Result ◽  
Integer Partitions ◽  
Mock Modular Form ◽  
Precise Asymptotic

Our main result establishes Andrews’ conjecture for the asymptotic of the generating function for the number of integer partitions of$n$without$k$consecutive parts. The methods we develop are applicable in obtaining asymptotics for stochastic processes that avoid patterns; as a result they yield asymptotics for the number of partitions that avoid patterns.Holroyd, Liggett, and Romik, in connection with certain bootstrap percolation models, introduced the study of partitions without$k$consecutive parts. Andrews showed that when$k=2$, the generating function for these partitions is a mixed-mock modular form and, thus, has modularity properties which can be utilized in the study of this generating function. For$k>2$, the asymptotic properties of the generating functions have proved more difficult to obtain. Using$q$-series identities and the$k=2$case as evidence, Andrews stated a conjecture for the asymptotic behavior. Extensive computational evidence for the conjecture in the case$k=3$was given by Zagier.This paper improved upon early approaches to this problem by identifying and overcoming two sources of error. Since the writing of this paper, a more precise asymptotic result was established by Bringmann, Kane, Parry, and Rhoades. That approach uses very different methods.

On the symplectically invariant variational principle and generating functions

1990 ◽  
Vol 431 (1883) ◽  
pp. 403-417 ◽  
Keyword(s):  
Quantum Mechanics ◽  
Variational Principle ◽  
Generating Function ◽  
Generating Functions ◽  
Geometric Approach ◽  
Canonical Transformations ◽  
Weyl Transform ◽  
Analogous Relation ◽  
Definition Of ◽  
Symplectic Invariance

The generating function for canonical transformations derived by Marinov has the important property of symplectic invariance (i. e. under linear canonical transformations). However, a more geometric approach to the rederivation of this function from the variational principle reveals that it is not free from caustic singularities after all. These singularities can be avoided without breaking the symplectic invariance by the definition of a complementary generating function bearing an analogous relation to the Woodward ambiguity function in telecommunications theory as that tying Marinov’s function to the Wigner function and the Weyl transform in quantum mechanics. Marinov’s function is specially apt to describe canonical transformations close to the identity, but breaks down for reflections through a point in phase space, easily described by the new generating function.

scholarly journals Distribution Function, Probability Generating Function and Archimedean Generator

Symmetry ◽  
2020 ◽  
Vol 12 (12) ◽  
pp. 2108
Author(s):  
Weaam Alhadlaq ◽  
Abdulhamid Alzaid
Keyword(s):  
Distribution Function ◽  
Generating Function ◽  
Generating Functions ◽  
Probability Generating Function ◽  
Distribution Functions ◽  
Cumulative Distribution ◽  
Archimedean Copulas ◽  
Cumulative Distribution Functions ◽  
Probability Generating Functions ◽  
Real Functions

Archimedean copulas form a very wide subclass of symmetric copulas. Most of the popular copulas are members of the Archimedean copulas. These copulas are obtained using real functions known as Archimedean generators. In this paper, we observe that under certain conditions the cumulative distribution functions on (0, 1) and probability generating functions can be used as Archimedean generators. It is shown that most of the well-known Archimedean copulas can be generated using such distributions. Further, we introduced new Archimedean copulas.

scholarly journals On the p,q-Humbert Functions from the View Point of the Generating Function Method

2020 ◽  
Vol 2020 ◽  
pp. 1-16
Author(s):  
Ayman Shehata
Keyword(s):  
Generating Function ◽  
Generating Functions ◽  
Function Method ◽  
Recurrence Relations ◽  
View Point ◽  
Starting Point ◽  
Explicit Representations

The main object of the present paper is to construct new p,q-analogy definitions of various families of p,q-Humbert functions using the generating function method as a starting point. This study shows a class of several results of p,q-Humbert functions with the help of the generating functions such as explicit representations and recurrence relations, especially differential recurrence relations, and prove some of their significant properties of these functions.

Sign in / Sign up

Export Citation Format

Share Document