We prove a compositional refinement of the Delta conjecture (rise version) of Haglund, Remmel and Wilson (2018) for $Δ_{e_{n-k-1}}'e_n$ which was stated by D'Adderio, Iraci and Vanden Wyngaerd (2020) in terms of Theta operators.
In The Delta Conjecture (arxiv:1509.07058), Haglund, Remmel and Wilson introduced a four variable $q,t,z,w$ Catalan polynomial, so named because the specialization of this polynomial at the values $(q,t,z,w) = (1,1,0,0)$ is equal to the Catalan number $\frac{1}{n+1}\binom{2n}{n}$. We prove the compositional version of this conjecture (which implies the non-compositional version) that states that the coefficient of $s_{r,1^{n-r}}$ in the expression $Δ_{h_\ell} \nabla C_α$ is equal to a weighted sum over decorated Dyck paths.
In 2008, Haglund, Morse and Zabrocki formulated a Compositional form of the Shuffle Conjecture of Haglund et al. In very recent work, Gorsky and Negut by combining their discoveries with the work of Schiffmann-Vasserot on the symmetric function side and the work of Hikita and Gorsky-Mazin on the combinatorial side, were led to formulate an infinite family of conjectures that extend the original Shuffle Conjecture of Haglund et al. In fact, they formulated one conjecture for each pair (m,n) of coprime integers. This work of Gorsky-Negut leads naturally to the question as to where the Compositio…
We define a module that is an extension of the diagonal harmonics and whose graded Frobenius characteristic is conjectured to be the symmetric function expression which appears in `the Delta conjecture' of Haglund, Remmel and Wilson [arXiv:1509.07058].
Inspired by [Qiu, Wilson 2019] and [D'Adderio, Iraci, Vanden Wyngaerd 2019 - Delta Square], we formulate a generalised Delta square conjecture (valley version). Furthermore, we use similar techniques as in [Haglund, Sergel 2019] to obtain a schedule formula for the combinatorics of our conjecture. We then use this formula to prove that the (generalised) valley version of the Delta conjecture implies our (generalised) valley version of the Delta square conjecture. This implication broadens the argument in [Sergel 2016], relying on the formulation of the touching version in terms of the $Θ_f$ op…
We prove the cases q=0 and t=0 of the generalized Delta conjecture of Haglund, Remmel and Wilson involving the symmetric function $Δ_{h_m}Δ_{e_{n-k-1}}'e_n$. Our theorem generalizes recent results by Garsia, Haglund, Remmel and Yoo. This proves also the case q=0 of our recent generalized Delta square conjecture.
The Delta Conjecture of Haglund, Remmel, and Wilson is a recent generalization of the Shuffle Conjecture in the field of diagonal harmonics. In this paper we give evidence for the Delta Conjecture by proving a pair of conjectures of Wilson and Haglund-Remmel-Wilson which give equidistribution results for statistics related to inversion count and major index on objects related to ordered set partitions. Our results generalize the famous result of MacMahon that major index and inversion number share the same distribution on permutations.
In this paper we define two infinite families of graphs called C-$δ$ graphs and $δ$- graph and prove that $δ$-graphs satisfy $δ$ conjecture. Also we introduce a family of C-$δ$ graphs from which we can identify $δ$ graphs as their complements. Finally we give a list of C-$δ$ graphs and the relationship with their minimum semidefinite rank.
In [Haglund, Remmel, Wilson 2018] the authors state two versions of the so called Delta conjecture, the rise version and the valley version. Of the former, they also give a more general statement in which zero labels are also allowed. In [Qiu, Wilson 2020], the corresponding generalisation of the valley version is also formulated. In [D'Adderio, Iraci, Vanden Wyngaerd 2020], the authors use a pushing algorithm to prove the generalised version of the shuffle theorem. An extension of that argument is used in [Iraci, Vanden Wyngaerd 2020] to formulate a valley version of the (generalised) Delta s…
We use a weight-preserving, sign-reversing involution to find a combinatorial expansion of $Δ_{e_k} e_n$ at $q=1$ in terms of the elementary symmetric function basis. We then use a weight-preserving bijection to prove the Delta Conjecture at $q=1$. The method of proof provides a variety of structures which can compute the inner product of $Δ_{e_k} e_n|_{q=1}$ with any symmetric function.
By finding orthogonal representation for a family of simple connected called $δ$-graphs it is possible to show that $δ$-graphs satisfy delta conjecture. An extension of the argument to graphs of the form $\overline{P_{Δ(G)+2}\sqcup G}$ where $P_{Δ(G)+2}$ is a path and $G$ is a simple connected graph it is possible to find an orthogonal representation of $\overline{P_{Δ(G)+2}\sqcup G}$ in $\mathbb{R}^{Δ(G)+1}$. As a consequence we prove delta conjecture.
Our main result here is that the specialization at $t=1/q$ of the $Q_{km,kn}$ operators studied in [4] may be given a very simple plethystic form. This discovery yields elementary and direct derivations of several identities relating these operators at $t=1/q$ to the Rational Compositional Shuffle conjecture of [3]. In particular we show that if $m,n $ and $k$ are positive integers and $(m,n)$ is a coprime pair then $$ q^{(km-1)(kn-1)+k-1\over 2} Q_{km,kn}(-1)^{kn}\Big|_{t=1/q} \,=\, \textstyle{[k]_q\over [km]_q} e_{km}\big[ X[km]_q\big] $$ where as customarily, for any integer $s \geq 0$ and …
We conjecture a formula for the symmetric function $\frac{[n-k]_t}{[n]_t}Δ_{h_m}Δ_{e_{n-k}}ω(p_n)$ in terms of decorated partially labelled square paths. This can be seen as a generalization of the square conjecture of Loehr and Warrington (Loehr, Warrington 2007), recently proved by Sergel (Sergel 2017) after the breakthrough of Carlsson and Mellit (Carlsson, Mellit 2018). Moreover, it extends to the square case the combinatorics of the generalized Delta conjecture of Haglund, Remmel and Wilson (Haglund, Remmel, Wilson 2015), answering one of their questions. We support our conjecture by prov…
In [The Delta Conjecture, Trans. Amer. Math. Soc., to appear] Haglund, Remmel, Wilson introduce a conjecture which gives a combinatorial prediction for the result of applying a certain operator to an elementary symmetric function. This operator, defined in terms of its action on the modified Macdonald basis, has played a role in work of Garsia and Haiman on diagonal harmonics, the Hilbert scheme, and Macdonald polynomials [A. M. Garsia and M. Haiman. A remarkable $q,t$-Catalan sequence and $q$-Lagrange inversion, J. Algebraic Combin. 5 (1996), 191--244], [M. Haiman, Vanishing theorems and char…
We give bounds on the L(2,1)-labeling number of a simple graph in terms of its order and its maximum degree. We also describe an infinite class of graphs of which the elements have the highest L(2,1)-labeling numbers in terms of their maximum degrees of any known infinite class of graphs.
We introduce the family of Theta operators $Θ_f$ indexed by symmetric functions $f$ that allow us to conjecture a compositional refinement of the Delta conjecture of Haglund, Remmel and Wilson for $Δ_{e_{n-k-1}}'e_n$. We show that the $4$-variable Catalan theorem of Zabrocki is precisely the Schröder case of our compositional Delta conjecture, and we show how to relate this conjecture to the Dyck path algebra introduced by Carlsson and Mellit, extending one of their results. Again using the Theta operators, we conjecture a touching refinement of the generalized Delta conjecture for $Δ_{h_m}Δ_{…
We conjecture two combinatorial interpretations for the symmetric function $Δ_{e_k} e_n$, where $Δ_f$ is an eigenoperator for the modified Macdonald polynomials defined by Bergeron, Garsia, Haiman, and Tesler. Both interpretations can be seen as generalizations of the Shuffle Conjecture of Haglund, Haiman, Remmel, Loehr, and Ulyanov, which was proved recently by Carlsson and Mellit. We show how previous work of the third author on Tesler matrices and ordered set partitions can be used to verify several cases of our conjectures. Furthermore, we use a reciprocity identity and LLT polynomials to …
We prove the Schröder case, i.e. the case $\langle \cdot,e_{n-d}h_d \rangle$, of the conjecture of Haglund, Remmel and Wilson (Haglund et al. 2018) for $Δ_{h_m}Δ_{e_{n-k-1}}'e_n$ in terms of decorated partially labelled Dyck paths, which we call \emph{generalized Delta conjecture}. This result extends the Schröder case of the Delta conjecture proved in (D'Adderio, Vanden Wyngaerd 2017), which in turn generalized the $q,t$-Schröder of Haglund (Haglund 2004). The proof gives a recursion for these polynomials that extends the ones known for the aforementioned special cases. Also, we give another …
We discuss the combinatorics of the decorated Dyck paths appearing in the Delta conjecture framework of Haglund, Remmel and Wilson (2015) and Zabrocki (2016), by introducing two new statistics, bounce and bounce'. We then provide plethystic formulae for their q,t-enumerators, by proving in this way a decorated version of Haglund's q,t-Schroeder theorem, answering a question in Haglund, Remmel and Wilson (2015). In particular we provide both an algebraic and a combinatorial explanation of a symmetry conjectured in Haglund, Remmel and Wilson (2015) and Zabrocki (2016). Finally, we show a link be…
Recently, Gross, Mansour and Tucker introduced the partial duality polynomial of a ribbon graph and posed a conjecture that there is no orientable ribbon graph whose partial duality polynomial has only one non-constant term. We found an infinite family of counterexamples for the conjecture and showed that essentially these are the only counterexamples. This is also obtained independently by Chumutov and Vignes-Tourneret and they posed a problem: it would be interesting to know whether the partial duality polynomial and the related conjectures would make sence for general delta-matroids. In thi…
In \cite{HRW15}, Haglund, Remmel, Wilson state a conjecture which predicts a purely combinatorial way of obtaining the symmetric function $Δ_{e_k}e_n$. It is called the Delta Conjecture. It was recently proved in \cite{GHRY} that the Delta Conjecture is true when either $q=0$ or $t=0$. In this paper we complete a work initiated by Remmel whose initial aim was to explore the symmetric function $Δ_{s_ν} e_n$ by the same methods developed in \cite{GHRY}. Our first need here is a method for constructing a symmetric function that may be viewed as a "combinatorial side" for the symmetric function $Δ…
We discuss the combinatorics of decorated Dyck paths and decorated parallelogram polyominoes, extending to the decorated case the main results of both [Haglund 2004] and [Aval et al. 2014]. This settles in particular the cases $\langle\cdot,e_{n-d}h_d\rangle$ and $\langle\cdot,h_{n-d}h_d\rangle$ of the Delta conjecture of Haglund, Remmel and Wilson (2018). Along the way, we introduce some new statistics, formulate some new conjectures, prove some new identities of symmetric functions, and answer a few open problems in the literature (e.g. from [Haglund et al. 2018], [Zabrocki 2016], [Aval et a…
We introduce area, bounce and dinv statistics on decorated parallelogram polyominoes, and prove that some of their q,t-enumerators match $\langle Δ_{h_m} e_{n+1}, s_{k+1,1^{n-k}} \rangle$, extending in this way the work in (Aval et al. 2014). Also, we provide a bijective connection between decorated parallelogram polyominoes and decorated labelled Dyck paths, which allows us to prove the combinatorial interpretation of the coefficient $\langleΔ_{e_{m+n-k-1}}'e_{m+n}, h_m h_n \rangle$ predicted by the Delta conjecture in (Haglund et al. 2015). Finally, we define a statistic pmaj on partially la…
We introduce area, bounce and dinv statistics on decorated parallelogram polyominoes, and prove that some of their q,t-enumerators match $\langle Δ_{h_m} e_{n+1},s_{k+1,1^{n-k}}\rangle$, extending in this way the work in (Aval et al. 2014). Also, we provide a bijective connection between decorated parallelogram polyominoes and decorated labelled Dyck paths, which allows us to prove the combinatorial interpretation of the coefficient $\langle Δ_{e_{m+n-k-1}}'e_{m+n},h_m h_n\rangle$ predicted by the Delta conjecture in (Haglund et al. 2015). Finally, we define a statistic pmaj on partially label…
We introduce a $q,t$-enumeration of Dyck paths which are forced to touch the main diagonal at specific points and forbidden to touch elsewhere and conjecture that it describes the action of the Macdonald theory $\nabla$ operator applied to a Hall-Littlewood polynomial. Our conjecture refines several earlier conjectures concerning the space of diagonal harmonics including the "shuffle conjecture" (Duke J. Math. $\mathbf {126}$ (2005), pp. 195-232) for $\nabla e_n[X]$. We bring to light that certain generalized Hall-Littlewood polynomials indexed by compositions are the building blocks for the a…
In a recent preprint, Carlsson and Oblomkov (2018) obtain a long sought after monomial basis for the ring $\operatorname{DR}_n$ of diagonal coinvariants. Their basis is closely related to the "schedules" formula for the Hilbert series of $\operatorname{DR}_n$ which was conjectured by the first author and Loehr (2005) and first proved by Carlsson and Mellit (2018), as a consequence of their proof of the famous Shuffle Conjecture. In this article we obtain a schedules formula for the combinatorial side of the Delta Conjecture, a conjecture introduced by the first author, Remmel and Wilson (2018)…
We prove here that the polynomial <nabla(C_p(1)), e_a h_b h_c> q, t-enumerates, by the statistics dinv and area, the parking functions whose supporting Dyck path touches the main diagonal according to the composition p of size a + b + c and have a reading word which is a shuffle of one decreasing word and two increasing words of respective sizes a, b, c. Here Cp(1) is a rescaled Hall-Littlewood polynomial and "nabla" is the Macdonald eigenoperator introduced in [1]. This is our latest progress in a continued effort to settle the decade old shuffle conjecture of [14]. It includes as special cas…
In the early 2000's the first and second named authors worked for a period of six years in an attempt of proving the Compositional Shuffle Conjecture [1]. Their approach was based on the discovery that all the Combinatorial properties predicted by the Compositional Shuffle Conjecture remain valid for each family of Parking Functions with prescribed diagonal cars. The validity of this property was reduced to the proof of a functional equation satisfied by a Catalan family of univariate polynomials. The main result in this paper is a proof of this functional equation. The Compositional Shuffle C…
The symmetric group $\mathfrak{S}_n$ acts on the polynomial ring $\mathbb{Q}[\mathbf{x}_n] = \mathbb{Q}[x_1, \dots, x_n]$ by variable permutation. The invariant ideal $I_n$ is the ideal generated by all $\mathfrak{S}_n$-invariant polynomials with vanishing constant term. The quotient $R_n = \frac{\mathbb{Q}[\mathbf{x}_n]}{I_n}$ is called the coinvariant algebra. The coinvariant algebra $R_n$ has received a great deal of study in algebraic and geometric combinatorics. We introduce a generalization $I_{n,k} \subseteq \mathbb{Q}[\mathbf{x}_n]$ of the ideal $I_n$ indexed by two positive integers $…
The Delta Conjecture of Haglund, Remmel, and Wilson predicts the monomial expansion of the symmetric function $Δ'_{e_{k-1}} e_n$, where $k \leq n$ are positive integers and $Δ'_{e_{k-1}}$ is a Macdonald eigenoperator. When $k = n$, the specialization $Δ'_{e_{n-1}} e_n|_{t = 0}$ is the Frobenius image of the graded $S_n$-module afforded by the cohomology ring of the {\em flag variety} consisting of complete flags in $\mathbb{C}^n$. We define and study a variety $X_{n,k}$ which carries an action of $S_n$ whose cohomology ring $H^{\bullet}(X_{n,k})$ has Frobenius image given by $Δ'_{e_{k-1}} e_n|…
In the context of the (generalized) Delta Conjecture and its compositional form, D'Adderio, Iraci, and Wyngaerd recently stated a conjecture relating two symmetric function operators, $D_k$ and $Θ_k$. We prove this Theta Operator Conjecture, finding it as a consequence of the five-term relation of Mellit and Garsia. As a result, we find surprising ways of writing the $D_k$ operators.
According to the Göttsche conjecture (now a theorem), the degree N^{d, delta} of the Severi variety of plane curves of degree d with delta nodes is given by a polynomial in d, provided d is large enough. These "node polynomials" N_delta(d) were determined by Vainsencher and Kleiman-Piene for delta <= 6 and delta <= 8, respectively. Building on ideas of Fomin and Mikhalkin, we develop an explicit algorithm for computing all node polynomials, and use it to compute N_delta(d) for delta <= 14. Furthermore, we improve the threshold of polynomiality and verify Göttsche's conjecture on the optimal th…
We prove the Extended Delta Conjecture of Haglund, Remmel, and Wilson, a combinatorial formula for $Δ_{h_l}Δ' _{e_k} e_{n}$, where $Δ' _{e_k}$ and $Δ_{h_l}$ are Macdonald eigenoperators and $e_n$ is an elementary symmetric function. We actually prove a stronger identity of infinite series of $GL_m$ characters expressed in terms of LLT series. This is achieved through new results in the theory of the Schiffmann algebra and its action on the algebra of symmetric functions.
The distribution of certain Mahonian statistic (called $\mathrm{BAST}$) introduced by Babson and Steingrímsson over the set of permutations that avoid vincular pattern $1\underline{32}$, is shown bijectively to match the distribution of major index over the same set. This new layer of equidistribution is then applied to give alternative interpretations of two related $q$-Stirling numbers of the second kind, studied by Carlitz and Gould. Moreover, extensions to an Euler-Mahonian statistic over ordered set partitions, and to statistics over ordered multiset partitions present themselves naturall…
This is the fourth paper in a series. We prove a conjecture made independently by Boston et al and Shalev. The conjecture asserts that there is an absolute positive constant delta such that if G is a finite simple group acting transitively on a set of size n > 1, then the proportion of derangements in G is greater than delta. We show that with possibly finitely many exceptions, one can take delta = .016. Indeed, we prove much stronger results showing that for many actions, the proportion of derangements goes to 1 as n increases and prove similar results for families of permutation representati…
We prove Stanley's conjecture that, if delta_n is the staircase shape, then the skew Schur functions s_{delta_n / mu} are non-negative sums of Schur P-functions. We prove that the coefficients in this sum count certain fillings of shifted shapes. In particular, for the skew Schur function s_{delta_n / delta_{n-2}}, we discuss connections with Eulerian numbers and alternating permutations.
One deals with r-regular bipartite graphs with 2n vertices. In a previous paper Butera, Pernici, and the author have introduced a quantity d(i), a function of the number of i-matchings, and conjectured that as n goes to infinity the fraction of graphs that satisfy Delta^k d(i) for all k and i, approaches 1. Here Delta is the finite difference operator. This conjecture we called the 'graph positivity conjecture'. In this paper it is formally shown that for each i and k the probability that Delta^k d(i) goes to 1 with n going to infinity. We call this weaker result the 'weak graph positivity con…
One deals with r-regular bipartite graphs with 2n vertices. In a previous paper Butera, Pernici, and the author have introduced a quantity d(i), a function of the number of i-matchings, and conjectured that as n goes to infinity the fraction of graphs that satisfy Delta^k( d(i)) is non-negative, for all k and i, approaches 1. Here Delta is the finite difference operator. This conjecture we called the "graph positivity conjecture". "Weak graph positivity" is the conjecture that for each i and k the probability that Delta^k (d(i) is non-negative goes to 1 as n goes to infinity. Here we prove thi…
We present a proof of the compositional shuffle conjecture, which generalizes the famous shuffle conjecture for the character of the diagonal coinvariant algebra. We first formulate the combinatorial side of the conjecture in terms of certain operators on a graded vector space $V_*$ whose degree zero part is the ring of symmetric functions $Sym[X]$ over $\mathbb{Q}(q,t)$. We then extend these operators to an action of an algebra $\tildeÅ$ acting on this space, and interpret the right generalization of the $\nabla$ using an involution of the algebra which is antilinear with respect to the conju…
The $Δ$-Springer varieties are a generalization of Springer fibers introduced by Levinson, Woo, and the author that have connections to the Delta Conjecture from algebraic combinatorics. We prove a positive Hall-Littlewood expansion formula for the graded Frobenius characteristic of the cohomology ring of a $Δ$-Springer variety. We do this by interpreting the Frobenius characteristic in terms of counting points over a finite field $\mathbb{F}_q$ and partitioning the $Δ$-Springer variety into copies of Springer fibers crossed with affine spaces. As a special case, our proof method gives a geome…
We prove that, for any prime $p$ and positive integer $r$ with $p^r>2$, the number of multinomial coefficients such that $$ {k\choose k_1,k_2,\ldots,k_n}=p^r,\quad \text{and}\quad k_1+2k_2+\cdots+nk_n=n, $$ is given by $$ δ_{p^r,\,k}\left(\left\lfloor\frac{n-1}{p^r-1}\right\rfloor -δ_{0,\,n\bmod p^r} \right), $$ where $δ_{i,j}$ is the Kronecker delta and $\lfloor x\rfloor$ stands for the largest integer not exceeding $x$. This confirms a recent conjecture of Mircea Merca.