Search arXivSearch

arXiv · 0810.1348

Double Schubert polynomials for the classical groups

Abstract

For each infinite series of the classical Lie groups of type B,C or D, we introduce a family of polynomials parametrized by the elements of the corresponding Weyl group of infinite rank. These polynomials represent the Schubert classes in the equivariant cohomology of the appropriate flag variety. They satisfy a stability property, and are a natural extension of the (single) Schubert polynomials of Billey and Haiman, which represent non-equivariant Schubert classes. They are also positive in a certain sense, and when indexed by maximal Grassmannian elements, or by the longest element in a finite Weyl group, these polynomials can be expressed in terms of the factorial analogues of Schur's Q- or P-functions defined earlier by Ivanov.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Takeshi Ikeda, Leonardo C. Mihalcea, Hiroshi Naruse. 2008-10-09. Double Schubert polynomials for the classical groups. https://doi.org/10.1016/j.aim.2010.07.008

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