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

推荐订阅源

博客园 - 司徒正美
Jina AI
Jina AI
Microsoft Azure Blog
Microsoft Azure Blog
博客园 - 三生石上(FineUI控件)
宝玉的分享
宝玉的分享
MyScale Blog
MyScale Blog
I
InfoQ
爱范儿
爱范儿
Microsoft Security Blog
Microsoft Security Blog
酷 壳 – CoolShell
酷 壳 – CoolShell
Stack Overflow Blog
Stack Overflow Blog
T
Tailwind CSS Blog
D
DataBreaches.Net
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
T
The Blog of Author Tim Ferriss
B
Blog
阮一峰的网络日志
阮一峰的网络日志
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
月光博客
月光博客
雷峰网
雷峰网
Recent Announcements
Recent Announcements
量子位
B
Blog RSS Feed

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}}$
Weak Order on the MacNeille Completion of Bruhat Order
[Submitted on 8 May 2026 (v1), last revised 6 Sep 2026 (this ver · 2026-05-09 · via math.CO updates on arXiv.org

View PDF HTML (experimental)

Abstract:Let $\mathrm{Mac}(W)$ be the MacNeille completion of the Bruhat order of a Coxeter group $W$. We introduce an action of the $0$-Hecke monoid of type $W$ on $\mathrm{Mac}(W)$, which allows us to define a weak order and a descent set statistic on $\mathrm{Mac}(W)$. When $W$ is of type $A$, we recover constructions of Hamaker and Reiner, which were originally formulated in terms of monotone triangles and alternating sign matrices. Using this action, we prove that certain unions of Knutson--Miller subword complexes are vertex-decomposable. By specializing to type $A$, we prove a conjecture of Escobar, Klein, and Weigandt regarding Cohen--Macaulay ASM varieties. Along the way, we also exhibit a counterexample to a conjecture of Hamaker and Reiner regarding the poset topology of intervals in the ASM weak order. When $W$ is finite, our action also gives rise to a Boolean cell complex with one facet for each element of $\mathrm{Mac}(W)$. We prove that this is an abstract simplicial complex and that every linear extension of the weak order on $\mathrm{Mac}(W)$ is a shelling order for its facets. Finally, when $W$ is finite and irreducible, we use our $0$-Hecke action to introduce a noninvertible dynamical system on $\mathrm{Mac}(W)$ that we call the \emph{MacNeille pop-stack operator}, and we prove that the maximum number of iterations of this operator needed to reach the bottom state is $h-1$, where $h$ is the Coxeter number of $W$.
This article is meant to serve as a case study in using large language models to automate the workflow of mathematical research. The proof of the conjecture of Escobar--Klein--Weigandt and the disproof of the conjecture of Hamaker--Reiner were obtained autonomously by ChatGPT 5.4 Pro. Other aspects of the paper were obtained mostly by the author, but ChatGPT expedited the process. We provide a detailed account of this interaction.

Submission history

From: Colin Defant [view email]
[v1] Fri, 8 May 2026 17:23:19 UTC (151 KB)
[v2] Sun, 6 Sep 2026 14:26:56 UTC (152 KB)