English
Related papers

Related papers: Toward Butler's conjecture

200 papers

For closed $k$-Schur Katalan functions $\fg{\lambda}{k}$ with $k$ a positive integer and $\lambda$ a $k$-bounded partition, Blasiak, Morse and Seelinger proposed the alternating dual Pieri rule conjecture and the $k$-branching conjecture.…

Combinatorics · Mathematics 2025-01-09 Yaozhou Fang , Xing Gao

A partition of degree $n$ is a decomposition $n=i_1+i_2+\dots+i_q$, where ${i_1,i_2,\dots,i_q}$ are positive integers called the parts of the partition. Let $\lambda>0$ be an integer. The partition is said to be a $\lambda$--partition if…

Combinatorics · Mathematics 2017-03-22 F. V. Weinstein

We give a combinatorial proof of the factorization formula of modified Macdonald polynomials when the parameter t is specialized at a primitive root of unity. Our proof is restricted to the special case of partitions with 2 columns. We…

Combinatorics · Mathematics 2008-03-18 Francois Descouens , Hideaki Morita , Yasuhide Numata

The purpose of this note is to introduce a new family of quasi-symmetric functions called LLT cumulants and discuss its properties. We define LLT cumulants using the algebraic framework for conditional cumulants and we prove that the…

Combinatorics · Mathematics 2022-10-07 Maciej Dołęga , Maciej Kowalski

We prove a conjecture of Haglund which can be seen as an extension of the equidistribution of the inversion number and the major index over permutations to ordered set partitions. Haglund's conjecture implicitly defines two statistics on…

Combinatorics · Mathematics 2014-09-04 Jeffrey B. Remmel , Andrew Timothy Wilson

In this paper, we give a conjecture, which generalises Euler's partition theorem involving odd parts and different parts for all moduli. We prove this conjecture for two family partitions. We give $q$-difference equations for the related…

Combinatorics · Mathematics 2020-05-19 Xinhua Xiong , William J. Keith

We prove a combinatorial formula for Macdonald cumulants which generalizes the celebrated formula of Haglund for Macdonald polynomials. We provide several applications of our formula. Firstly, it gives a new, constructive proof of a strong…

Combinatorics · Mathematics 2018-09-28 Maciej Dołęga

Let $r \geq 0$, and let $\lambda$ and $\mu$ be partitions such that $\lambda_1 \leq r + 1$. We present a combinatorial interpretation of the plethysm coefficient $\langle s_\lambda, s_\mu[s_r] \rangle$. As a consequence, we solve the…

Combinatorics · Mathematics 2025-08-28 Mitchell Lee

We study a linear map on symmetric functions that ``divides'' a partition by a positive integer $k$, sending a Schur function indexed by a partition of $kn$ to a symmetric function indexed by partitions of $n$. We determine its Schur…

Combinatorics · Mathematics 2026-05-22 Per Alexandersson , Lilan Dai

A Latin tableau of shape $\lambda$ and type $\mu$ is a Young diagram of shape $\lambda$ in which each box contains a single positive integer, with no repeated integers in any row or column, and the $i$th most common integer appearing…

Combinatorics · Mathematics 2024-08-09 Timothy Y. Chow , Mark G. Tiefenbruck

Let $\mathcal{B}(n)$ denote the collection of all set partitions of $[n]$. Suppose $\mathcal{A} \subseteq \mathcal{B}(n)$ is a non-trivial $t$-intersecting family of set partitions i.e. any two members of $\A$ have at least $t$ blocks in…

Combinatorics · Mathematics 2011-09-05 Cheng Yeaw Ku , Kok Bin Wong

For positive integers $s$ and $L \geq 3$, Berkovich and Uncu (Ann. Comb. $23$ ($2019$) $263$--$284$) conjectured an inequality between the sizes of two closely related sets of partitions whose parts lie in the interval $\{s, \ldots, L+s\}$.…

Combinatorics · Mathematics 2021-08-16 Damanvir Singh Binner , Amarpreet Rattan

We initiate the study of the Macdonald intersection polynomials $\operatorname{I}_{\mu^{(1)},\dots,\mu^{(k)}}[X;q,t]$, which are indexed by $k$-tuples of partitions $\mu^{(1)},\dots,\mu^{(k)}$. These polynomials are conjectured to be equal…

Combinatorics · Mathematics 2025-09-03 Donghyun Kim , Seung Jin Lee , Jaeseong Oh

We make a systematic study of a new combinatorial construction called a dual equivalence graph. We axiomatize these graphs and prove that their generating functions are symmetric and Schur positive. By constructing a graph on ribbon…

Combinatorics · Mathematics 2013-10-24 Sami H. Assaf

This work studies the remarkable relationships that hold among certain m-tuples of the Garsia-Haiman modules $ {\bf M}_\mu$ and corresponding elements of the Macdonald basis. We recall that ${\bf M}_\mu$ is defined for a partition $\mu\part…

Combinatorics · Mathematics 2007-05-23 F. Bergeron , G. Garsia

In this paper we extend the bump conjecture and a particular case of the separated bump conjecture with logarithmic bumps to iterated commutators $T_b^m$. Our results are new even for the first order commutator $T_b^1$. A new bump type…

Classical Analysis and ODEs · Mathematics 2020-06-23 Andrei K. Lerner , Sheldy Ombrosi , Israel P. Rivera-Ríos

Macdonald defined two-parameter Kostka functions K_{\lambda\mu}(q,t) where \lambda, \mu are partitions. The main purpose of this paper is to extend his definition to include all compositions as indices. Following Macdonald, we conjecture…

Quantum Algebra · Mathematics 2014-12-31 Friedrich Knop

We give an explicit raising operator formula for the modified Macdonald polynomials $\tilde{H}_{\mu }(X;q,t)$, which follows from our recent formula for $\nabla$ on an LLT polynomial and the Haglund-Haiman-Loehr formula expressing modified…

Combinatorics · Mathematics 2023-07-14 Jonah Blasiak , Mark Haiman , Jennifer Morse , Anna Pun , George Seelinger

We make progress towards understanding the structure of Littlewood-Richardson coefficients $g_{\lambda,\mu}^{\nu}$ for products of Jack symmetric functions. Building on recent results of the second author, we are able to prove new cases of…

Combinatorics · Mathematics 2023-09-29 Per Alexandersson , Ryan Mickler

Let $M$ be a positive integer and $p(n)$ be the number of partitions of a positive integer $n$. Newman's Conjecture asserts that for each integer $r$, there are infinitely many positive integers $n$ such that \[ p(n)\equiv r \pmod{M}. \]…

Number Theory · Mathematics 2025-05-30 Dohoon Choi , Youngmin Lee