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

推荐订阅源

Last Week in AI
Last Week in AI
H
Help Net Security
博客园 - 叶小钗
V
Visual Studio Blog
阮一峰的网络日志
阮一峰的网络日志
博客园 - 三生石上(FineUI控件)
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
Microsoft Azure Blog
Microsoft Azure Blog
G
Google Developers Blog
腾讯CDC
MongoDB | Blog
MongoDB | Blog
宝玉的分享
宝玉的分享
P
Proofpoint News Feed
GbyAI
GbyAI
Microsoft Security Blog
Microsoft Security Blog
A
About on SuperTechFans
博客园 - 司徒正美
人人都是产品经理
人人都是产品经理
T
The Blog of Author Tim Ferriss
Martin Fowler
Martin Fowler
月光博客
月光博客
博客园 - 聂微东
酷 壳 – CoolShell
酷 壳 – CoolShell
Vercel News
Vercel News

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 Deodhar's Framework for Questions in ...
Rohit Agrawal, Vladimir Sotirov · 2021-07-19 · via math.CO updates on arXiv.org

We make progress on a question of Skandera by showing that a product of Kazhdan-Lusztig basis elements indexed by maximal elements of parabolic subgroups admits a Kazhdan-Lusztig basis element as a quotient arising from operations in the Schur algebroid if and only if the sequence of parabolic subgroups satisfy both a rigidity condition and a combinatorial criterion. For Weyl groups, the rigidity condition specializes to a necessary condition for smallness of Gelfand-MacPherson resolutions. For Schubert varieties indexed by 4231-avoiding permutations, we derive a stronger necessary condition that, up to an appropriate equivalence, is satisfied by at most one Gelfand-MacPherson resolution, and exactly one if and only if 45312 is also avoided. Moreover, we apply the combinatorial criterion to prove the (essentially unique) resolution is small when 34512 and 45123 are likewise avoided. We develop the combinatorial criterion as part of a generalization of Deodhar's combinatorial setting for questions in Kazhdan-Lusztig theory, which in the case of Weyl groups we show captures the Byałynicki-Birula decompositions of Gelfand-MacPherson resolutions. In particular, we obtain new combinatorial interpretations of Kazhdan-Lusztig polynomials, new algorithms for computing them, and in the case of Weyl groups, an equivalence of the existence of small Gelfand-MacPherson resolutions with that of certain factorizations and generating-function interpretations of the Poincaré polynomial of intersection cohomology of the Schubert variety.