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

推荐订阅源

C
Check Point Blog
有赞技术团队
有赞技术团队
博客园 - 三生石上(FineUI控件)
博客园_首页
博客园 - 【当耐特】
WordPress大学
WordPress大学
月光博客
月光博客
博客园 - 叶小钗
S
SegmentFault 最新的问题
雷峰网
雷峰网
H
Help Net Security
宝玉的分享
宝玉的分享
A
About on SuperTechFans
IT之家
IT之家
J
Java Code Geeks
Hugging Face - Blog
Hugging Face - Blog
D
DataBreaches.Net
酷 壳 – CoolShell
酷 壳 – CoolShell
博客园 - 聂微东
T
The Blog of Author Tim Ferriss
B
Blog
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
H
Hackread – Cybersecurity News, Data Breaches, AI and More
Y
Y Combinator 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}}$
A generalization of Steinberg theory and an exotic moment...
Lucas Fresse, Kyo Nishiyama · 2019-04-30 · via math.CO updates on arXiv.org

For a reductive group $G$, Steinberg established a map from the Weyl group to the set of nilpotent $G$-orbits by using moment maps on double flag varieties. In particular, in the case of the general linear group, it provides a geometric interpretation of the Robinson-Schensted correspondence between permutations and pairs of standard tableaux of the same shape. We extend Steinberg's approach to the case of a symmetric pair $(G,K)$ to obtain two different maps, namely a \emph{generalized Steinberg map} and an \emph{exotic moment map}. Although the framework is general, in this paper we focus on the pair $(G,K) = (\mathrm{GL}_{2n}(\mathbb{C}), \mathrm{GL}_n(\mathbb{C}) \times \mathrm{GL}_n(\mathbb{C}))$. Then the generalized Steinberg map is a map from \emph{partial} permutations to the pairs of nilpotent orbits in $ \mathfrak{gl}_n(\mathbb{C}) $. It involves a generalization of the classical Robinson--Schensted correspondence to the case of partial permutations. The other map, the exotic moment map, establishes a combinatorial map from the set of partial permutations to that of signed Young diagrams, i.e., the set of nilpotent $K$-orbits in the Cartan space $(\mathrm{Lie}(G)/\mathrm{Lie}(K))^* $. We explain the geometric background of the theory and combinatorial algorithms which produce the above mentioned maps.