Related papers: Generating functions for descents over permutation…

The algebra of symmetric functions contains several interesting families of symmetric functions indexed by integer partitions or skew partitions. Given a sequence $\{u_n\}$ of symmetric functions taken from one of these families such that…

Diffusion Probabilistic Models stand as a critical tool in generative modelling, enabling the generation of complex data distributions. This family of generative models yields record-breaking performance in tasks such as image synthesis,…

Fourier-Dedekind sums are a generalization of Dedekind sums - important number-theoretical objects that arise in many areas of mathematics, including lattice point enumeration, signature defects of manifolds and pseudo random number…

Let $\Omega$ be the set of odd positive integers and let $S:\Omega \rightarrow \Omega$ be the Syracuse function. It is proved that, for every permutation $\sigma$ of $(1,2,3)$, the set of triples of the form $(m,S(m),S^2(m))$ with…

Every binary De~Bruijn sequence of order n satisfies a recursion 0=x_n+x_0+g(x_{n-1}, ..., x_1). Given a function f on (n-1) bits, let N(f; r) be the number of functions generating a De Bruijn sequence of order n which are obtained by…

This paper introduces the $(\alpha, \Gamma)$-descent, an iterative algorithm which operates on measures and performs $\alpha$-divergence minimisation in a Bayesian framework. This gradient-based procedure extends the commonly-used…

An extension of the Lorentz group to include generators $\Gamma^\mu$ carrying a space-time index is demonstrated to explicitly construct the Minkowski metric within the internal group space as a consequence of the non-vanishing commutation…

Fixing a subgroup $\Gamma$ in a group $G$, the commensurability growth function assigns to each $n$ the cardinality of the set of subgroups $\Delta$ of $G$ with $[\Gamma: \Gamma \cap \Delta][\Delta : \Gamma \cap \Delta] = n$. For pairs…

The excedance number for S_n is known to have an Eulerian distribution. Nevertheless, the classical proof uses descents rather than excedances. We present a direct recursive proof which seems to be folklore and extend it to the colored…

In 2017 Davis, Nelson, Petersen, and Tenner pioneered the study of pinnacle sets of permutations and asked whether there exists a class of operations, which applied to a permutation in $\mathfrak{S}_n$, can produce any other permutation…

Closed-form generating functions for counting one-face rooted hypermaps with a known number of darts by number of vertices and edges is found, using matrix integral expressions relating to the reduced density operator of a bipartite quantum…

Kerov, Olshanski and Vershik introduced the so-called virtual permutations, defined as families of permutations $(\sigma_N)_{N \geq 1}$, $\sigma_N$ in the symmetric group of order $N$, such that the cycle structure of $\sigma_N$ can be…

We study the asymptotic representation for the zeros of the deformed exponential function $\sum\nolimits_{n = 0}^\infty {\frac1{n!}{q^{n(n - 1)/2}{x^n}}} $, $q\in (0,1)$. Indeed, we obtain an asymptotic formula for these zeros: \[x_n=-…

We describe a generating tree approach to the enumeration and exhaustive generation of k-nonnesting set partitions and permutations. Unlike previous work in the literature using the connections of these objects to Young tableaux and…

Let $\J$ and $\K$ be convex sets in $\R^{n}$ whose affine spans intersect at a single rational point in $\J \cap \K$, and let $\J \oplus \K = \conv(\J \cup \K)$. We give formulas for the generating function {equation*} \sigma_{\cone(\J…

Let $p$ be prime, and let $p_{[1,p]}(n)$ denote the function whose generating function is $\prod (1-q^n)^{-1}(1 - q^{pn})^{-1}$. This function and its generalizations $p_{[c^{\ell}, d^m]}(n)$ are the subject of study in several recent…

Let S_n be the nth symmetric group. Given a set of permutations Pi we denote by S_n(Pi) the set of permutations in S_n which avoid Pi in the sense of pattern avoidance. Consider the generating function Q_n(Pi) = sum_pi F_{Des pi} where the…

Let $(u(n))_{n\in\mathbb{N}}$ be an arithmetic progression of natural integers in base $b\in\mathbb{N}\setminus \{0,1\}$. We consider the following sequences: $s(n)=\overline{u(0)u(1)\cdots u(n) }^b$ formed by concatenating the first $n+1$…

A \emph{linear extension} of a partial order \(\preceq\) over items \(A = \{ 1, 2, \ldots, n \}\) is a permutation \(\sigma\) such that for all \(i < j\) in \(A\), it holds that \(\neg(\sigma(j) \preceq \sigma(i))\). Consider the problem of…

We are interested in random uniform minimal factorizations of the $n$-cycle which are factorizations of $(1~2\dots n)$ into a product of $n-1$ transpositions. Our main result is an explicit formula for the joint probability that 1 and 2…