activity
19942025
most citedThe Poincare map of randomly perturbed periodic motion

22 citations · 114 across the 29 of their papers we have counts for

collaborators
Showing math.COShow all

18 papers · 1 filter

math.CO2018

Distribution of the Number of Corners in Tree--like Tableaux

Pawel Hitczenko, Aleksandr Yaroslavskiy

In this paper, we study tree--like tableaux and some of their probabilistic properties. Tree--like tableaux are in bijection with other combinatorial structures, including permutat…

math.CO2016

Probabilistic Consequences of Some Polynomial Recurrences

Pawel Hitczenko, Amanda Lohss

In this paper, we consider sequences of polynomials that satisfy differential--difference recurrences. Our interest is motivated by the fact that polynomials satisfying such recurr…

math.CO2015

Corners in tree-like tableaux

Pawel Hitczenko, Amanda Lohss

In this paper, we study tree--like tableaux, combinatorial objects which exhibit a natural tree structure and are connected to the partially asymmetric simple exclusion process (PA…

math.CO2015

On the asymptotic distribution of parameters in random weighted staircase tableaux

Pawel Hitczenko, Amanda Lohss

In this paper, we study staircase tableaux, a combinatorial object introduced due to its connections with the asymmetric exclusion process (ASEP) and Askey-Wilson polynomials. Due…

math.CO2014

On the covariances of outdegrees in random plane recursive trees

Hüseyin Acan, Paweł Hitczenko

In 2005 Janson, extending earlier work of Mahmoud, Smythe, and Szymański, established the joint asymptotic normality of the outdegrees of a random plane recursive tree. In particul…

math.CO2014

On a memory game and preferential attachment graphs

Huseyin Acan, Pawel Hitczenko

In a recent paper Velleman and Warrington analyzed the expected values of some of the parameters in a memory game, namely, the length of the game, the waiting time for the first ma…

math.CO2014

On random trees obtained from permutation graphs

Huseyin Acan, Pawel Hitczenko

A permutation gives rise to a graph ; the vertices of are the letters in the permutation and the edges of …

math.CO2014

On the distribution of parameters in random weighted staircase tableaux

Pawel Hitczenko, Amanda Parshall

In this paper, we study staircase tableaux, a combinatorial object introduced due to its connections with the asymmetric exclusion process (ASEP) and Askey-Wilson polynomials. Due…

math.CO2012★ 3 cited

Weighted random staircase tableaux

Pawel Hitczenko, Svante Janson

This paper concerns a relatively new combinatorial structure called staircase tableaux. They were introduced in the context of the asymmetric exclusion process and Askey--Wilson po…

math.CO2012

Greek letters in random staircase tableaux

Sandrine Dasse-Hartaut, Pawel Hitczenko

In this paper we study a relatively new combinatorial object called staircase tableaux. Staircase tableaux were introduced by Corteel and Williams in the connection with Asymmetric…

math.CO2012★ 18 cited

Enumeration and asymptotics of restricted compositions having the same number of parts

Cyril Banderier, Pawel Hitczenko

We study pairs and m--tuples of compositions of a positive integer n with parts restricted to a subset P of positive integers. We obtain some exact enumeration results for the numb…

math.CO2009★ 1 cited

Asymptotic Normality of Statistics on Permutation Tableaux

Pawel Hitczenko, Svante Janson

In this paper we use a probabilistic approach to derive the expressions for the characteristic functions of basic statistics defined on permutation tableaux. Since our expressions…

math.CO2002★ 9 cited

Iterating random functions on a finite set

W. M. Y. Goh, P. Hitczenko, E. Schmutz

Let f_1,f_2,..., be functions chosen independently and uniformly from the set of all functions from a set of cardinality n into itself. Let g_t be the composition of the first t fu…

math.CO2001

Expected number of distinct part sizes in a random integer composition

Pawel Hitczenko, Gilbert Stengle

The asymptotics, as , for the expected number of distinct part sizes in a random composition of an integer n is obtained.

math.CO2001

Random partitions with non negative rth differences

Rod Canfield, Sylvie Corteel, Pawel Hitczenko

Let be the set of partitions of n with non negative rth differences. Let be a partition chosen uniformly at random among the set . Let be a positive rth…

math.CO2001

S-partitions

William M. Y. Goh, Pawel Hitczenko, Ali Shokoufandeh

This note reports on the number of s-partitions of a natural number n. In an s-partition each cell has the form for some integer k. Such partitions have potential applicati…

math.CO2001★ 7 cited

A generatingfunctionology approach to a problem of Wilf

Pawel Hitczenko, Cecil C. Rousseau, Carla D. Savage

Wilf posed the following problem: determine asymptotically as the probability that a randomly chosen part size in a randomly chosen composition of n has multiplicity m…

math.CO2001★ 1 cited

Average number of distinct part sizes in a random Carlitz composition

William M. Y. Goh, Pawel Hitczenko

A composition of an integer is called Carlitz if adjacent parts are different. Several characteristics of random Carlitz compsitions have been studied recently by Knopfmacher and P…