scholarly journals The Asymptotic Number of Set Partitions with Unequal Block Sizes

10.37236/1434 ◽  
1998 ◽  
Vol 6 (1) ◽  
Author(s):  
A. Knopfmacher ◽  
A. M. Odlyzko ◽  
B. Pittel ◽  
L. B. Richmond ◽  
D. Stark ◽  
...  
Keyword(s):  
Asymptotic Behavior ◽  
Generating Function ◽  
Direct Approach ◽  
Set Partition ◽  
Random Partition ◽  
Set Partitions ◽  
Analytic Methods ◽  
Asymptotic Number ◽  
Block Sizes ◽  
Element Set

The asymptotic behavior of the number of set partitions of an $n$-element set into blocks of distinct sizes is determined. This behavior is more complicated than is typical for set partition problems. Although there is a simple generating function, the usual analytic methods for estimating coefficients fail in the direct approach, and elementary approaches combined with some analytic methods are used to obtain most of the results. Simultaneously, we obtain results on the shape of a random partition of an $n$-element set into blocks of distinct sizes.

scholarly journals Statistical Distributions and $q$-Analogues of $k$-Fibonacci Numbers

10.37236/2550 ◽  
2013 ◽  
Vol 20 (1) ◽  
Author(s):  
Adam M Goyt ◽  
Brady L Keller ◽  
Jonathan E Rue
Keyword(s):  
Fibonacci Numbers ◽  
Natural Extension ◽  
Statistical Distributions ◽  
Set Partition ◽  
Set Partitions ◽  
Partition Statistics

We study q-analogues of k-Fibonacci numbers that arise from weighted tilings of an $n\times1$ board with tiles of length at most k.  The weights on our tilings arise naturally out of distributions of permutations statistics and set partitions statistics.  We use these q-analogues to produce q-analogues of identities involving k-Fibonacci numbers.  This is a natural extension of results of the first author and Sagan on set partitions and the first author and Mathisen on permutations.  In this paper we give general q-analogues of k-Fibonacci identities for arbitrary weights that depend only on lengths and locations of tiles.  We then determine weights for specific permutation or set partition statistics and use these specific weights and the general identities to produce specific identities.

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.

scholarly journals The Critical Galton-Watson Process Without Further Power Moments

2007 ◽  
Vol 44 (03) ◽  
pp. 753-769 ◽  
Author(s):  
S. V. Nagaev ◽  
V. Wachtel
Keyword(s):  
Asymptotic Behavior ◽  
Limit Theorem ◽  
Generating Function ◽  
Branching Process ◽  
Alternative Proof ◽  
Conditional Limit Theorem ◽  
Power Moments ◽  
Watson Process ◽  
Conditional Limit

In this paper we prove a conditional limit theorem for a critical Galton-Watson branching process {Z n ; n ≥ 0} with offspring generating function s + (1 − s)L((1 − s)−1), where L(x) is slowly varying. In contrast to a well-known theorem of Slack (1968), (1972) we use a functional normalization, which gives an exponential limit. We also give an alternative proof of Sze's (1976) result on the asymptotic behavior of the nonextinction probability.

scholarly journals On the maximal multiplicity of block sizes in a random set partition

2020 ◽  
Vol 56 (3) ◽  
pp. 867-891
Author(s):  
Ljuben R. Mutafchiev ◽  
Mladen Savov
Keyword(s):  
Random Set ◽  
Set Partition ◽  
Maximal Multiplicity ◽  
Block Sizes

Inverse Problems for Partition Functions

2001 ◽  
Vol 53 (4) ◽  
pp. 866-896
Author(s):  
Yifan Yang
Keyword(s):  
Asymptotic Behavior ◽  
Partition Function ◽  
Inverse Problems ◽  
Large Class ◽  
Generating Function ◽  
Riemann Hypothesis ◽  
Arithmetic Function ◽  
Partition Functions ◽  
Class Of Functions ◽  
Weighted Partition

AbstractLet pw(n) be the weighted partition function defined by the generating function , where w(m) is a non-negative arithmetic function. Let be the summatory functions for pw(n) and w(n), respectively. Generalizing results of G. A. Freiman and E. E. Kohlbecker, we show that, for a large class of functions Φ(u) and λ(u), an estimate for Pw(u) of the formlog Pw(u) = Φ(u){1 + Ou(1/λ(u))} (u→∞) implies an estimate forNw(u) of the formNw(u) = Φ*(u){1+O(1/ log ƛ(u))} (u→∞) with a suitable function Φ*(u) defined in terms of Φ(u). We apply this result and related results to obtain characterizations of the Riemann Hypothesis and the Generalized Riemann Hypothesis in terms of the asymptotic behavior of certain weighted partition functions.

scholarly journals ANALYTIC METHODS FOR SELECT SETS

2012 ◽  
Vol 26 (4) ◽  
pp. 561-568 ◽  
Author(s):  
J. Gaither ◽  
M.D. Ward
Keyword(s):  
Selection Procedure ◽  
Expected Number ◽  
Asymptotic Growth ◽  
First Order ◽  
Analytic Methods ◽  
Asymptotic Number

We analyze the asymptotic number of items chosen in a selection procedure. The procedure selects items whose rank among all previous applicants is within the best 100p percent of the number of previously selected items. We use analytic methods to obtain a succinct formula for the first-order asymptotic growth of the expected number of items chosen by the procedure.

scholarly journals Crossings and Nestings in Set Partitions of Classical Types

10.37236/392 ◽  
2010 ◽  
Vol 17 (1) ◽  
Author(s):  
Martin Rubey ◽  
Christian Stump
Keyword(s):  
Type A ◽  
The Other ◽  
Type B ◽  
Set Partition ◽  
Set Partitions ◽  
Type D ◽  
Other Hand ◽  
The One

In this article, we investigate bijections on various classes of set partitions of classical types that preserve openers and closers. On the one hand we present bijections for types $B$ and $C$ that interchange crossings and nestings, which generalize a construction by Kasraoui and Zeng for type $A$. On the other hand we generalize a bijection to type $B$ and $C$ that interchanges the cardinality of a maximal crossing with the cardinality of a maximal nesting, as given by Chen, Deng, Du, Stanley and Yan for type $A$. For type $D$, we were only able to construct a bijection between non-crossing and non-nesting set partitions. For all classical types we show that the set of openers and the set of closers determine a non-crossing or non-nesting set partition essentially uniquely.

scholarly journals Actions and Identities on Set Partitions

10.37236/1992 ◽  
2012 ◽  
Vol 19 (1) ◽  
Author(s):  
Eric Marberg
Keyword(s):  
Abelian Group ◽  
Group Action ◽  
Type B ◽  
Set Partition ◽  
Set Partitions ◽  
Unitriangular Group

A labeled set partition is a partition of a set of integers whose arcs are labeled by nonzero elements of an abelian group $\mathbb{A}$. Inspired by the action of the linear characters of the unitriangular group on its supercharacters, we define a group action of $\mathbb{A}^n$ on the set of $\mathbb{A}$-labeled partitions of an $(n+1)$-set. By investigating the orbit decomposition of various families of set partitions under this action, we derive new combinatorial proofs of Coker's identity for the Narayana polynomial and its type B analogue, and establish a number of other related identities. In return, we also prove some enumerative results concerning André and Neto's supercharacter theories of type B and D.

scholarly journals Sorting with two stacks in parallel

2014 ◽  
Vol DMTCS Proceedings vol. AT,... (Proceedings) ◽  
Author(s):  
Michael Albert ◽  
Mireille Bousquet-Mélou
Keyword(s):  
Generating Function ◽  
Square Lattice ◽  
North West ◽  
International Audience ◽  
Asymptotic Number ◽  
Upper Half Plane ◽  
Recent Activity ◽  
The 1960S ◽  
The Moment ◽  
Forbidden Patterns

International audience At the end of the 1960s, Knuth characterised in terms of forbidden patterns the permutations that can be sorted using a stack. He also showed that they are in bijection with Dyck paths and thus counted by the Catalan numbers. Subsequently, Pratt and Tarjan asked about permutations that can be sorted using two stacks in parallel. This question is significantly harder, and the associated counting question has remained open for 40 years. We solve it by giving a pair of equations that characterise the generating function of such permutations. The first component of this system describes the generating function $Q(a,u)$ of square lattice loops confined to the positive quadrant, counted by the length and the number of North-West and East-South factors. Our analysis of the asymptotic number of sortable permutations relies at the moment on two intriguing conjectures dealing with this series. Given the recent activity on walks confined to cones, we believe them to be attractive $\textit{per se}$. We prove these conjectures for closed walks confined to the upper half plane, or not confined at all. Nous énumérons les permutations triables par deux piles en parallèle. Cette question était restée ouverte depuis les travaux de Knuth, Pratt et Tarjan dans les années 70. Notre solution consiste en une paire d’équations qui caractérisent la série génératrice. La première composante de ce système décrit la série $Q(a,u)$ des chemins fermés confinés dans le quart de plan positif, comptés selon leur longueur et le nombre de facteurs Nord-Ouest ou Est-Sud. Notre analyse du comportement asymptotique du nombre de permutations triables repose à ce stade sur deux conjectures remarquables portant sur $Q(a; u)$. Nous les prouvons pour les chemins fermés non confinés, ou confinés au demi-plan supérieur.

scholarly journals Counting water cells in bargraphs of compositions and set partitions

2018 ◽  
Vol 12 (2) ◽  
pp. 413-438 ◽  
Author(s):  
Toufik Mansour ◽  
Mark Shattuck
Keyword(s):  
Generating Function ◽  
Generating Functions ◽  
Horizontal Line ◽  
Explicit Formulas ◽  
Set Partitions ◽  
Unit Square ◽  
Joint Distributions ◽  
Water Cell ◽  
First Moment

In this paper, we consider statistics on compositions and set partitions represented geometrically as bargraphs. By a water cell, we mean a unit square exterior to a bargraph that lies along a horizontal line between any two squares contained within the area subtended by the bargraph. That is, if a large amount of a liquid were poured onto the bargraph from above and allowed to drain freely, then the water cells are precisely those cells where the liquid would collect. In this paper, we count both compositions and set partitions according to the number of descents and water cells in their bargraph representations and determine generating function formulas for the joint distributions on the respective structures. Comparable generating functions that count non-crossing and non-nesting partitions are also found. Finally, we determine explicit formulas for the sign balance and for the first moment of the water cell statistic on set partitions, providing both algebraic and combinatorial proofs.

Sign in / Sign up

Export Citation Format

Share Document