Search arXivSearch

arXiv · 2504.09123

Refinement of Hikita's $e$-positivity theorem via Abreu--Nigro's $g$-functions and restricted modular law

Abstract

We study the symmetric functions \( g_{\mm,k}(x;q) \), introduced by Abreu and Nigro for a Hessenberg function \( \mm \) and a positive integer \( k \), which refine the chromatic symmetric function. Building on Hikita's recent breakthrough on the Stanley--Stembridge conjecture, we prove the \( e \)-positivity of \( g_{\mm,k}(x;1) \), refining Hikita's result. We also provide a Schur expansion of the sum \( \sum_{k=1}^n e_k(x) g_{\mm,n-k}(x;q) \) in terms of \( P \)-tableaux with 1 in the upper-left corner. We introduce a restricted version of the modular law as our main tool. Then, we show that any function satisfying the restricted modular law is determined by its values on disjoint unions of path graphs.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

JiSun Huh, Byung-Hak Hwang, Donghyun Kim, Jang Soo Kim, Jaeseong Oh. 2025-04-12. Refinement of Hikita's $e$-positivity theorem via Abreu--Nigro's $g$-functions and restricted modular law. https://arxiv.org/abs/2504.09123

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO