Related papers: Permutations with few inversions

Any permutation polynomial is an $ n $-cycle permutation. When $n$ is a specific small positive integer, one can obtain efficient permutations, such as involutions, triple-cycle permutations and quadruple-cycle permutations. These…

The hypergeometric distribution is a popular distribution, whose properties have been extensively investigated. Generating functions of this distribution, such as the probability-generating function, the moment-generating function, and the…

For a distribution $p:=\{p_k\}_{k=1}^\infty$ on the positive integers, there are two natural ways to construct a random permutation in $S_n$ or of $\mathbb{N}$ from IID samples from $p$--the $p$-biased construction and the $p$-shifted…

Let B(n) be the set of pairs of permutations from the symmetric group of degree n with a 3-cycle commutator, and let A(n) be the set of those pairs which generate the symmetric or the alternating group of degree n. We find effective…

The inverse problem for representation functions takes as input a triple (X,f,L), where X is a countable semigroup, f : X --> N_0 \cup {\infty} a function, L : a_1 x_1 + ... + a_h x_h an X-linear form and asks for a subset A \subseteq X…

Let $G$ be a linear algebraic group acting linearly on a vector space $V$, and let $k[V]^G$ be the corresponding algebra of invariant polynomial functions. A separating set $S \subseteq k[V]^G$ is a set of polynomials with the property that…

Classical pattern avoidance and occurrence are well studied in the symmetric group $\mathcal{S}_{n}$. In this paper, we provide explicit recurrence relations to the generating functions counting the number of classical pattern occurrence in…

The generating series associated to a certain sequence of limited Taylor expansions coincides with the continuously iterated Invert Transform and displays thus a nice functional equality.

Permutations can be represented as linear combinations of natural numbers with different powers. In this paper, its coefficient matrix and inverse matrix is derived, and the results show the coefficient matrix is a lower triangular matrix…

We have derived the perimeter generating function of a model of punctured staircase polygons in which the internal staircase polygon is rotated by a 90degree angle with respect to the outer staircase polygon. In one approach we calculated a…

The fundamental representations of the special linear group ${\rm SL}_n$ over the complex numbers are the exterior powers of $\mathbb{C}^n$. We consider the invariant rings of sums of arbitrary many copies of these ${\rm SL}_n$-modules. The…

A fundamental computational task in probabilistic programming is to infer a program's output (posterior) distribution from a given initial (prior) distribution. This problem is challenging, especially for expressive languages that feature…

The algebra of symmetric functions contains several interesting families of symmetric functions indexed by integer partitions or skew partitions. Given a sequence $\{u_n\}$ of symmetric functions taken from one of these families such that…

The sums $\sum_{j = 0}^k {u_{rj + s}^{2n}z^j }$, $\sum_{j = 0}^k {u_{rj + s}^{2n-1}z^j }$, $\sum_{j = 0}^k {v_{rj + s}^{n}z^j }$ and $\sum_{j = 0}^k {w_{rj + s}^{n}z^j }$ are evaluated; where $n$ is any positive integer, $r$, $s$ and $k$…

We study generating functions for the number of permutations on n letters avoiding 132 and an arbitrary permutation $\tau$ on k letters, or containing $\tau$ exactly once. In several interesting cases the generating function depends only on…

Closed-form generating functions for counting one-face rooted hypermaps with a known number of darts by number of vertices and edges is found, using matrix integral expressions relating to the reduced density operator of a bipartite quantum…

We show that all permutations in $S_n$ can be generated by affine unicritical polynomials. We use the $\operatorname{PGL}$ group structure to compute the cycle structure of permutations with low Carlitz rank. The tree structure of the group…

We consider the tiling generating functions of semi-hexagons and quartered hexagons with dents on their sides. In general, there are no simple product formulas for these generating functions. However, we show that the modification in the…

It is well known that permutations avoiding any 3-length pattern are enumerated by the Catalan numbers. If the three patterns 123, 132 and 213 are avoided at the same time we obtain a class of permutations enumerated by the Fibonacci…

We show that the pair (des, ides) of statistics on the set of permu- tations has the same distribution as the pair (asc, row) of statistics on the set of inversion tables, proving a conjecture of Visontai. The common generating function of…