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

推荐订阅源

Blog — PlanetScale
Blog — PlanetScale
Y
Y Combinator Blog
G
Google Developers Blog
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
L
LangChain Blog
S
SegmentFault 最新的问题
J
Java Code Geeks
V
Visual Studio Blog
H
Help Net Security
Stack Overflow Blog
Stack Overflow Blog
aimingoo的专栏
aimingoo的专栏
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
T
Tailwind CSS Blog
Microsoft Azure Blog
Microsoft Azure Blog
博客园_首页
H
Hackread – Cybersecurity News, Data Breaches, AI and More
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
博客园 - Franky
B
Blog RSS Feed
The Cloudflare Blog
MyScale Blog
MyScale Blog
月光博客
月光博客
Microsoft Security Blog
Microsoft Security Blog
美团技术团队

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}}$
Signed Mahonian Polynomials on Derangements in Classical ...
Kathy Q. Ji, Dax T. X. Zhang · 2024-02-06 · via math.CO updates on arXiv.org

The polynomial of the major index ${\rm maj}_W (σ)$ over the subset $T$ of the Coxeter group $W$ is called the Mahonian polynomial over $T$, where ${\rm maj}_W (σ)$ is a Mahonian statistic of an element $σ\in T$, whereas the polynomial of the major index ${\rm maj}_W (σ)$ with the sign $(-1)^{\ell_W(σ)}$ over the subset $T$ is referred to as the signed Mahonian polynomial over $T$, where ${\ell_W(σ)}$ is the length of $σ\in T$. Gessel, Wachs, and Chow established the formulas for the Mahonian polynomials over the sets of derangements in the symmetric group $S_n$ and the hyperoctahedral group $B_n$. By extending Wachs' approach and employing a refinement of Stanley's shuffle theorem established in our recent paper, we derive the formula for the Mahonian polynomials over the set of derangements in the even-signed permutation group $D_n$. This completes a picture which is now known for all the classical Weyl groups. Gessel-Simion, Adin-Gessel-Roichman, and Biagioli previously established formulas for the signed Mahonian polynomials over the classical Weyl groups. Building upon their formulas, we derive the formulas for the signed Mahonian polynomials over the set of derangements in classical Weyl groups. As applications of the formulas for the (signed) Mahonian polynomials over the sets of derangements in the classical Weyl groups, we obtain enumerative formulas of the number of derangements in classical Weyl groups with even lengths.