Logo image
Probabilistic consequences of some polynomial recurrences
Journal article   Open access   Peer reviewed

Probabilistic consequences of some polynomial recurrences

Paweł Hitczenko and Amanda Lohss
Random structures & algorithms, v 53(4), pp 652-666
Dec 2018
url
https://arxiv.org/abs/1604.03164View

Abstract

generating polynomial recurrence tree‐like tableaux
In this paper, we consider sequences of polynomials that satisfy certain recurrences. Our interest is motivated by the fact that polynomials satisfying such recurrences frequently appear as generating polynomials of integer valued random variables that are of interest in discrete mathematics. In particular, we will use our approach to show that the number of diagonal boxes in symmetric tree‐like tableaux is asymptotically normal. This extends earlier results of Aval, Boussicault and Nadeau, who found the asymptotics of the expected number of diagonal boxes. Through our discussion, we establish a general framework to approach such recurrences and prompt a generalization of the probabilistic consequences of them.

Metrics

12 Record Views
4 citations in Scopus

Details

UN Sustainable Development Goals (SDGs)

This publication has contributed to the advancement of the following goals:

#4 Quality Education

InCites Highlights

Data related to this publication, from InCites Benchmarking & Analytics tool:

Web of Science research areas
Computer Science, Software Engineering
Mathematics
Mathematics, Applied
Logo image