Related papers: On partitions avoiding right crossings

In this work we define a unified generating functions for 9 different kinds of set partitions including cyclically ordered set partitions. Such generating function depends on 4 parameters. We consider property of this function and provide…

In a random model of minimum cost bipartite matching based on exponentially distributed edge costs, we show that the distribution of the cost of the optimal solution can be computed efficiently. The distribution is represented by its moment…

We study some combinatorial statistics defined on the set $NC^{(mton)}(n)$ of monotonically ordered non-crossing partitions of {1,...,n}, and on the set $NC_2^{(mton)}(2n)$ of monotonically ordered non-crossing pair-partitions of…

In this thesis, we introduced and carried out a combinatorial study of permutations that avoid one or two patterns of length 3 according to the statistic number of crossings. For this purpose, we manipulated a bijection of Elizalde and Pak…

A matching of the set $[2n]=\{ 1,2,\ldots ,2n\}$ is a partition of $[2n]$ into blocks with two elements, i.e. a graph on $[2n]$ such that every vertex has degree one. Given two matchings $\sigma$ and $\tau$ , we say that $\sigma$ is a…

A generic rectangulation is a partition of a rectangle into finitely many interior-disjoint rectangles, such that no four rectangles meet in a point. In this work we present a versatile algorithmic framework for exhaustively generating a…

By work of Bringmann, Ono, and Rhoades it is known that the generating function of the $M_2$-rank of partitions without repeated odd parts is the so-called holomorphic part of a certain harmonic Maass form. Here we improve the standing of…

A symbolic analysis of observed time series data requires making a discrete partition of a continuous state space containing observations of the dynamics. A particular kind of partition, called ``generating'', preserves all dynamical…

We define a generalized vector partition function and derive an identity for generating series of such functions associated with solutions of basic recurrence relation of combinatorial analysis. As a consequence, we obtain the generating…

In a recent article a generalization of the binomial distribution associated with a sequence of positive numbers was examined. The analysis of the nonnegativeness of the formal expressions was a key-point to allow to give them a statistical…

To flatten a set partition (with apologies to Mathematica) means to form a permutation by erasing the dividers between its blocks. Of course, the result depends on how the blocks are listed. For the usual listing--increasing entries in each…

We have the generating function which determines the number of $2$-bridge knot groups admitting epimorphisms onto the knot group of a given $2$-bridge knot, in terms of crossing number. In this paper, we will refine this formula by taking…

We give two combinatorial interpretations of the Matrix Ansatz of the PASEP in terms of lattice paths and rook placements. This gives two (mostly) combinatorial proofs of a new enumeration formula for the partition function of the PASEP.…

In this paper we study substitutions and some of their associated generating functions. This association takes aperiodicity to transcendence, and vice-versa. These generating functions have a recursive structure arising from the…

It is known that partial spreads is a class of bent partitions. In \cite{AM2022Be,MP2021Be}, two classes of bent partitions whose forms are similar to partial spreads were presented. In \cite{AKM2022Ge}, more bent partitions $\Gamma_{1},…

Matchings and coverings are central topics in graph theory. The close relationship between these two has been key to many fundamental algorithmic and polyhedral results. For mixed graphs, the notion of matching forest was proposed as a…

For stacked simplicial complexes, (special subclasses of such are: trees, triangulations of polygons, stacked polytopes), we give an explicit bijection between partitions of facets (for trees: edges), and partitions of vertices into…

In spatial networks vertices are arranged in some space and edges may cross. When arranging vertices in a 1-dimensional lattice edges may cross when drawn above the vertex sequence as it happens in linguistic and biological networks. Here…

Let A be a finite non-singleton set. For |A|=2 we show that the partial clone consisting of all selfdual monotone partial functions on A is not finitely generated, while it is the intersection of two finitely generated maximal partial…

Using the approach suggested in [arXiv:1002.2761] we present below a sufficient condition guaranteeing that two collections of patterns of permutations have the same exponential generating functions for the number of permutations avoiding…