Related papers: Avoiding maximal parabolic subgroups of S_k

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 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…

The generating function method that we had developing has various applications in physics and not only interress undergraduate students but also physicists. We solve simply difficult problems or unsolved commonly used in quantum, nuclear…

We extend the reciprocity method of Jones and Remmel to study generating functions of the form $$\sum_{n \geq 0} \frac{t^n}{n!} \sum_{\sigma \in \mathcal{NM}_n(\Gamma)}x^{\mathrm{LRmin}(\sigma)}y^{1+\mathrm{des}(\sigma)}$$ where $\Gamma$ is…

We introduce a presentation of the Chow ring of a matroid by a new set of generators, called "simplicial generators." These generators are analogous to nef divisors on projective toric varieties, and admit a combinatorial interpretation via…

Despite the fact that the field of pattern avoiding permutations has been skyrocketing over the last two decades, there are very few exhaustive generating algorithms for such classes of permutations. In this paper we introduce the notions…

The algebra of holomorphic polynomial Sp_{2n}-invariants of k complex 2n by 2n matrices (under diagonal conjugation action) is generated by the traces of words in these matrices and their symplectic adjoints. No concrete minimal generating…

We use character polynomials to obtain a positive combinatorial interpretation of the multiplicity of the sign representation in irreducible polynomial representations of $GL_n(\mathbb{C})$ indexed by two-column and hook partitions. Our…

In this article, dedicated with admiration and gratitude to guru Neil Sloane on his 75-th birthday, we observe that the generating functions for multi-set permutations that do not contain an increasing subsequence of length d, and where…

We show that permutations avoiding both of the (classical) patterns 4321 and 3241 have the algebraic generating function conjectured by Vladimir Kruchinin.

We describe a generalization of the concept of a pc presentation that applies to groups with a nontrivial solvable radical. Such a representation can be much more efficient in terms of memory use and even of arithmetic, than permuattion and…

A group is Markov if it admits a prefix-closed regular language of unique representatives with respect to some generating set, and strongly Markov if it admits such a language of unique minimal-length representatives over every generating…

In this paper we continue the study of permutations avoiding the vincular pattern $1-32-4$ by constructing a generating tree with a single label for these permutations. This construction finally provides a clearer explanation of why a…

In this paper, we study the generating functions for the number of pattern restricted Stirling permutations with a given number of plateaus, descents and ascents. Properties of the generating functions, including symmetric properties and…

We deal with two-generator subgroups of PSL(2,C) with real traces of both generators and their commutator. We give discreteness criteria for these groups when at least one of the generators is parabolic. We also present a list of the…

In this paper, we derive exact formulas for generating functions counting the number of $n$-ary words avoiding strictly increasing subwords of length $k$, and provide some applications of these formulas.

For a transitive subgroup $G \le S_6$ which contain $C_3 \times C_3$ as subgroup, we prove that $K(x_1,\dots,x_6)^G$ is rational over $K$, where $K$ is any field, and $G$ acts naturally on $K(x_1,\dots,x_6)$ by permutations on the…

Let $a_n$ denote the number of ways in which a chess rook can move from a corner cell to the opposite corner cell of an $n \times n \times n$ three-dimensional chessboard, assuming that the piece moves closer to the goal cell at each step.…

We give an alternative proof to Agol's classification of parabolic generating pairs of non-free Kleinian groups generated by two parabolic transformations. As an application, we give a complete characterisation of epimorphims between…

We describe irreducible representations and character formulas of the Renner monoids for reductive monoids, which generalizes the Munn-Solomon representation theory of rook monoids to any Renner monoids. The type map and polytope associated…