Related papers: Generating functions for descents over permutation…

We introduce a new set of prime numbers functions including an exact Generating Function and a Discriminating Function of Prime Numbers neither based on prime number tables nor on algorithms. Instead these functions are defined in terms of…

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 powers of generating functions and its properties are analyzed. A new class of functions is introduced, based on the application of compositions of an integer $n$, called composita. The methods for obtaining reciprocal and reverse…

We give an improved algorithm for counting the number of $1324$-avoiding permutations, resulting in 5 further terms of the generating function. We analyse the known coefficients and find compelling evidence that unlike other classical…

In his Ph.D. thesis, Ira Gessel proved a reciprocity formula for noncommutative symmetric functions which enables one to count words and permutations with restrictions on the lengths of their increasing runs. We generalize Gessel's theorem…

In this paper we provide a new series representation for the values of Riemann zeta function at integer arguments, namely: $ \zeta(m)=\sum_{n=1}^{\infty}\frac{m(-1)^{n-1}\Gamma(1-\omega_{m}n)...\Gamma(1-\omega_{m}^{m-1}n)}{n!n^m}$, where…

Motivated by a correlation between the distribution of descents over permutations that avoid a consecutive pattern and those avoiding the respective quasi-consecutive pattern, as established in this paper, we obtain a complete $\des$-Wilf…

We use the cluster method to enumerate permutations avoiding consecutive patterns. We reprove and generalize in a unified way several known results and obtain new ones, including some patterns of length 4 and 5, as well as some infinite…

For $X$ a pre-$\lambda$ random variable, we show the $\sigma$-moment generating function of $-X$ can be obtained from the $\sigma$-moment generating function of $X$ by applying the composition of the standard and degree flip involutions on…

In this paper, we find an explicit formula for the generating function that counts the circular permutations of length n avoiding the pattern 23 4 1 whose enumeration was raised as an open problem by Rupert Li. This then completes in all…

We revisit several hybrid multiplicative-to-additive type functions from a recent preprint article. These functions, $g(n)$ with Dirichlet generating function (DGF) $\zeta(s)^{-1} (1+P(s))^{-1}$ for $\Re(s) > 1$ where $P(s) = \sum_p p^{-s}$…

Using the approach suggested in [arXiv:1002.2761] we present below a sufficient condition guaranteeing that two collections of patterns of permutations have the same exponential generating functions for the number of permutations avoiding…

Given sets X and Y of positive integers and a permutation sigma = sigma_1, sigma_2, ..., sigma_n in S_n, an X,Y-descent of sigma is a descent pair sigma_i > sigma_{i+1} whose "top" sigma_i is in X and whose "bottom" sigma_{i+1} is in Y. We…

A curious generating function $S_0(x)$ for permutations of $[n]$ with exactly $n$ inversions is presented. Moreover, $(xC(x))^iS_0(x)$ is shown to be the generating function for permutations of $[n]$ with exactly $n-i$ inversions, where…

Let $(K,\Delta)$ be a Hermitian form field and $n\geq 3$. We prove that if $\sigma\in U_{2n+1}(K,\Delta)$ is a unitary matrix of level $(K,\Delta)$, then any short root transvection $T_{ij}(x)$ is a product of $4$ elementary unitary…

A permutation $\tau$ in the symmetric group $S_j$ is minimally overlapping if any two consecutive occurrences of $\tau$ in a permutation $\sigma$ can share at most one element. B\'ona \cite{B} showed that the proportion of minimal…

The Mertens function, $M(x) := \sum_{n \leq x} \mu(n)$, is defined as the summatory function of the classical M\"obius function. The Dirichlet inverse function $g(n) := (\omega+1)^{-1}(n)$ is defined in terms of the shifted strongly…

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 present upper and lower bounds for the number $i_n$ of interval graphs on $n$ vertices. Answering a question posed by Hanlon, we show that the ordinary generating function $I(x) = \sum_{n\ge 0} i_n\,x^n$ for the number $i_n$ of…

Let $n$ be a positive integer and let $[n]=\{1,2,\ldots,n\}$. Let $\Gamma_n$ denote the group of permutations on $[n]$ whose restrictions to maximal proper subsets of $[n]$ are even, let $\Sigma_n$ denote the monoid of transformations on…