Related papers: Permutations generated by a depth 2 and infinite s…
A geometric grid class consists of those permutations that can be drawn on a specified set of line segments of slope \pm1 arranged in a rectangular pattern governed by a matrix. Using a mixture of geometric and language theoretic methods,…
Babson and Steingr\'{\i}msson introduced generalized permutation patterns that allow the requirement that two adjacent letters in a pattern must be adjacent in the permutation. Claesson presented a complete solution for the number of…
We study generating functions in the context of Rota-Baxter algebras. We show that exponential generating functions can be naturally viewed in a very special case of complete free commutative Rota-Baxter algebras. This allows us to use free…
We use generating functions to enumerate Arndt compositions, that is, integer compositions where there is a descent between every second pair of parts, starting with the first and second part, and so on. In 2013, J\"org Arndt noted that…
Gessel's famous Bessel determinant formula gives the generating function of the number of permutations without increasing subsequences of a given length. Ekhad and Zeilberger proposed the challenge of finding a suitable generalization for…
Given a finitely generated group with generating set $S$, we study the cogrowth sequence, which is the number of words of length $n$ over the alphabet $S$ that are equal to one. This is related to the probability of return for walks the…
We compute the number of ways a given permutation can be written as a product of exactly $k$ transpositions. We express this number as a linear combination of explicit geometric sequences, with coefficients which can be computed in many…
We prove that every proper subclass of the 321-avoiding permutations that is defined either by only finitely many additional restrictions or is well quasi-ordered has a rational generating function. To do so we show that any such class is…
We prove that the Lie algebra $\mathfrak{sl}_n(\textbf{F}_q)$ of traceless matrices over a finite field of characteristic $p$ can be generated by $2$ elements with exceptions when $(n, p)$ is $(3, 3)$ or $(4,2)$. In the latter cases, we…
We define a class L_{n, k} of permutations that generalizes alternating (up-down) permutations and give bijective proofs of certain pattern-avoidance results for this class. As a special case of our results, we give two bijections between…
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…
The noncommutative (or mixed) trace algebra $T_{nd}$ is generated by $d$ generic $n\times n$ matrices and by the algebra $C_{nd}$ generated by all traces of products of generic matrices, $n,d\geq 2$. It is known that over a field of…
We consider a large family of equivalence relations on permutations in Sn that generalise those discovered by Knuth in his study of the Robinson-Schensted correspondence. In our most general setting, two permutations are equivalent if one…
In this work, we consider a class of substitutions on infinite alphabets and show that they exhibit a growth behaviour which is impossible for substitutions on finite alphabets. While for both settings the leading term of the tile counting…
Let $s$ denote West's stack-sorting map. A permutation is called $t-\textit{sorted}$ if it is of the form $s^t(\mu)$ for some permutation $\mu$. We prove that the maximum number of descents that a $t$-sorted permutation of length $n$ can…
We enumerate several classes of pattern-avoiding rectangulations. We establish new bijective links with pattern-avoiding permutations, prove that their generating functions are algebraic, and confirm several conjectures by Merino and…
Fibonacci polynomials are generalizations of Fibonacci numbers, so it is natural to consider polynomial versions of the various results for Fibonacci numbers. According to Hong, Pongsriiam, Bulawa, and Lee, the generating function of the…
The classical theorem of Weitzenboeck states that the algebra of invariants of a single unipotent transformation $g$ in $GL_m(K)$ acting on the polynomial algebra $K[x_1,...,x_m]$ over a field $K$ of characteristic 0 is finitely generated.…
We initiate the study of subpolytopes of the permutahedron that arise as the convex hulls of stack-sorting on permutations. We primarily focus on $Ln1$ permutations, i.e., permutations of length $n$ whose penultimate and last entries are…
Let S = S(n) denote the infinite surface with n ends, n \in N, accumulated by genus. For n \geq 6, we show that the mapping class group of S is topologically generated by five involutions. When n \geq 3, it is topologically generated by six…