Related papers: Avoiding maximal parabolic subgroups of S_k

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…

We establish that any even permutation from A_n moving at least [3n/4] + o(n) points is the commutator of a generating pair of A_n and a generating pair of S_n. From this we deduce an exponential lower bound on the number of systems of…

Let T_k^m={\sigma \in S_k | \sigma_1=m}. We prove that the number of permutations which avoid all patterns in T_k^m equals (k-2)!(k-1)^{n+1-k} for k <= n. We then prove that for any \tau in T_k^1 (or any \tau in T_k^k), the number of…

In 1990 West conjectured that there are $2(3n)!/((n+1)!(2n+1)!)$ two-stack sortable permutations on $n$ letters. This conjecture was proved analytically by Zeilberger in 1992. Later, Dulucq, Gire, and Guibert gave a combinatorial proof of…

We study the involutions belonging to the class of 321 avoiding permutations. We calculate the algebraic generating functions of the set containing the involutions avoiding 321 and of some of its subsets. Precisely we determine the…

In a previous paper of the second author with K. Ono, surprising multiplicative properties of the partition function were presented. Here, we deal with $k$-regular partitions. Extending the generating function for $k$-regular partitions…

We give a closed formula for the number of partitions $\lambda$ of $n$ such that the corresponding irreducible representation $V_\lambda$ of $S_n$ has non-trivial determinant. We determine how many of these partitions are self-conjugate and…

In this paper we present the asymptotic enumeration of RNA structures with pseudoknots. We develop a general framework for the computation of exponential growth rate and the sub exponential factors for $k$-noncrossing RNA structures. Our…

Let S be a smooth cubic surface defined over a field K. As observed by Segre and Manin, there is a secant and tangent process on S that generates new K-rational points from old. It is natural to ask for the size of a minimal generating set…

An intersective polynomial is a monic polynomial in one variable with rational integer coefficients, with no rational root and having a root modulo $m$ for all positive integers $m$. Let $G$ be a finite noncyclic group and let $r(G)$ be the…

A simple permutation is one that does not map a nontrivial interval onto an interval. It was recently proved by Albert and Atkinson that a permutation class with only finitely simple permutations has an algebraic generating function. We…

We study the representations of the commutator subgroup K_{n} of the braid group B_{n} into a finite group . This is done through a symbolic dynamical system. Some experimental results enable us to compute the number of subgroups of K_{n}…

An $S_k$-set in a group $\Gamma$ is a set $A\subseteq\Gamma$ such that $\alpha_1\cdots\alpha_k=\beta_1\cdots\beta_k$ with $\alpha_i,\beta_i\in A$ implies $(\alpha_1,\ldots,\alpha_k)=(\beta_1,\ldots,\beta_k)$. An $S_k'$-set is a set such…

In this work, we study the computation of reduction coefficients for multi loop Feynman integrals using generating functions constructed within the Baikov representation. Compared with traditional Feynman rules, the Baikov formalism offers…

Let $K$ be a field of characteristic 0, $f:\mathbb{N}\to K$ be a multiplicative function, and $F(z)=\sum_{n\geq 1} f(n)z^n\in K[[z]]$ be algebraic over $K(z)$. Then either there is a natural number $k$ and a periodic multiplicative function…

Define $S_n^k(\alpha)$ to be the set of permutations of $\{1,2,...,n\}$ with exactly $k$ fixed points which avoid the pattern $\alpha \in S_m$. Let $s_n^k(\alpha)$ be the size of $S_n^k(\alpha)$. We investigate $S_n^0(\alpha)$ for all…

This paper investigates the location of the zeros of a sequence of polynomials generated by a rational function with a binomial-type denominator. We show that every member of a two-parameter family consisting of such generating functions…

We define a subsemigroup $S_n$ of the rook monoid $R_n$ and investigate its properties. To do this, we represent the nonzero elements of $S_n$ (which are $n\times n$ matrices) via certain triplets of integers, and develop a closed-form…

We introduce a systematic approach to express generating functions for the enumeration of maps on surfaces of high genus in terms of a single generating function relevant to planar surfaces. Central to this work is the comparison of two…

The permutation matrices form a subgroup of $\text{GL}_n(\mathbb{C})$ that is isomorphic to the symmetric group $S_n$. Let $r_{\mu\lambda}$ denote the multiplicity of the irreducible representation $V_\mu$ of $S_n$, corresponding to a…