Related papers: Generating Permutations with Restricted Containers
We use the generating function of the characters of $C_2$ to obtain a generating function for the multiplicities of the weights entering in the irreducible representations of that simple Lie algebra. From this generating function we derive…
Consider a subfield of the field of rational functions in several indeterminates. We present an algorithm that, given a set of generators of such a subfield, finds a simple generating set. We provide an implementation of the algorithm and…
We extend and generalize many of the enumerative results concerning West's stack-sorting map $s$. First, we prove a useful theorem that allows one to efficiently compute $|s^{-1}(\pi)|$ for any permutation $\pi$, answering a question of…
Sequences are often conveniently encoded in the form of a generating function depending on a formal variable. This note presents two observations that allow one to draw conclusions about the generated sequence from the generating function.…
Let $\mathfrak{C}$ be a class of finite combinatorial structures. The \textit{profile} of $\mathfrak{C}$ is the function $\varphi_{\mathfrak{C}}$ which counts, for every integer $n$, the number $\varphi_{\mathfrak{C}}(n)$ of members of…
We use a probabilistic method to produce some combinatorial inequalities by considering pattern containment in permutations and words.
We characterise and enumerate permutations that are sortable by n-4 passes through a stack. We conjecture the number of permutations sortable by n-5 passes, and also the form of a formula for the general case n-k, which involves a…
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 find generating functions the number of strings (words) containing a specified number of occurrences of certain types of order-isomorphic classes of substrings called subword patterns. In particular, we find generating functions for the…
We comment on some conceptual and and technical problems related to computational mechanics, point out some errors in several papers, and straighten out some wrong priority claims. We present explicitly the correct algorithm for…
A generalization of the Catalan numbers is considered. New results include binomial identities, recursive relations and a close formula for the multivariate generating function. A simple expression for the Catalan determinant is derived.
We carry out a systematic study of primary operators in the conformal field theory of a free Weyl fermion. Using SO(4,2) characters we develop counting formulas for primaries constructed using a fixed number of fermion fields. By…
We study the continuous solutions of several classical functional equations by using the properties of the spaces of continuous functions which are invariant under some elementary linear trans-formations. Concretely, we use that the sets of…
Since their introduction by Andrews, generalized Frobenius partitions have interested a number of authors, many of whom have worked out explicit formulas for their generating functions in specific cases. This has uncovered interesting…
We introduce a generating function approach to the affine Brauer and Kauffman categories and show how it allows one to efficiently recover important sets of relations in these categories. We use this formalism to deduce restrictions on…
We describe a simple formalism for generating classes of quantum circuits that are classically efficiently simulatable and show that the efficient simulation of Clifford circuits (Gottesman-Knill theorem) and of matchgate circuits…
The $\sigma$-machine was recently introduced by Cerbai, Claesson and Ferrari as a tool to gain a better insight on the problem of sorting permutations with two stacks in series. It consists of two consecutive stacks, which are restricted in…
In this paper, we study a class of functions defined recursively on the set of natural numbers in terms of the greatest common divisor algorithm of two numbers and requiring a minimality condition. These functions are permutations, products…
The simple permutations in two permutation classes --- the 321-avoiding permutations and the skew-merged permutations --- are enumerated using a uniform method. In both cases, these enumerations were known implicitly, by working backwards…
In many high-dimensional problems,polynomial-time algorithms fall short of achieving the statistical limits attainable without computational constraints. A powerful approach to probe the limits of polynomial-time algorithms is to study the…