Papers
Topics
Authors
Recent
Search
2000 character limit reached

Chow functions for partially ordered sets

Published 6 Nov 2024 in math.CO and math.AG | (2411.04070v2)

Abstract: Three decades ago, Stanley and Brenti initiated the study of the Kazhdan--Lusztig--Stanley (KLS) functions, putting on common ground several polynomials appearing in algebraic combinatorics, discrete geometry, and representation theory. In the present paper we develop a theory that parallels the KLS theory. To each kernel in a given poset, we associate a polynomial function that we call the \emph{Chow function}. The Chow function often exhibits remarkable properties, and sometimes encodes the graded dimensions of a cohomology or Chow ring. The framework of Chow functions provides natural polynomial analogs of graded module decompositions that appear in algebraic geometry, but that work for arbitrary posets, even when no graded module decomposition is known to exist. In this general framework, we prove a number of unimodality and positivity results without relying on versions of the Hard Lefschetz theorem. Our framework shows that there is an unexpected relation between positivity and real-rootedness conjectures about chains on face lattices of polytopes by Brenti and Welker, Hilbert--Poincar\'e series of matroid Chow rings by Ferroni and Schr\"oter, and flag enumerations on Bruhat intervals of Coxeter groups by Billera and Brenti.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.