Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2605.10276

Principal specializations of Grothendieck polynomials

Haojun Bai·Feng Gu·Peter L. Guo·Jiaji Liu
View original source ↗Read source document ↗Export metadata ↓

Abstract

Motivated by Stanley's ``Schubert shenanigans'' paper, commendable attempts have been made to understand the principal specializations of Schubert or Grothendieck polynomials. In this paper, we prove that when a permutation $w$ does not contain the $1423$ pattern, the principal specialization of the corresponding $β$-Grothendieck polynomial can be expressed nonnegatively in terms of the occurrences of patterns in $w$. Using an inverse conservation principle, we further obtain the nonnegativity expansion for permutations avoiding the $1342$ pattern. Our results partially resolve conjectures raised respectively by Gao (independently observed by Gaetz), Meśzáros--Tanjaya, and Dennin. The proofs are achieved based upon a reduction algorithm performing on the classic pipe dream model of $β$-Grothendieck polynomials.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Haojun Bai, Feng Gu, Peter L. Guo, Jiaji Liu. 2026-05-11. Principal specializations of Grothendieck polynomials. https://arxiv.org/abs/2605.10276

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

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗