相关论文: Combinatorics of the 2-species exclusion processes…
This article presents a methodology that automatically derives a combinatorial specification for the permutation class C = Av(B), given its basis B of excluded patterns and the set of simple permutations in C, when these sets are both…
There is a deep connection between permutations and trees. Certain sub-structures of permutations, called sub-permutations, bijectively map to sub-trees of binary increasing trees. This opens a powerful tool set to study enumerative and…
We investigate pattern avoidance in permutations satisfying some additional restrictions. These are naturally considered in terms of avoiding patterns in linear extensions of certain forest-like partially ordered sets, which we call binary…
The Euler numbers have been widely studied. A signed version of the Euler numbers of even subscript are given by the coefficients of the exponential generating function 1/(1+x^2/2!+x^4/4!+...). Leeming and MacLeod introduced a…
We study linear statistics of a class of determinantal processes which interpolate between Poisson and GUE/Ginibre statistics in dimension 1 or 2. These processes are obtained by performing an independent Bernoulli percolation on the…
A two-parameter family of discrete-time exactly-solvable exclusion processes on a one-dimensional lattice is introduced, which contains the asymmetric simple exclusion process and the drop-push model as particular cases. The process is…
We study two generalizations of the asymmetric simple exclusion process with two types of particles. Particles of type 1 can jump over particles of type 2, while particles of type 2 can only influence the jump rates of particles of type 1.…
Which combinatorial sequences correspond to moments of probability measures on the real line? We present a generating function, in the form of a continued fraction, for a fourteen-parameter family of such sequences and interpret these in…
Any permutation statistic $f:\sym\to\CC$ may be represented uniquely as a, possibly infinite, linear combination of (classical) permutation patterns: $f= \Sigma_\tau\lambda_f(\tau)\tau$. To provide explicit expansions for certain…
A two-parameter family of exchangeable partitions with a simple updating rule is introduced. The partition is identified with a randomized version of a standard symmetric Dirichlet species-sampling model with finitely many types. A…
We study statistical signatures of composite bosons made of two fermions using a new many-body approach. Extending number-states to composite bosons, two-particle correlations as well as the dispersion of the probability distribution are…
We consider uniform random permutations drawn from a family enumerated through generating trees. We develop a new general technique to establish a central limit theorem for the number of consecutive occurrences of a fixed pattern in such…
In 2000 Babson and Steingr{\'\i}msson introduced the notion of vincular patterns in permutations. They shown that essentially all well-known Mahonian permutation statistics can be written as combinations of such patterns. Also, they proved…
In this article, we investigate a multispecies generalization of the single-species asymmetric simple exclusion process defined on an open one-dimensional lattice. We devise an exact projection scheme to find the phase diagram in terms of…
We obtain bivariate asymptotics for the number of (unicellular) combinatorial maps (a model of discrete surfaces) as both the size and the genus grow. This work is related to two research topics that have been very active recently:…
We investigate permutations in terms of their cycle structure and descent set. To do this, we generalize the classical bijection of Gessel and Reutenauer to deal with permutations that have some ascending and some descending blocks. We then…
The Laplacian matrix $L$ of a signed graph $G$ may or may not be invertible. We present a combinatorial formula of the Moore-Penrose inverse of $L$. This is achieved by finding a combinatorial formula for the Moore-Penrose inverse of an…
Many invariants of finitely generated positive cancelative commutative semigroups can be studied from their Poincar\'e series. We offer and present several closed formulas for them. Moreover, those formulas have elementary proofs and are…
Research in combinatorics has often focused on the ASEP (asymmetric simple exclusion process). The ASEP is inspired by processes in statistical mechanics, and involves particles of various species moving around a lattice. The particles do…
The purpose of this paper is twofold. First we answer to a question asked by Steingrimsson and Williams about certain permutation tableaux: we construct a bijection between binary trees and the so-called Catalan tableaux. These tableaux are…