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

推荐订阅源

T
The Blog of Author Tim Ferriss
IT之家
IT之家
Engineering at Meta
Engineering at Meta
WordPress大学
WordPress大学
博客园 - 三生石上(FineUI控件)
博客园 - 聂微东
C
Check Point Blog
T
Tailwind CSS Blog
博客园 - Franky
H
Help Net Security
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
Google DeepMind News
Google DeepMind News
博客园 - 叶小钗
J
Java Code Geeks
腾讯CDC
罗磊的独立博客
爱范儿
爱范儿
阮一峰的网络日志
阮一峰的网络日志
Martin Fowler
Martin Fowler
酷 壳 – CoolShell
酷 壳 – CoolShell
I
InfoQ
B
Blog
V
Visual Studio Blog
F
Fortinet All Blogs

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 generalized Steinberg theory for type AIII
Lucas Fresse, Kyo Nishiyama · 2021-03-15 · via math.CO updates on arXiv.org

Given a symmetric pair $(G,K)=(\mathrm{GL}_{p+q}(\mathbb{C}),\mathrm{GL}_{p}(\mathbb{C})\times \mathrm{GL}_{q}(\mathbb{C}))$ of type AIII, we consider the diagonal action of $K$ on the double flag variety $\mathfrak{X}=\mathrm{Grass}(\mathbb{C}^{p+q},r)\times K/B_K$ whose first factor is a Grassmann variety for $G$ and whose second factor is a full flag variety of $K$. There is a finite number of orbits for this action, and our first result is a description of these orbits: parametrization, dimensions, closure relations, and cover relations. Specifically, the orbits are parametrized by certain pairs of partial permutations. Each orbit in $\mathfrak{X}$ gives rise to a conormal bundle. As in the references [5] and [6], by using the moment map associated to the action, we define a so-called symmetrized Steinberg map, respectively an exotic Steinberg map, which assigns to each such conormal bundle (thus to each orbit) a nilpotent orbit in the Lie algebra of $K$, respectively in the Cartan complement of that Lie algebra. Our main result is an explicit description of these Steinberg maps in terms of combinatorial algorithms on partial permutations, extending the classical Robinson--Schensted procedure on permutations. This is a thorough generalization of the results in [5], where we supposed $p=q=r$ and considered orbits of special forms.