Related papers: Asymptotics of Pattern Avoidance in the Klazar Set…

The minimal excludant statistic, which denotes the smallest positive integer that is not a part of an integer partition, has received great interest in recent years. In this paper, we move on to the smallest positive integer whose frequency…

In this document we achieve exact and asymptotic enumeration of words, compositions over a finite group, and/or integer compositions characterized by local restrictions and, separately, subsequence pattern avoidance. We also count…

With many pretreatment covariates and treatment factors, the classical factorial experiment often fails to balance covariates across multiple factorial effects simultaneously. Therefore, it is intuitive to restrict the randomization of the…

This is a brief survey of some open problems on permutation patterns, with an emphasis on subjects not covered in the recent book by Kitaev, \emph{Patterns in Permutations and words}. I first survey recent developments on the enumeration…

We study a two-species bidirectional exclusion process, and a single species variant, which is motivated by the motion of organelles and vesicles along microtubules. Specifically, we are interested in the clustering of the particles and…

We generalize the asymptotic estimates by Bubboloni, Luca and Spiga (2012) on the number of $k$-compositions of $n$ satisfying some coprimality conditions. We substantially refine the error term concerning the number of $k$-compositions of…

For permutations avoiding consecutive patterns from a given set, we present a combinatorial formula for the multiplicative inverse of the corresponding exponential generating function. The formula comes from homological algebra…

We explicitly compute the diverging factor in the large genus asymptotics of the Weil-Petersson volumes of the moduli spaces of $n$-pointed complex algebraic curves. Modulo a universal multiplicative constant we prove the existence of a…

We study a general factor analysis framework where the $n$-by-$p$ data matrix is assumed to follow a general exponential family distribution entry-wise. While this model framework has been proposed before, we here further relax its…

We present some results on the proportion of permutations of length $n$ containing certain mesh patterns as $n$ grows large, and give exact enumeration results in some cases. In particular, we focus on mesh patterns where entire rows and…

We introduce an algorithm that conjectures the structure of a permutation class in the form of a disjoint cover of "rules"; similar to generalized grid classes. The cover is usually easily verified by a human and translated into an…

We introduce the notion of asymptotic partition regularity for Diophantine equations. We show how this notion is at the core of almost all known negative results in the Ramsey theory of equations, and we use it to produce new ones, as in…

Fix a strong rectangulation pattern $P$ of size $L$. We show that the growth constant of the class of strong rectangulations avoiding $P$ is strictly smaller than $\Lambda =27/2$, the growth constant for all strong rectangulations. More…

Drmota and Stufler proved recently that the expected number of pattern occurrences of a given map is asymptotically linear when the number of edges goes to infinity. In this paper we improve their result by means of a different method. Our…

The purpose of this note is to complete the study, begun in the first author's PhD thesis, of the topology of the poset of generalized noncrossing partitions associated to real reflection groups. In particular, we calculate the Euler…

We consider the one-dimensional partially asymmetric exclusion process with random hopping rates, in which a fraction of particles (or sites) have a preferential jumping direction against the global drift. In this case the accumulated…

In this paper we continue our earlier investigations into the asymptotic behaviour of infinite systems of coupled differential equations. Under the mild assumption that the so-called characteristic function of our system is completely…

Arrow patterns were introduced by Berman and Tenner as a generalization of vincular patterns. They observed that arrow patterns have the potential to bridge the divide between a permutation's cycle notation and its one-line notation; in…

We consider a scheme of equiprobable allocation of particles into cells by sets. The Edgeworth type asymptotic expansion in the local central limit theorem for a number of empty cells left after allocation of all sets of particles is…

Growth-fragmentation processes describe the evolution of systems of cells which grow continuously and fragment suddenly; they are used in models of cell division and protein polymerisation. Typically, we may expect that in the long run, the…