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

推荐订阅源

博客园_首页
MongoDB | Blog
MongoDB | Blog
Google DeepMind News
Google DeepMind News
M
MIT News - Artificial intelligence
D
Docker
云风的 BLOG
云风的 BLOG
B
Blog
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
G
Google Developers Blog
GbyAI
GbyAI
T
Tailwind CSS Blog
罗磊的独立博客
博客园 - 三生石上(FineUI控件)
V
Visual Studio Blog
C
Check Point Blog
I
InfoQ
Microsoft Azure Blog
Microsoft Azure Blog
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
阮一峰的网络日志
阮一峰的网络日志
小众软件
小众软件
N
Netflix TechBlog - Medium
B
Blog RSS Feed
腾讯CDC
aimingoo的专栏
aimingoo的专栏

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}}$
On Kostant's weight $q$-multiplicity formula for $\mathfr...
Pamela E. Harris, Peter Hollander, Daniel C. Qin, Maria Rodrigue · 2021-08-17 · via math.CO updates on arXiv.org

Kostant's weight $q$-multiplicity formula is an alternating sum over a finite group known as the Weyl group, whose terms involve the $q$-analog of Kostant's partition function. The $q$-analog of the partition function is a polynomial-valued function defined by $\wp_q(ξ)=\sum_{i=0}^k c_i q^i$, where $c_i$ is the number of ways the weight $ξ$ can be written as a sum of exactly $i$ positive roots of a Lie algebra $\mathfrak{g}$. The evaluation of the $q$-multiplicity formula at $q = 1$ recovers the multiplicity of a weight in an irreducible highest weight representation of $\mathfrak{g}$. In this paper, we specialize to the Lie algebra $\mathfrak{sp}_6(\mathbb{C})$ and we provide a closed formula for the $q$-analog of Kostant's partition function, which extends recent results of Shahi, Refaghat, and Marefat. We also describe the supporting sets of the multiplicity formula (known as the Weyl alternation sets of $\mathfrak{sp}_6(\mathbb{C})$), and use these results to provide a closed formula for the $q$-multiplicity for any pair of dominant integral weights of $\mathfrak{sp}_6(\mathbb{C})$. Throughout this work, we provide code to facilitate these computations.