惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

H
Help Net Security
爱范儿
爱范儿
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
博客园 - 三生石上(FineUI控件)
大猫的无限游戏
大猫的无限游戏
Hugging Face - Blog
Hugging Face - Blog
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
Vercel News
Vercel News
人人都是产品经理
人人都是产品经理
G
Google Developers Blog
WordPress大学
WordPress大学
S
SegmentFault 最新的问题
雷峰网
雷峰网
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
Jina AI
Jina AI
博客园 - 叶小钗
D
DataBreaches.Net
D
Docker
月光博客
月光博客
博客园 - 司徒正美
Last Week in AI
Last Week in AI
有赞技术团队
有赞技术团队
腾讯CDC
酷 壳 – CoolShell
酷 壳 – CoolShell

math.CO updates on arXiv.org

Complement Submodular Information Measures for Balanced and Robust Data Selection A Proof of a Conjecture on Positive and Negative Square Energies of Unicyclic Graphs Laplacian Spectrum of the Weakly Zero-Divisor Graph of a Finite Commutative Ring An identity for second Eulerian numbers via lattice-point counting $t$-tone edge coloring of graphs Constructing Maximal Bumpless Pipedreams for Double Grothendieck Polynomials Mubayi's Polynomial-Ideal Conjecture and Cover-Ideal Turán Methods Implicit Binarization via Complex Phase Dynamics in Combinatorial Optimization The limits of Schur multipliers in Pólya conversion problems for the $q$-permanent function Universality theorems for generalized splines Framing Triangulations for Arbitrary Integer Flow Polytopes On the Common Generalization of Gentle Algebras and Framed Directed Acyclic Graphs The complexity of frugal digraph homomorphisms Chaotic and periodic behavior of jeu de taquin on infinite Young tableaux Enumerating Pattern Avoiding Parking Functions Incidence toric ideals and three-point functions Unique Winning Opening Move in Three-Row Chomp Strong majority colorings of graphs A Balancing Theorem for Spanning Trees of Rectangular Grid Graphs Spectral radius and edge-disjoint connected factors of graphs New invariants for rank metric codes, with applications to the classification of rank two semifields of order 256 Flexible DP-4-coloring of planar graphs without 4-cycles and intersecting triangles Balanced intersection size distributions in projective planes List Reconstruction Problem with List Size Two Is Dimensionality a Barrier for Retrieval Models? The INIEP: Irreducible and Positive Realizations The number of Pfaffian orientations on punctured polygonally cellulated surfaces Explicit Construction of Polytopes whose Ehrhart Polynomials Realize any Given Sign Pattern Finite-state enumeration of adjacency-constrained 132-avoiding permutations AMDS and quantum AMDS Constacyclic codes of length $4p^ς$ over $\mathbb{F}_{{p}^{m}}$
Explicit formulas for permutation pattern character polyn...
[Submitted on 28 Oct 2023 (v1), last revised 22 Aug 2026 (this v · 2023-10-29 · via math.CO updates on arXiv.org

View PDF HTML (experimental)

Abstract:Given permutations $\pi \in S_n$ and $\sigma \in S_k$, let $N_\sigma(\pi)$ denote the number of occurrences of $\sigma$ in $\pi$. While pattern avoidance and the distribution of pattern occurrences in permutations have been extensively studied, their interactions with the group structure on $S_n$ are still poorly understood. Gaetz and Ryba showed that the expected value of $\chi^{\lambda[n]}(\pi)N_\sigma(\pi)$ for $\pi \in S_n$ is given by a polynomial $a_\sigma^\lambda(n)$. More recently, Gaetz and Pierson derived explicit formulas for $a_{\mathrm{id}_k}^\lambda(n)$ when $\lvert\lambda\rvert \le 2$, which led them to conjecture that the polynomials $a_{\mathrm{id}_k}^\lambda(n)$ are real-rooted and nonnegative for $n \ge k$. We show that for all partitions $\lambda$, the polynomials $a_{\mathrm{id}_k}^\lambda(n)$ admit explicit closed forms in $n$ and $k$. These formulas allow us to exhibit counterexamples to Gaetz and Pierson's real-rootedness conjecture as well as to prove special cases of their nonnegativity conjecture. Our results imply that the expected value of $f \cdot N_{\mathrm{id}_k}$ on $S_n$ admits a closed form whenever $f$ is a permutation statistic expressible as a polynomial in the functions $m_j \colon \bigsqcup_{n \ge 0} S_n \to \mathbb{Z}$ which count $j$-cycles in their inputs.

Submission history

From: Jonas Iskander [view email]
[v1] Sat, 28 Oct 2023 19:56:53 UTC (36 KB)
[v2] Sat, 22 Aug 2026 18:27:34 UTC (93 KB)