Search arXivSearch

arXiv · 2408.09313

Some results related to the slide decomposition of Schubert polynomials

Abstract

The expansion of a Schubert polynomial into slide polynomials corresponds to a sum over sub-balls in the subword complex. There has been recent interest in other, coarser, expansions of Schubert polynomials. We extend the methods used in [KM04] to prove that the subword complex is a ball or a sphere to a more general method, and use it to prove that the expansion of a Schubert polynomial into forest polynomials also corresponds to a sum over sub-balls in the subword complex. When expanding the product $\mathfrak{S}_π\mathfrak{S}_ρ$ of two Schubert polynomials into Schubert polynomials $\mathfrak{S}_σ$, there is a bijection between shuffles of reduced words for $π$ and $ρ$ and reduced words for $σ$ (counted with multiplicity). We give such a bijection for Monk's rule and Sottile's Pieri rule. We give tableau-based definitions of slide polynomials, glide polynomials, and fundamental quasisymmetric polynomials and show that the expansion of a Schur polynomial into fundamental quasisymmetric polynomials corresponds to a sum over sub-balls in the tableau complex. The Schubert polynomials are the cohomology classes of matrix Schubert varieties, but there is no geometric explanation of the slide polynomials. We show that the slide polynomials are not (antidiagonal) Gröbner degenerations of matrix Schubert varieties, answering in the negative a question of [ST21, Section 1.4].

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Thomas Bååth. 2024-08-18. Some results related to the slide decomposition of Schubert polynomials. https://arxiv.org/abs/2408.09313

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

KEEP EXPLORING

Related papers

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

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