scholarly journals Greatest Descents after any Maxima in Compositions

10.37236/5303 ◽  
2015 ◽  
Vol 22 (4) ◽  
Author(s):  
Margaret Archibald ◽  
Aubrey Blecher ◽  
Charlotte Brennan ◽  
Arnold Knopfmacher
Keyword(s):  
Generating Functions ◽  
Mellin Transforms ◽  
Asymptotic Expressions ◽  
Positive Integers

In this paper, compositions of $n$ are studied. These are sequences of positive integers $(\sigma_i)_{i=1}^k$ whose sum is $n$. We define a maximum to be a part which is greater than or equal to all other parts. We investigate the size of the descents immediately following any maximum and we focus particularly on the largest and average of these, obtaining the generating functions in each case. Using Mellin transforms, we obtain asymptotic expressions for these quantities.

scholarly journals Descents after maxima in compositions

2014 ◽  
Vol Vol. 16 no. 1 (Combinatorics) ◽  
Author(s):  
Aubrey Blecher ◽  
Charlotte Brennan ◽  
Arnold Knopfmacher
Keyword(s):  
Generating Functions ◽  
Mellin Transforms ◽  
Asymptotic Expressions ◽  
International Audience ◽  
Average Size ◽  
Positive Integers

Combinatorics International audience We consider compositions of n, i.e., sequences of positive integers (or parts) (σi)i=1k where σ1+σ2+...+σk=n. We define a maximum to be any part which is not less than any other part. The variable of interest is the size of the descent immediately following the first and the last maximum. Using generating functions and Mellin transforms, we obtain asymptotic expressions for the average size of these descents. Finally, we show with the use of a simple bijection between the compositions of n for n>1, that on average the descent after the last maximum is greater than the descent after the first.

On some new types of partitions associated with generalized ferrers graphs

1951 ◽  
Vol 47 (4) ◽  
pp. 679-686 ◽  
Author(s):  
F. C. Auluck
Keyword(s):  
Positive Integer ◽  
Generating Functions ◽  
Crystal Surfaces ◽  
Asymptotic Expressions ◽  
Ferrers Graphs ◽  
Image Position ◽  
Positive Integers

1. In this paper we find generating functions and asymptotic expressions for the number of partitions of a positive integer n into two sets of positive integers satisfying the conditionsThe set ‘b’ can be empty. Such partitions are considered by Temperley (1) in a forth-coming paper on the roughness of crystal surfaces. We shall consider them in more detail and under different sets of conditions on the a's and b's.

Short Generating Functions for some Semigroup Algebras

10.37236/1729 ◽  
2003 ◽  
Vol 10 (1) ◽  
Author(s):  
Graham Denham
Keyword(s):  
Rational Function ◽  
Generating Functions ◽  
Hilbert Series ◽  
Simple Expression ◽  
Arbitrary Field ◽  
Graded Algebra ◽  
Semigroup Algebras ◽  
Positive Integers

Let $a_1,\ldots,a_n$ be distinct, positive integers with $(a_1,\ldots,a_n)=1$, and let k be an arbitrary field. Let $H(a_1,\ldots,a_n;z)$ denote the Hilbert series of the graded algebra k$[t^{a_1},t^{a_2},\ldots,t^{a_n}]$. We show that, when $n=3$, this rational function has a simple expression in terms of $a_1,a_2,a_3$; in particular, the numerator has at most six terms. By way of contrast, it is known that no such expression exists for any $n\geq4$.

scholarly journals Generating functions and congruences for 9-regular and 27-regular partitions in 3 colours

2022 ◽  
Vol Volume 44 - Special... ◽  
Author(s):  
Nayandeep Deka Baruah ◽  
Hirakjyoti Das
Keyword(s):  
Generating Functions ◽  
Regular Partitions ◽  
Positive Integers

Let $b_{\ell;3}(n)$ denote the number of $\ell$-regular partitions of $n$ in 3 colours. In this paper, we find some general generating functions and new infinite families of congruences modulo arbitrary powers of $3$ when $\ell\in\{9,27\}$. For instance, for positive integers $n$ and $k$, we have\begin{align*}b_{9;3}\left(3^k\cdot n+3^k-1\right)&\equiv0~\left(\textup{mod}~3^{2k}\right),\\b_{27;3}\left(3^{2k+3}\cdot n+\dfrac{3^{2k+4}-13}{4}\right)&\equiv0~\left(\textup{mod}~3^{2k+5}\right).\end{align*}

The Enumeration of Maps on the Torus and the Projective Plane

1988 ◽  
Vol 31 (3) ◽  
pp. 257-271 ◽  
Author(s):  
E. A. Bender ◽  
E. R. Canfield ◽  
R. W. Robinson
Keyword(s):  
Projective Plane ◽  
Generating Functions ◽  
Recurrence Relations ◽  
Embedded Graphs ◽  
Asymptotic Expressions ◽  
Explicit Expressions

AbstractThe enumeration of rooted maps (embedded graphs), by number of edges, on the torus and projective plane, is studied. Explicit expressions for the generating functions are obtained. From these are derived asymptotic expressions and recurrence relations. Numerical tables for the numbers with up to 20 edges are presented.

scholarly journals Asymptotic counting theorems for primitive juggling patterns

2019 ◽  
Vol 15 (05) ◽  
pp. 1037-1050
Author(s):  
Erik R. Tou
Keyword(s):  
Prime Number ◽  
Generating Functions ◽  
Arbitrary Number ◽  
Mathematical Theory ◽  
Prime Number Theorem ◽  
Prime Numbers ◽  
Theoretical Framework ◽  
Positive Integers ◽  
Infinite Set ◽  
Fixed Period

The mathematics of juggling emerged after the development of siteswap notation in the 1980s. Consequently, much work was done to establish a mathematical theory that describes and enumerates the patterns that a juggler can (or would want to) execute. More recently, mathematicians have provided a broader picture of juggling sequences as an infinite set possessing properties similar to the set of positive integers. This theoretical framework moves beyond the physical possibilities of juggling and instead seeks more general mathematical results, such as an enumeration of juggling patterns with a fixed period and arbitrary number of balls. One problem unresolved until now is the enumeration of primitive juggling sequences, those fundamental juggling patterns that are analogous to the set of prime numbers. By applying analytic techniques to previously-known generating functions, we give asymptotic counting theorems for primitive juggling sequences, much as the prime number theorem gives asymptotic counts for the prime positive integers.

scholarly journals Generating Functions for Permutations which Contain a Given Descent Set

10.37236/299 ◽  
2010 ◽  
Vol 17 (1) ◽  
Author(s):  
Jeffrey Remmel ◽  
Manda Riehl
Keyword(s):  
Symmetric Group ◽  
Generating Functions ◽  
Symmetric Function ◽  
Schur Functions ◽  
Permutation Statistics ◽  
Finite Set ◽  
Set Of Permutations ◽  
Descent Set ◽  
Positive Integers

A large number of generating functions for permutation statistics can be obtained by applying homomorphisms to simple symmetric function identities. In particular, a large number of generating functions involving the number of descents of a permutation $\sigma$, $des(\sigma)$, arise in this way. For any given finite set $S$ of positive integers, we develop a method to produce similar generating functions for the set of permutations of the symmetric group $S_n$ whose descent set contains $S$. Our method will be to apply certain homomorphisms to symmetric function identities involving ribbon Schur functions.

scholarly journals Exchange Symmetries in Motzkin Path and Bargraph Models of Copolymer Adsorption

10.37236/1637 ◽  
2002 ◽  
Vol 9 (1) ◽  
Author(s):  
E. J. Janse van Rensburg ◽  
A. Rechnitzer
Keyword(s):  
Critical Point ◽  
Generating Functions ◽  
Asymptotic Expression ◽  
Path Model ◽  
Motzkin Path ◽  
Dyck Paths ◽  
Asymptotic Expressions ◽  
Directed Walks ◽  
Open Question ◽  
Vertex Colouring

In a previous work [26], by considering paths that are partially weighted, the generating function of Dyck paths was shown to possess a type of symmetry, called an exchange relation, derived from the exchange of a portion of the path between weighted and unweighted halves. This relation is particularly useful in solving for the generating functions of certain models of vertex-coloured Dyck paths; this is a directed model of copolymer adsorption, and in a particular case it is possible to find an asymptotic expression for the adsorption critical point of the model as a function of the colouring. In this paper we examine Motzkin path and partially directed walk models of the same adsorbing directed copolymer problem. These problems are an interesting generalisation of previous results since the colouring can be of either the edges, or the vertices, of the paths. We are able to find asymptotic expressions for the adsorption critical point in the Motzkin path model for both edge and vertex colourings, and for the partially directed walk only for edge colourings. The vertex colouring problem in partially directed walks seems to be beyond the scope of the methods of this paper, and remains an open question. In both these cases we first find exchange relations for the generating functions, and use those to find the asymptotic expression for the adsorption critical point.

scholarly journals Formulas involving sums of powers, special numbers and polynomials arising from p-adic integrals, trigonometric and generating functions

2020 ◽  
Vol 108 (122) ◽  
pp. 103-120
Author(s):  
Neslihan Kilar ◽  
Yilmaz Simsek
Keyword(s):  
Generating Functions ◽  
Bernoulli Polynomials ◽  
Stirling Numbers ◽  
Sums Of Powers ◽  
Alternating Sums ◽  
Special Numbers And Polynomials ◽  
Bernoulli Polynomials And Numbers ◽  
Euler Polynomials And Numbers ◽  
Historical Remarks ◽  
Positive Integers

The formula for the sums of powers of positive integers, given by Faulhaber in 1631, is proven by using trigonometric identities and some properties of the Bernoulli polynomials. Using trigonometric functions identities and generating functions for some well-known special numbers and polynomials, many novel formulas and relations including alternating sums of powers of positive integers, the Bernoulli polynomials and numbers, the Euler polynomials and numbers, the Fubini numbers, the Stirling numbers, the tangent numbers are also given. Moreover, by applying the Riemann integral and p-adic integrals involving the fermionic p-adic integral and the Volkenborn integral, some new identities and combinatorial sums related to the aforementioned numbers and polynomials are derived. Furthermore, we serve up some revealing and historical remarks and observations on the results of this paper.

PARTITIONS WITH AN ARBITRARY NUMBER OF SPECIFIED DISTANCES

2019 ◽  
Vol 101 (1) ◽  
pp. 35-39 ◽  
Author(s):  
BERNARD L. S. LIN
Keyword(s):  
Explicit Formula ◽  
Generating Function ◽  
Generating Functions ◽  
Arbitrary Number ◽  
Positive Integers

For positive integers $t_{1},\ldots ,t_{k}$, let $\tilde{p}(n,t_{1},t_{2},\ldots ,t_{k})$ (respectively $p(n,t_{1},t_{2},\ldots ,t_{k})$) be the number of partitions of $n$ such that, if $m$ is the smallest part, then each of $m+t_{1},m+t_{1}+t_{2},\ldots ,m+t_{1}+t_{2}+\cdots +t_{k-1}$ appears as a part and the largest part is at most (respectively equal to) $m+t_{1}+t_{2}+\cdots +t_{k}$. Andrews et al. [‘Partitions with fixed differences between largest and smallest parts’, Proc. Amer. Math. Soc.143 (2015), 4283–4289] found an explicit formula for the generating function of $p(n,t_{1},t_{2},\ldots ,t_{k})$. We establish a $q$-series identity from which the formulae for the generating functions of $\tilde{p}(n,t_{1},t_{2},\ldots ,t_{k})$ and $p(n,t_{1},t_{2},\ldots ,t_{k})$ can be obtained.

Sign in / Sign up

Export Citation Format

Share Document