English
Related papers

Related papers: A simplified Kronecker rule for one hook shape

200 papers

Kostka functions $K^{\pm}_{\lambda, \mu}(t)$ associated to complex reflection groups are a generalization of Kostka polynomials, which are indexed by a pair $\lambda, \mu$ of $r$-partitions and a sign $+, -$. It is expected that there…

Representation Theory · Mathematics 2015-09-25 Toshiaki Shoji

We give a combinatorial proof of the skew Kostka analogue of the K-saturation theorem. More precisely, for any positive integer k, we give an explicit injection from the set of skew semistandard Young tableaux with skew shape…

Combinatorics · Mathematics 2018-11-13 Per Alexandersson

Petrie symmetric functions $G(k,n)$, also known as truncated homogeneous symmetric functions or modular complete symmetric functions, form a class of symmetric functions interpolating between the elementary symmetric functions $e_n$ and the…

Combinatorics · Mathematics 2026-05-29 Saintan Wu , Sen-Peng Eu , Kuo-Han Ku , Yu-Sheng Shih

We present a conjectual hook formula concerning the number of the standard tableaux on "cylindric" skew diagrams. Our formula can be seen as an extension of Naruse's hook formula for skew diagrams. Moreover, we prove our conjecture in some…

Combinatorics · Mathematics 2021-06-18 Takeshi Suzuki , Yoshitaka Toyosawa

Using the expansion of the inverse of the Kostka matrix in terms of tabloids as presented by Egecioglu and Remmel, we show that the fusion coefficients can be expressed as an alternating sum over cylindric tableaux. Cylindric tableaux are…

Combinatorics · Mathematics 2012-09-06 Jennifer Morse , Anne Schilling

We study the class $\mathcal C$ of symmetric functions whose coefficients in the Schur basis can be described by generating functions for sets of tableaux with fixed shape. Included in this class are the Hall-Littlewood polynomials,…

Combinatorics · Mathematics 2011-06-09 Jason Bandlow , Jennifer Morse

Let $G$ be a simple graph and let $\mathcal{L}(G)$ be the free partially commutative Lie algebra associated to $G$. In this paper, using heaps of pieces, we prove an expression for the generalized $\textbf k$-chromatic polynomial of $G$ in…

Combinatorics · Mathematics 2019-07-23 G Arunkumar

In the context of orientable circuits and subcomplexes of these as representing certain singular spaces, we consider characteristic class formulas generalizing those classical results as seen for the Riemann-Hurwitz formula for regulating…

Algebraic Topology · Mathematics 2017-08-25 James F. Glazebrook , Alberto Verjovsky

We present a conjecture generalizing the Cauchy formula for Macdonald polynomials. This conjecture encodes the mixed Hodge polynomials of the character varieties of representations of the fundamental group of a Riemann surface of genus g to…

Representation Theory · Mathematics 2019-12-19 T. Hausel , E. Letellier , F. Rodriguez-Villegas

We show that the homotopy category of a combinatorial stable model category $\ck$ is well generated. It means that each object $K$ of $\Ho(\ck)$ is an iterated weak colimit of $\lambda$-compact objects for some cardinal $\lambda$. A natural…

Category Theory · Mathematics 2009-12-03 J. Rosicky

For a skew shape $\lambda/\mu$, we define the hybrid Grothendieck polynomial $${G}_{\lambda/\mu}(\textbf{x};\textbf{t};\textbf{w}) =\sum_{T\in \mathrm{SVRPP}(\lambda/\mu)} \textbf{x}^{\mathrm{ircont}(T)}\textbf{t}^{\mathrm{ceq}…

Combinatorics · Mathematics 2025-05-27 Peter L. Guo , Mingyang Kang , Jiaji Liu

Combinatorics, in particular graph theory, has a rich history of being a domain of successful applications of tools from other areas of mathematics, including topological methods. Here, we survey the study of the Hom-complexes, and the ways…

Algebraic Topology · Mathematics 2007-05-23 Dmitry N. Kozlov

Given a graph G (or more generally a matroid embedded in a projective space), we construct a sequence of varieties whose geometry encodes combinatorial information about G. For example, the chromatic polynomial of G (giving at each m>0 the…

alg-geom · Mathematics 2012-04-10 Paolo Aluffi

We address a unification of the Schubert calculus problems solved by [A. Buch '02] and [A. Knutson-T. Tao '03]. That is, we prove a combinatorial rule for the structure coefficients in the torus-equivariant K-theory of Grassmannians with…

Combinatorics · Mathematics 2017-07-11 Oliver Pechenik , Alexander Yong

The lattice Coulomb-gauge hamiltonian is derived from the transfer matrix of Wilson's Euclidean lattice gauge theory, wherein the lattice form of Gauss's law is satisfied identically. The restriction to a fundamental modular region (no…

High Energy Physics - Theory · Physics 2009-10-30 Daniel Zwanziger

The classical hook length formula of enumerative combinatorics expresses the number of standard Young tableaux of a given partition shape as a single fraction. In recent years, two generalizations of this formula have emerged: one by Pak…

Combinatorics · Mathematics 2023-10-30 Darij Grinberg , Nazar Korniichuk , Kostiantyn Molokanov , Severyn Khomych

Refined canonical stable Grothendieck polynomials were introduced by Hwang, Jang, Kim, Song, and Song. There exist two combinatorial models for these polynomials: one using hook-valued tableaux and the other using pairs of a semistandard…

Combinatorics · Mathematics 2026-01-08 Jihyeug Jang , Jang Soo Kim , Jianping Pan , Joseph Pappe , Anne Schilling

We provide simple necessary and sufficient conditions for the existence of a standard Young tableau of a given shape and major index $r$ mod $n$, for all $r$. Our result generalizes the $r=1$ case due essentially to (1974) and proves a…

Combinatorics · Mathematics 2017-09-21 Joshua P. Swanson

We give formulae for computing Kronecker coefficients occurring in the expansion of $s_{\mu}*s_{\nu}$, where both $\mu$ and $\nu$ are nearly rectangular, and have smallest parts equal to either 1 or 2. In particular, we study…

Combinatorics · Mathematics 2014-03-24 Vasu V. Tewari

Young tableaux are ubiquitous in various branches of mathematics. There are two counting formulas for standard Young tableaux. The first involves a determinant and goes back to Frobenius and Young, and the second is the hook formula by…

Combinatorics · Mathematics 2007-05-23 Mathias Lederer