跳到正文
研踪PaperTrail

论文库

检索计算机领域论文,按研究方向、作者或关键词筛选。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+0新增论文
+0其中 AI 相关
+0已有论文修订
+91新增 AI 导读

arXiv 最近完成扫描:2026-11-22 08:44 · 全站最近入库:2026-11-21 12:19各信源进度 →

统计口径与数据新鲜度

统计 2026-11-21 13:24 — 2026-11-22 13:24(北京时间) · 点击数字查看对应简报;AI 相关包含在新增论文内。

最近完成检查:2026-11-22 08:44最近发现新增版本:2026-11-21 12:19库内论文最新更新时间:2026-11-20 02:59

每分钟刷新已保存的数据。空检查不代表采集异常;新收录可能包含历史论文。AI 导读按新增版本计数。

29,158 已收录论文24,181 AI 相关8,992 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常,查看状态 →

找到 1 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-22 08:42(北京时间)
新论文 · v1arXiv:2611.25741

Beyond geometric lattices: pseudo-atoms and redundant join representations in the face lattice of the permutohedron

Giovanni Rossi

原文摘要

We study the lattice obtained from the poset of ordered set partitions (the Fubini poset), ordered by merging adjacent blocks, by adjoining a bottom element of rank -1. It is the face lattice of the permutohedron. We look at it from the point of view of geometric lattices: it is graded, atomic and coatomic in the strong sense that every element is a meet of coatoms, but it is not semimodular. Its atoms are the $n!$ permutations, and its elements of rank one, which we call pseudo-atoms, are the edges of the permutohedron. Describing ordered set partitions by chains of subsets, the cuts, we show that the rank is modular whenever the meet is above $\bot$, while the join of two distant atoms can have large rank, so that the rank of the join is a metric on permutations. An element has a unique representation as a join of atoms only up to rank one; above it, irredundant representations have sizes ranging from two to the rank, and the redundancy of an element is its number of atoms minus two. The Möbius function is that of an Eulerian lattice, the Whitney numbers are the face numbers of the permutohedron, and the characteristic polynomial has the alternating coefficients of the geometric case, but only $\bot$ and $\top$ are left-modular, so the lattice is not supersolvable. We show that it is CL-shellable, we exhibit EL-labelings for $n\le5$, and we compare the independent sets of Raz arXiv:2307.05005 (v3, Jan. 2026) with irredundant families and with the matroid of the vertices of the permutohedron. Replacing ordered set partitions by partial flags of subspaces of $\mathbb F_q^n$ gives a $q$-analogue, whose Möbius function is $(-1)^{\mathrm{rk}+1}q^κ$, with $κ$ the number of pairs of elements in a common block at $q=1$, and whose characteristic polynomial and Betti numbers are polynomials in $q$.

math.CO · cs.DM