Search arXivSearch

arXiv · 2106.03828

A $q$-deformation of an algebra of Klyachko and Macdonald's reduced word formula

Abstract

There is a striking similarity between Macdonald's reduced word formula and the image of the Schubert class in the cohomology ring of the permutahedral variety $\mathrm{Perm}_n$ as computed by Klyachko. Toward understanding this better, we undertake an in-depth study of a $q$-deformation of the $\mathbb{S}_n$-invariant part of the rational cohomology ring of $\mathrm{Perm}_n$, which we call the $q$-Klyachko algebra. We uncover intimate links between expansions in the basis of squarefree monomials in this algebra and various notions in algebraic combinatorics, thereby connecting seemingly unrelated results by finding a common ground to study them. Our main results are as follows. 1) A $q$-analog of divided symmetrization ($q$-DS) using Yang-Baxter elements in the Hecke algebra. It is a linear form that picks up coefficients in the squarefree basis. 2) A relation between $q$-DS and the ideal of quasisymmetric polynomials involving work of Aval--Bergeron--Bergeron. 3) A family of polynomials in $q$ with nonnegative integral coefficients that specialize to Postnikov's mixed Eulerian numbers when $q=1$. We refer to these new polynomials as remixed Eulerian numbers. For $q>0$, their normalized versions occur as probabilities in the internal diffusion limited aggregation (IDLA) stochastic process. 4) A lift of Macdonald's reduced word identity in the $q$-Klyachko algebra. 5) The Schubert expansion of the Chow class of the standard split Deligne--Lusztig variety in type $A$, when $q$ is a prime power.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Philippe Nadeau, Vasu Tewari. 2021-06-07. A $q$-deformation of an algebra of Klyachko and Macdonald's reduced word formula. https://arxiv.org/abs/2106.03828

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

KEEP EXPLORING

Related papers

Small doublings in abelian groups of prime power torsion

Let $A$ be a subset of $G$, where $G$ is a finite abelian group of torsion $r$. It was conjectured by Ruzsa that if $|A+A|\leq K|A|$, then $A$ is contained in a coset of $G$ of size at most $r^{CK}|A|$ for some constant $C$. The case $r=2$ received considerable attention in a sequence of papers, and was resolved by Green and Tao. Recently, Even-Zohar and Lovett settled the case when $r$ is a prime. In this paper, we confirm the conjecture when $r$ is a power of prime. In particular, the bound we obtain is tight.

math.CO

Graph Polynomial for Colored Embedded Graphs: A Topological Approach

We study finite graphs embedded in oriented surfaces by associating a polynomial to it. The tools used in developing a theory of such graph polynomials are algebraic topological while the polynomial itself is inspired from ideas arising in physics. We also analyze a variant of these polynomials for colored embedded graphs. This is used to describe the change in the polynomial under basic graph theoretic operations. We conclude with several applications of this polynomial including detection of certain classes of graphs and the connection of this polynomial with topological entanglement entropy.

math.CO

Schur positivity of the spiders $S(a,2,1)$ and $S(a,4,1)$ via noncommutative symmetric functions

We prove that the spider graphs $S(a,2,1)$ and $S(a,4,1)$ are Schur positive for all integers $a\ge1$. Together with the known $e$-positivity results, this completes the $e$- and Schur-positivity classification of both families. Our approach uses noncommutative symmetric functions, including a particularly simple ribbon expansion for the path lift with coefficients given by powers of two. We give a new proof of the Shareshian--Wachs path formula at $t=1$ and construct corresponding lifts for spiders. The Littlewood--Richardson rule converts their ribbon expansions into a general Schur-coefficient formula in terms of weighted Yamanouchi words. Mass-preserving multi-injections and a reduction to finitely many inequalities in degree $10$ then prove the required positivity; exact computer verification of these inequalities completes the proof in full generality.

math.CO