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

推荐订阅源

V
V2EX
P
Proofpoint News Feed
D
DataBreaches.Net
C
Check Point Blog
L
LangChain Blog
量子位
美团技术团队
Vercel News
Vercel News
人人都是产品经理
人人都是产品经理
N
Netflix TechBlog - Medium
V
Visual Studio Blog
Microsoft Security Blog
Microsoft Security Blog
博客园 - 【当耐特】
MongoDB | Blog
MongoDB | Blog
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
Last Week in AI
Last Week in AI
The GitHub Blog
The GitHub Blog
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
U
Unit 42
腾讯CDC
M
MIT News - Artificial intelligence
Microsoft Azure Blog
Microsoft Azure Blog
Blog — PlanetScale
Blog — PlanetScale

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}}$
Chevalley operations on TNN Grassmannians
Prateek Kumar Vishwakarma · 2025-02-26 · via math.CO updates on arXiv.org

Lusztig showed that invertible totally nonnegative (TNN) matrices form a semigroup generated by positive diagonal matrices and Chevalley generators. From its Grassmann analogue, we introduce Chevalley operations on index sets, which we show have a rich variety of applications. We first completely classify all inequalities that are quadratic in Plucker coordinates over the TNN part of the Grassmannian: \[\sum_{I,J}c_{I,J}Δ_IΔ_J\ge 0\quad over\quad \mathrm{Gr}^{\ge 0}(m,m+n)\] where each $c_{I,J}$ is real, and $Δ_I,Δ_J$ are Plucker coordinates with a homogeneity condition. Using an idea of Gekhtman-Shapiro-Vainshtein, we also explain how our Chevalley operations can be motivated from cluster mutations, and lead to working in Grassmannians of smaller dimension, akin to cluster algebras. We then present several applications of Chevalley operations. First, we obtain certificates for the above inequalities via sums of coefficients $c_{I,J}$ over 321-avoiding permutations and involutions; we believe this refined results of Rhoades-Skandera for TNN-matrix inequalities via their Temperley-Lieb immanant idea. Second, we provide a novel proof via Chevalley operations of Lam's log-supermodularity of Plucker coordinates. This has several consequences: (a) Each positroid, corresponding to the positroid cells in Postnikov's decomposition of the TNN Grassmannian, is a distributive lattice. (b) It also yields numerical positivity in the main result of Lam-Postnikov-Pylyavskyy. (c) We show the coordinatewise monotonicity of ratios of Schur polynomials, first proved by Khare-Tao and which is the key result they use to obtain quantitative estimates for positivity preservers. Third, we employ Chevalley operations to show that the majorization order over partitions implicates a partial order for induced character immanants over TNN matrices, proved originally by Skandera-Soskin.