Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2008.07034

Tableau formulas for skew Schubert polynomials

Harry Tamvakis
View original source ↗Read source document ↗Export metadata ↓

Abstract

The skew Schubert polynomials are those which are indexed by skew elements of the Weyl group, in the sense of arXiv:0812.0639. We obtain tableau formulas for the double versions of these polynomials in all four classical Lie types, where the tableaux used are fillings of the associated skew Young diagram. These are the first such theorems for symplectic and orthogonal Schubert polynomials, even in the single case. We also deduce tableau formulas for double Schur, double theta, and double eta polynomials, in their specializations as double Grassmannian Schubert polynomials. The latter results generalize the tableau formulas for symmetric (and single) Schubert polynomials due to Littlewood (in type A) and the author (in types B, C, and D).

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Harry Tamvakis. 2024-01-26. Tableau formulas for skew Schubert polynomials. https://arxiv.org/abs/2008.07034

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↗