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

推荐订阅源

J
Java Code Geeks
腾讯CDC
博客园 - 聂微东
爱范儿
爱范儿
罗磊的独立博客
P
Proofpoint News Feed
博客园 - Franky
博客园 - 三生石上(FineUI控件)
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
酷 壳 – CoolShell
酷 壳 – CoolShell
Jina AI
Jina AI
Blog — PlanetScale
Blog — PlanetScale
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
博客园 - 司徒正美
美团技术团队
MongoDB | Blog
MongoDB | Blog
WordPress大学
WordPress大学
A
About on SuperTechFans
I
InfoQ
博客园_首页
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
H
Help Net Security
Microsoft Azure Blog
Microsoft Azure Blog
G
Google Developers Blog

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}}$
The Whitney Duals of a Graded Poset
Rafael S. González D'León, Joshua Hallam · 2018-03-08 · via math.CO updates on arXiv.org

We introduce the notion of a \emph{Whitney dual} of a graded poset. Two posets are Whitney duals to each other if (the absolute value of) their Whitney numbers of the first and second kind are interchanged between the two posets. We define new types of edge and chain-edge labelings which we call \emph{Whitney labelings}. We prove that every graded poset with a Whitney labeling has a Whitney dual. Moreover, we show how to explicitly construct a Whitney dual using a technique involving quotient posets. As applications of our main theorem, we show that geometric lattices, the lattice of noncrossing partitions, the poset of weighted partitions studied by González D'León-Wachs, and most of the R$^*$S-labelable posets studied by Simion-Stanley all have Whitney duals. Our technique gives a combinatorial description of a Whitney dual of the noncrossing partition lattice in terms of a family of noncrossing Dyck paths. Our method also provides an explanation of the Whitney duality between the poset of weighted partitions and a poset of rooted forests studied by Reiner and Sagan. An integral part of this explanation is a new chain-edge labeling for the poset of weighted partitions which we show is a Whitney labeling. Finally, we show that a graded poset with a Whitney labeling admits a local action of the $0$-Hecke algebra of type $A$ on its set of maximal chains. The characteristic of the associated representation is Ehrenborg's flag quasisymmetric function. The existence of this action implies, using a result of McNamara, that when the maximal intervals of the constructed Whitney duals are bowtie-free, they are also snellable. In the case where these maximal intervals are lattices, they are supersolvable.