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

推荐订阅源

J
Java Code Geeks
Martin Fowler
Martin Fowler
B
Blog RSS Feed
D
DataBreaches.Net
L
LangChain Blog
月光博客
月光博客
S
SegmentFault 最新的问题
阮一峰的网络日志
阮一峰的网络日志
V
Visual Studio Blog
美团技术团队
Jina AI
Jina AI
博客园 - 司徒正美
雷峰网
雷峰网
Last Week in AI
Last Week in AI
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
IT之家
IT之家
博客园 - 三生石上(FineUI控件)
WordPress大学
WordPress大学
小众软件
小众软件
罗磊的独立博客
博客园_首页
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
A
About on SuperTechFans
Engineering at Meta
Engineering at Meta

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}}$
Stanley decompositions of rings of invariants and certain...
William Q. Erickson, Markus Hunziker · 2023-10-07 · via math.CO updates on arXiv.org

The first half of this paper is largely expository, wherein we present a systematic combinatorial approach to the theory of polynomial (semi)invariants and multilinear invariants of several vectors and covectors, for the classical groups. This culminates in a graphical description of graded linear bases. By applying well-known results of lattice path combinatorics to Weyl's fundamental theorems of classical invariant theory, we write down Stanley decompositions and Hilbert-Poincare series in terms of families of non-intersecting lattice paths, enumerated with respect to certain corners. In the second half of the paper, we revisit the (semi)invariants in the first half as a special case of a much broader phenomenon. On one hand, polynomial invariants of a group $H$ can be generalized to modules of covariants, i.e., $H$-equivariant polynomial functions between $H$-modules. On the other hand, from the perspective of Roger Howe's theory of dual pairs, these modules of covariants can be viewed as infinite-dimensional simple $(\mathfrak{g}, K)$-modules. This suggests an expanded program in which our goal is to apply combinatorial techniques involving lattice paths in order to write down Hilbert series for arbitrary unitarizable highest-weight $(\mathfrak{g},K)$-modules. As a preview of future work in this program, we present examples showing how modules of covariants -- even those which are not Cohen-Macaulay, and therefore which we would not expect to be combinatorially nice -- can be decomposed in terms of lattice paths. We also extend these methods beyond the classical groups.