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

推荐订阅源

Martin Fowler
Martin Fowler
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
雷峰网
雷峰网
J
Java Code Geeks
G
Google Developers Blog
博客园 - 司徒正美
The GitHub Blog
The GitHub Blog
L
LangChain Blog
人人都是产品经理
人人都是产品经理
GbyAI
GbyAI
Vercel News
Vercel News
S
SegmentFault 最新的问题
Engineering at Meta
Engineering at Meta
H
Hackread – Cybersecurity News, Data Breaches, AI and More
云风的 BLOG
云风的 BLOG
F
Fortinet All Blogs
Y
Y Combinator Blog
博客园_首页
Last Week in AI
Last Week in AI
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
罗磊的独立博客
A
About on SuperTechFans
B
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}}$
Lowering operators, orthogonal decomposition of tensor sp...
Stephen Doty, Anthony Giaquinto, Stuart Martin · 2025-11-01 · via math.CO updates on arXiv.org

For $q$ generic, Jimbo showed that $q$-tensor space $V_q^{\otimes r}$ (where $V_q$ is the $n$-dimensional vector representation) satisfies Schur--Weyl duality with respect to the commuting actions of the quantized enveloping algebra $\mathbf{U}_q(\mathfrak{gl}_n)$ and the Iwahori--Hecke algebra $\mathbf{H}_q(\mathfrak{S}_r)$, with the latter action derived from the $R$-matrix. In the limit as $q \to 1$, one recovers classical Schur--Weyl duality. Using a recursive construction of certain linear combinations $Ψ_j$ of Coxeter monomials in the negative part of $\mathbf{U}_q(\mathfrak{gl}_n)$, we give a combinatorial realization of the corresponding isotypic semisimple decomposition of $V_q^{\otimes r}$, indexed by paths in the Bratteli diagram. This extends earlier work (Journal of Algebra 2024) of the first two authors for the case $n =2$. Our construction works over any field containing a non-zero element $q$ which is not a root of unity. The element $Ψ_j$ depends on a weight $λ$ and is the ``evaluation at $λ$'' of a certain $q$-lowering operator $\overlineΨ_j$ satisfying a similar recursion, up to renormalization. This simplifies the construction of lowering operators. Both $Ψ_j$ and $\overlineΨ_j$ are independent of a choice of root vectors. On the other hand, the $Ψ_j$ can be applied to construct root vectors (independent of the braid group action) as explicit linear combinations of Coxeter monomials.