Bounded core partitions and Borel-Weil-Bott

Fern Gossow; Andrew Huchala

Home/Archive/arXiv

arXiv · 2510.17239

Bounded core partitions and Borel-Weil-Bott

Fern Gossow·Andrew Huchala

View original source ↗Read source document ↗Export metadata ↓

Abstract

The Borel-Weil-Bott theorem can be used to decompose the cohomology of twisted sheaves of holomorphic forms on the complex Grassmannian into irreducible representations of the general linear group. By analyzing this decomposition, we provide two effective formulae for computing the associated Hodge numbers, and give examples in special cases. One of these involves a novel integer-valued hook-product statistic on bounded partitions, and the other is based on semistandard tableaux. We reformulate Snow's observation that the positivity of the Hodge numbers is equivalent to the existence of a partition satisfying certain properties, and improve known bounds on when this occurs. This involves a combinatorial proof of the Nakano vanishing theorem for the Grassmannian utilizing a map from core partitions to plane partitions. Finally, we extend our computation of the Hodge numbers of twisted holomorphic forms on the Grassmannian to a q-analogue.

Explore related subjects

math.CO math.AG

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Fern Gossow, Andrew Huchala. 2026-05-08. Bounded core partitions and Borel-Weil-Bott. https://arxiv.org/abs/2510.17239

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

Enumeration of regular multipartite hypergraphs

We determine the asymptotic number of regular multipartite hypergraphs, also known as multidimensional binary contingency tables, for all values of the parameters.

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↗