English
Related papers

Related papers: Generating functions for descents over permutation…

200 papers

Let $\mathbb{F}_q$ be the finite field of $q=p^m\equiv 1\pmod 4$ elements with $p$ being an odd prime and $m$ being a positive integer. For $c, y \in\mathbb{F}_q$ with $y\in\mathbb{F}_q^*$ non-quartic, let $N_n(c)$ and $M_n(y)$ be the…

Number Theory · Mathematics 2021-08-03 Junyong Zhao , Yulu Feng , Shaofang Hong , Chaoxi Zhu

A ballot permutation is a permutation $\pi$ such that in any prefix of $\pi$ the descent number is not more than the ascent number. By using a reversal concatenation map, we give a formula for the joint distribution (pk, des) of the peak…

Combinatorics · Mathematics 2020-09-16 David G. L. Wang , T. Zhao

Given a finitely generated group with generating set $S$, we study the cogrowth sequence, which is the number of words of length $n$ over the alphabet $S$ that are equal to one. This is related to the probability of return for walks the…

Combinatorics · Mathematics 2023-09-19 Jason Bell , Haggai Liu , Marni Mishna

We propose a method for computing generating functions of genus-zero invariants of a gauged linear sigma model $(V, G, \theta, w)$. We show that certain derivatives of $I$-functions of quasimap invariants of $[V //_\theta G]$ produce…

Algebraic Geometry · Mathematics 2026-01-01 Mark Shoemaker

We prove a conjecture dating back to a 1978 paper of D.R.\ Musser~\cite{musserirred}, namely that four random permutations in the symmetric group $\mathcal{S}_n$ generate a transitive subgroup with probability $p_n > \epsilon$ for some…

Probability · Mathematics 2014-12-12 Robin Pemantle , Yuval Peres , Igor Rivin

It is shown that the sequence of rational numbers $r(k)$ generated by the ordinary generating function $\prod_{k=1}^\infty (1+x^k/k)$ converges to a limit $C > 0$. $C$ can be expressed as $C = \exp\Bigl(-\sum_{k = 2}^\infty…

Combinatorics · Mathematics 2019-04-17 Andreas B. G. Blobel

In this paper, we study the zero sets of the confluent hypergeometric function $_{1}F_{1}(\alpha;\gamma;z):=\sum_{n=0}^{\infty}\frac{(\alpha)_{n}}{n!(\gamma)_{n}}z^{n}$, where $\alpha, \gamma, \gamma-\alpha\not\in \mathbb{Z}_{\leq 0}$, and…

Classical Analysis and ODEs · Mathematics 2015-10-06 Wei-Chuan Lin , Xu-Dan Luo

Symmetric mass generation is a novel mechanism to give gapless fermions a mass gap by non-perturbative interactions without generating any fermion bilinear condensation. The previous studies of symmetric mass generation have been limited to…

Strongly Correlated Electrons · Physics 2023-05-23 Da-Chuan Lu , Meng Zeng , Juven Wang , Yi-Zhuang You

We consider any cancellative monoid $M$ equipped with a discrete degree map $deg:M\to R_{\ge0}$ and associated generating function $P(t)=\sum_{m\in M}t^{deg(m)}$, called the growth function of $M$. We also introduce, using some towers of…

Combinatorics · Mathematics 2012-02-27 Kyoji Saito

We revisit the low-energy effective $U(1)$ action of topologically twisted $\mathcal N=2$ SYM theory with gauge group of rank one on a generic oriented smooth 4-manifold $X$ with nontrivial fundamental group. After including a specific new…

High Energy Physics - Theory · Physics 2022-04-07 Johannes Aspman , Elias Furrer , Georgios Korpas , Zhi-Cong Ong , Meng-Chwan Tan

We give an improved algorithm for counting the number of $1324$-avoiding permutations, resulting in $14$ further terms of the generating function, which is now known for all patterns of length $\le 50$. We re-analyse the generating function…

Combinatorics · Mathematics 2017-11-21 Andrew R. Conway , Anthony J. Guttmann , Paul Zinn-Justin

There is an emerging class of permutation factorization questions that cannot be expressed wholly in terms of the centre of the group algebra of the symmetric group. We shall term these non-central. A notable instance appears in recent work…

Combinatorics · Mathematics 2011-10-14 D. M. Jackson , C. A. Sloss

Define a permutation $\sigma$ to be coprime if $\gcd(m,\sigma(m)) = 1$ for $m\in[n]$. In this note, proving a recent conjecture of Pomerance, we prove that the number of coprime permutations on $[n]$ is $n!\cdot (c+o(1))^n$ where \[c =…

Number Theory · Mathematics 2022-03-30 Ashwin Sah , Mehtaab Sawhney

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…

Combinatorics · Mathematics 2016-07-21 David Callan , Shi-Mei Ma , Toufik Mansour

Let $M$ be a positive homogeneously presented cancellative monoid ${< L \mid R >}_{mo}$ equipped with the degree map $\deg:M \to \Z_{\ge0}$ defined by assigning to each equivalence class of words the length of the words, and let $P_{M,…

Combinatorics · Mathematics 2013-02-26 Ishibe Tadashi

Let $V$ be a $d$-dimensional vector space over a finite field $\mathbb{F}$ equipped with a non-degenerate hermitian, alternating, or quadratic form. Suppose $|\mathbb{F}|=q^2$ if $V$ is hermitian, and $|\mathbb{F}|=q$ otherwise. Given…

Group Theory · Mathematics 2022-05-24 S. P. Glasby , Alice C. Niemeyer , Cheryl E. Praeger

Given a permutation $\pi$ chosen uniformly from $S_n$, we explore the joint distribution of $\pi(1)$ and the number of descents in $\pi$. We obtain a formula for the number of permutations with $\des(\pi)=d$ and $\pi(1)=k$, and use it to…

Combinatorics · Mathematics 2007-05-23 Mark Conger

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

Classical Analysis and ODEs · Mathematics 2025-11-17 Alex Kasman , Robert Milson

This survey is devoted to the classical and modern problems related to the entire function ${\sigma({\bf u};\lambda)}$, defined by a family of nonsingular algebraic curves of genus $2$, where ${\bf u} = (u_1,u_3)$ and $\lambda = (\lambda_4,…

Algebraic Geometry · Mathematics 2025-12-23 Takanori Ayano , Victor M. Buchstaber

Suppose $c_n(\sigma)$ denotes the number of cyclic permutations in $\mathcal{S}_n$ that avoid a pattern $\sigma$. In this paper, we define partial groupoid structures on cyclic pattern-avoiding permutations that allow us to build larger…

Combinatorics · Mathematics 2025-05-08 Kassie Archer , Christina Graves , Robert Laudone