Searcharxiv⌕ Search

arXiv subjects

Matthew J. Samuel

Publications and source records attributed to Matthew J. Samuel.

9 recordsLinked to original sources

schubmult: Symbolic algorithms and input-sensitive bounds for Schubert multiplication

We present schubmult, a GPL-licensed Python system for exact multiplication of ordinary, double, quantum, and quantum double Schubert polynomials, as well as independent-alphabet triple and quantum triple products. Its central algorithm expands one factor into filtered column paths and couples them to Pieri computations on the other factor. Dynamic programming shares intermediate states, and the algorithm returns every Schubert-basis coefficient as an exact arithmetic circuit. We prove input-sensitive operation bounds for the entire product, not just a selected coefficient: for inputs of minimal rank $n$, the classical algorithms have complexity $2^{O(n\log n)}$ and polynomial complexity in $n$ for fixed Lehmer-code lengths. The quantum algorithms have the same general bound and polynomial complexity when, in addition, the number of nonzero entries in the Lehmer code of $v^{-1}$ is fixed. We describe the implementation and distinguish it from the algorithms analyzed, verify computations against independent routines and exact identities, and report reproducible timings for flag and Grassmannian workloads. Parabolic quantum products are treated separately via the Peterson-Woodward comparison.

math.CO↗

Dominant permutations, positive mixed-variable formulas, and product-splitting equivalence for (double) Schubert polynomials

We present new positive combinatorial formulas for triple Schubert coefficients in mixed-variable products of double Schubert polynomials, $\mathfrak{S}_u(x;y)\mathfrak{S}_v(x;z)$, expressed in the $\mathfrak{S}_w(x;y)$ basis, in the case where $u$ is dominant. This result complements earlier results where $v$ was assumed dominant. To generalize further, we introduce a relation on permutations that we call ``domination,'' under which dominant permutations dominate all others. When $u$ dominates $w$, we obtain an explicit positive formula for $c^w_{u,v}(y;z)$, which in particular yields positivity when $u$ and $v$ have separated descents. In addition to these new positivity results, we establish a product--splitting equivalence for double Schubert polynomials, relating triple Schubert coefficients to splitting coefficients. This equivalence highlights structural symmetries and provides reduction methods for computing coefficients that are otherwise difficult to access. Taken together, these results extend the range of double Schubert polynomial products for which positivity can be established combinatorially and yield explicit formulas that can be implemented computationally.

math.CO↗

Triple Quantum Schubert Calculus

We prove a triple quantum Pieri formula: the product of a quantum double Schubert polynomial $\widetilde{\mathfrak{S}}_u(x;y)$ by a quantum factorial elementary polynomial $\widetilde{E}_{p,k}(x;z)$ in a second set of variables $z$ is a sum over chains in the quantum Bruhat graph, indexed by a quantum analogue of Sottile's relation, whose coefficients are monomials in the quantum parameters times polynomials in the differences $y_i-z_j$ with nonnegative integer coefficients, and which is Graham-positive at $z=y$. At $y=z=0$ it is the quantum Pieri rule of Ciocan-Fontanine and Postnikov; at $z=y$ it is an equivariant quantum Pieri rule for the complete flag variety, indexed by chains in the quantum Bruhat graph rather than, as in the rule of Huang and Li, by the data of a reduction to classical cohomology, and proved directly. A doubled Pieri formula, positive in the same senses, treats multiplication by the quantization of a product of two elementary polynomials in the same variables, which is not the product of the quantizations: it is two iterated Pieri steps with the incompatible pairs of chains omitted. More generally, the triple quantum Schubert structure constants $c_{u,v}^{w,d}(y;z)$, the coefficients of $\widetilde{\mathfrak{S}}_u(x;y)\widetilde{\mathfrak{S}}_v(x;z)$ in the basis $\{\widetilde{\mathfrak{S}}_w(x;y)\}$, are polynomials in the $y_i-z_j$ with nonnegative integer coefficients; the proof of this appears as an appendix. We extend the Peterson-Woodward comparison formula and the quantum-to-classical reduction of Leung-Li and Huang-Li to the triple constants, and we describe and prove correct the algorithms of schubmult, which compute products of arbitrary quantum double Schubert polynomials well beyond the reach of previous methods.

math.CO↗

A Littlewood-Richardson Rule for Forest Polynomials

The forest polynomials $\mathfrak{P}_a$ of Nadeau-Tewari form a $\mathbb{Z}$-basis of $\mathbb{Z}[x_1,x_2,\ldots]$ whose role for the cohomology of the quasisymmetric flag variety parallels that of Schubert polynomials for the classical flag variety. Nonnegativity of the structure constants $β_{a,b}^c$ in $\mathfrak{P}_a \mathfrak{P}_b = \sum_c β_{a,b}^c \mathfrak{P}_c$ is known, but no Littlewood-Richardson-style enumerative rule has been available. We give such a rule: $β_{a,b}^c$ counts pairs of forest RC graphs of forest-codes $a$ and $b$ whose lift product lands on a forest RC graph of forest-code and weight both equal to $c$. The same rule descends to the cup product on $H^\bullet(\mathrm{QFl}_n)$. The proof introduces a squash product $\boxtimes$ on RC graphs, which on full Grassmannian RC graphs of a fixed height recovers the plactic monoid, a multiplactic algebra $\mathcal{M}_n$ that models Schubert polynomial multiplication, and a lift product $*$ on RC graphs whose quasi-crystal structure, in the framework of Cain-Guilherme-Malheiro, transports the Nadeau-Tewari forest equivalence through the computation. The row-decomposition machinery on RC graphs that underlies these constructions is developed in a companion paper.

math.CO↗

The Schubert bialgebra

We introduce a Schubert bialgebra $\mathcal{A}=\bigoplus_{n\geq 0}\mathbb{Z}[x_1,\ldots,x_n]$, in which polynomials in different numbers of variables multiply to zero and the coproduct splits the variables into two consecutive blocks, and study its graded dual $\mathcal{D}$, whose product is concatenation of weak compositions. The Schubert polynomials $\mathfrak{S}_u^n$ form a basis of $\mathcal{A}$; we give an explicit formula for the dual Schubert basis $Ξ_u^n$ of $\mathcal{D}$ via a transition formula to an elementary symmetric basis, and show that the Schubert structure constants $c_{u,v}^w$ are the coefficients of the coproduct of $\mathcal{D}$ in the dual Schubert basis. The product of $\mathcal{D}$ is then lifted to an associative product $\sqcup$ on the free abelian group $\mathcal{BRC}$ of bounded RC graphs, built from a transition map $\mathcal{Z}$ on RC graphs that realizes the Lascoux-Schützenberger transition formula and generalizes Little's bumping algorithm. Quotienting $\mathcal{BRC}$ by ideals coming from Demazure crystal equivalence, Nadeau-Tewari forest equivalence, and quasi-Yamanouchi equivalence yields manifestly positive Littlewood-Richardson rules for the dual Schubert, dual key, dual forest, and dual slide bases of $\mathcal{D}$. Read on $\mathcal{A}$, these are branching rules: enumerative formulas for splitting a Schubert, key, forest, or slide polynomial across two blocks of variables, and in the Schubert case they compute the Levi branching coefficients of Ressayre-Richmond for $\mathrm{GL}_p\times\mathrm{GL}_q\hookrightarrow\mathrm{GL}_{p+q}$.

math.CO↗

A Molev-Sagan type formula for double Schubert polynomials

We give a Molev-Sagan type formula for computing the product $\mathfrak{S}_u(x;y)\mathfrak{S}_v(x;z)$ of two double Schubert polynomials in different sets of coefficient variables where the descents of $u$ and $v$ satisfy certain conditions that encompass Molev and Sagan's original case and conjecture positivity in the general case. Additionally, we provide a Pieri formula for multiplying an arbitrary double Schubert polynomial $\mathfrak{S}_u(x;y)$ by a factorial elementary symmetric polynomial $E_{p,k}(x;z)$. Both formulas remain positive in terms of the negative roots when we set $y=z$, so in particular this gives a new equivariant Littlewood-Richardson rule for the Grassmannian, and more generally a positive formula for multiplying a factorial Schur polynomial $s_λ(x_1,\ldots,x_m;y)$ by a double Schubert polynomial $\mathfrak{S}_v(x_1,\ldots,x_p;y)$ such that $m\geq p$. An additional new result we present is a combinatorial proof of a conjecture of Kirillov of nonnegativity of the coefficients of skew Schubert polynomials, and we conjecture a weight-preserving bijection between a modification of certain diagrams used in our formulas and RC-graphs/pipe dreams arising in formulas for double Schubert polynomials.

math.CO↗

K-theory of minuscule varieties

Based on Thomas and Yong's K-theoretic jeu de taquin algorithm, we prove a uniform Littlewood-Richardson rule for the K-theoretic Schubert structure constants of all minuscule homogeneous spaces. Our formula is new in all types. For the main examples of Grassmannians of type A and maximal orthogonal Grassmannians it has the advantage that the tableaux to be counted can be recognized without reference to the jeu de taquin algorithm.

math.AG↗

Word posets, with applications to Coxeter groups

We discuss the theory of certain partially ordered sets that capture the structure of commutation classes of words in monoids. As a first application, it follows readily that counting words in commutation classes is #P-complete. We then apply the partially ordered sets to Coxeter groups. Some results are a proof that enumerating the reduced words of elements of Coxeter groups is #P-complete, a recursive formula for computing the number of commutation classes of reduced words, as well as stronger bounds on the maximum number of commutation classes than were previously known. This also allows us to improve the known bounds on the number of primitive sorting networks.

cs.DM↗

Word posets, complexity, and Coxeter groups

A monoid $M$ generated by a set $S$ of symbols can be described as the set of equivalence classes of finite words in $S$ under some relations that specify when some contiguous sequence of symbols can be replaced by another. If $a,b\in S$, a relation of the form $ab=ba$ is said to be a \emph{commutation relation}. Words that are equivalent using only a sequence of commutation relations are said to be in the same \emph{commutation class}. We introduce certain partially ordered sets that we call \emph{word posets} that capture the structure of commutation classes in monoids. The isomorphism classes of word posets are seen to be in bijective correspondence with the commutation classes, and we show that the linear extensions of the word poset correspond bijectively to the words in the commutation class, using which we demonstrate that enumerating the words in commutation classes of monoids is #P-complete. We then apply the word posets to Coxeter groups. We show that the problem of enumerating the reduced words of elements of Coxeter groups is #P-complete. We also demonstrate a method for finding the word posets for commutation classes of reduced words of an element, then use this to find a recursive formula for the number of commutation classes of reduced words.

math.CO↗