Searcharxiv⌕ Search

arXiv subjects

Michele D'Adderio

Publications and source records attributed to Michele D'Adderio.

At least 19 recordsLinked to original sources

Leaving the Hall: explicit formulas for Negut operators

Recent major breakthroughs in $q,t$-combinatorics include the introduction of the Dyck path algebra $\mathbb{A}_{q,t}$ by Carlsson and Mellit and of the Catalanimals by Blasiak et al., both of which led, among other things, to independent proofs of different extensions of the rational shuffle conjecture of Bergeron et al. The first main contribution of this paper is a simple, explicit formula inside the algebra $\mathbb{A}_{q,t}$ for the Negut operators, yielding a direct, elementary connection between the original operators of the rational shuffle conjecture and the corresponding Catalanimals. Our formula bypasses the elliptic Hall algebra, turning these operators into transparent, workable tools whose action we can compute exactly and efficiently on any symmetric function, not just constants. Our second main contribution consists of a series of explicit formulas relating the Negut operators to the Theta operators introduced by D'Adderio et al. To prove these formulas, we provide an extension of the aforementioned Theta operators to the entire algebra $\mathbb{A}_{q,t}$, allowing us to obtain a series of new combinatorial results. The algebraic computations underlying this extension have been formalized in Lean. To showcase the power of our results, we give a proof, also partially formalized in Lean, of the Theta conjecture of D'Adderio et al., first stated in 2019.

math.CO↗

A memorial tribute: Adriano Garsia (1928--2024)

Adriano Mario Garsia was born in Tunis on August 20, 1928, to a Tunisian-Italian family. He lived on a farm there until the end of World War II, then moved to Rome. After finishing high school, he was sent to the United States to live with relatives in Woyming and eventually made his way to California, becoming a student of Charles Loewner at Stanford in the early 1950s. Following his Ph.D., Adriano held positions at MIT, the University of Minnesota, and Caltech before joining the nascent mathematics department at the University of California, San Diego, in 1966 where he spent the remainder of his career. He passed away in San Diego on October 6, 2024, at the age of 96.

math.HO↗

A Loehr-Remmel bijection in the $n \times kn$ grid and sandpiles

We extend the $\mathsf{pmaj}$ statistic of Loehr and Remmel to labelled Dyck paths in the $n \times kn$ grid, and generalize their bijection sending the bistatistic $(\mathsf{dinv},\mathsf{area})$ to $(\mathsf{area}, \mathsf{pmaj})$, proving in this way a new combinatorial formula for $\nabla^k e_n$ ($k \geq 1$). At $k = 1$ we recover the original statistic and the original bijection. Moreover, we provide an explicit description of the recurrent configurations of the sandpile model on a family of graphs $G_{μ, ν}^{(k)}$, indexed by an integer $k \geq 1$ and two compositions $μ$ and $ν$: at $k = 1$ these are the clique-independent graphs of D'Adderio et al. Finally, we define a $\mathsf{delay}$ statistic on these configurations, and we show that, together with the usual level statistic, it can be used to provide a new combinatorial interpretation of the polynomials $\langle \nabla^k e_n,e_μh_ν\rangle$ from the $(n,kn)$-shuffle theorem. At $k = 1$ we recover the main results of D'Adderio et al.

math.CO↗

On a bijection of Loehr and Remmel

In this expository article we review a remarkable bijection $ϕ_n$ due to Loehr and Remmel from the set of parking functions of size n into itself, which sends the bistatistic (dinv, area) into the bistatistic (area, pmaj). The only novelty of the present work is our definition of $ϕ_n$, which is more direct than the original one, hence easier to compute and to work with.

math.CO↗

Mapping Uncharted Symmetries: Machine Discovery in Combinatorics

Inspired by long-standing open problems in algebraic combinatorics, we show that modern machine learning can meaningfully contribute to verifiable mathematical discoveries. In particular, we focus on the construction of simple mathematical functions under exact distributional constraints, a setting we formalize as Simple Learning Under Rigid Proportions (SLURP). We tackle this problem by introducing two methods: MapSeek-Functional, which models the desired function alternating pseudo-labeling and supervised training steps; and MapSeek-Symbolic, designed to directly produce symbolic formulas. We successfully apply both methods to a research problem in algebraic combinatorics, discovering a new combinatorial interpretation of the $q,t$-Narayana polynomials arising from representation theory. To our knowledge, this is the first such interpretation based on noncrossing partitions. Using one discovered statistic, we find a combinatorial proof of the symmetry of these polynomials in a previously unsolved case. To streamline verification and reproducibility, we release all code, including a formalization of all the mathematical discoveries of this paper in Lean 4.

cs.LG↗

Macdonald characters from a new formula for Macdonald polynomials

We introduce a new operator $Γ$ on symmetric functions, which enables us to obtain a creation formula for Macdonald polynomials. This formula provides a connection between the theory of Macdonald operators initiated by Bergeron, Garsia, Haiman and Tesler, and shifted Macdonald polynomials introduced by Knop, Lassalle, Okounkov and Sahi. We use this formula to introduce a two-parameter generalization of Jack characters, which we call Macdonald characters. Finally, we provide a change of variables in order to formulate several positivity conjectures related to these generalized characters. Our conjectures extend some important open problems on Jack polynomials, including some famous conjectures of Goulden and Jackson.

math.CO↗

Shuffle theorems and sandpiles

We provide an explicit description of the recurrent configurations of the sandpile model on a family of graphs $\widehat{G}_{μ,ν}$, which we call clique-independent graphs, indexed by two compositions $μ$ and $ν$. Moreover, we define a delay statistic on these configurations, and we show that, together with the usual level statistic, it can be used to provide a new combinatorial interpretation of the celebrated shuffle theorem of Carlsson and Mellit. More precisely, we will see how to interpret the polynomials $\langle \nabla e_n, e_μh_ν\rangle$ in terms of these configurations.

math.CO↗

Chromatic functions, interval orders and increasing forests

The chromatic quasisymmetric functions (csf) of Shareshian and Wachs associated to unit interval orders have attracted a lot of interest since their introduction in 2016, both in combinatorics and geometry, because of their relation to the famous Stanley-Stembridge conjecture (1993) and to the topology of Hessenberg varieties, respectively. In the present work we study the csf associated to the larger class of interval orders with no restriction on the length of the intervals. Inspired by an article of Abreu and Nigro, we show that these csf are weighted sums of certain quasisymmetric functions associated to the increasing spanning forests of the associated incomparability graphs. Furthermore, we define quasisymmetric functions that include the unicellular LLT symmetric functions and generalize an identity due to Carlsson and Mellit. Finally we conjecture a formula giving their expansion in the type 1 power sum quasisymmetric functions which should extend a theorem of Athanasiadis.

math.CO↗

Some consequences of the valley Delta conjectures

In (Haglund, Remmel, Wilson 2018) Haglund, Remmel and Wilson introduced their Delta conjectures, which give two different combinatorial interpretations of the symmetric function $Δ'_{e_{n-k-1}} e_n$ in terms of rise-decorated or valley-decorated labelled Dyck paths respectively. While the rise version has been recently proved (D'Adderio, Mellit 2021; Blasiak, Haiman, Morse, Pun, Seelinger preprint 2021), not much is known about the valley version. In this work we prove the Schröder case of the valley Delta conjecture, the Schröder case of its square version (Iraci, Vanden Wyngaerd 2021), and the Catalan case of its extended version (Qiu, Wilson 2020). Furthermore, assuming the symmetry of (a refinement of) the combinatorial side of the extended valley Delta conjecture, we deduce also the Catalan case of its square version (Iraci, Vanden Wyngaerd 2021).

math.CO↗

Tiered trees and Theta operators

In [Dugan-Glennon-Gunnells-Steingrimsson-2019], the authors introduce tiered trees to define combinatorial objects counting absolutely indecomposable representations of certain quivers, and torus orbits on certain homogeneous varieties. In this paper, we use Theta operators, introduced in [D'Adderio-Iraci-VandenWyngaerd-Theta-2021], to give a symmetric function formula that enumerates these trees. We then formulate a general conjecture that extends this result, a special case of which might give some insight about how to formulate a unified Delta conjecture [Haglund-Remmel-Wilson-2018].

math.CO↗

New identities for Theta operators

In this article, we prove a new general identity involving the Theta operators introduced by the first author and his collaborators in [D'Adderio, Iraci, Vanden Wyngaerd 2020]. From this result, we can easily deduce several new identities that have combinatorial consequences in the study of Macdonald polynomials and diagonal coinvariants. In particular, we provide a unifying framework from which we recover many identities scattered in the literature, often resulting in drastically shorter proofs.

math.CO↗

A proof of the compositional Delta conjecture

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.

math.CO↗

Decorated Dyck paths, polyominoes, and the Delta conjecture

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 al. 2015]). The main technical tool is a new identity in the theory of Macdonald polynomials that extends a theorem of Haglund in [Haglund 2004]. This is an edited merge of arXiv:1712.08787 and arXiv:1709.08736

math.CO↗

Partial and global representations of finite groups

Given a subgroup H of a finite group G, we begin a systematic study of the partial representations of G that restrict to global representations of H. After adapting several results from [DEP00] (which correspond to the case where H is trivial), we develop further an effective theory that allows explicit computations. As a case study, we apply our theory to the symmetric group and its subgroup of permutations fixing 1: this provides a natural extension of the classical representation theory of the symmetric group.

math.RT↗

Orlik-Solomon-type presentations for the cohomology algebra of toric arrangements

We give an explicit presentation for the integral cohomology ring of the complement of any arrangement of level sets of characters in a complex torus (alias "toric arrangement"). Our description parallels the one given by Orlik and Solomon for arrangements of hyperplanes, and builds on De Concini and Procesi's work on the rational cohomology of unimodular toric arrangements. As a byproduct we extend Dupont's rational formality result to formality over $\mathbb Z$. The data needed in order to state the presentation is fully encoded in the poset of connected components of intersections of the arrangement.

math.AT↗

$e$-positivity of vertical strip LLT polynomials

In this article we prove the $e$-positivity of $G_{\mathbfν}[X;q+1]$ when $G_{\mathbfν}[X;q]$ is a vertical strip LLT polynomial. This property has been conjectured by Alexandersson and Panova, and by Garsia, Haglund, Qiu and Romero, and it implies several $e$-positivities conjectured by them and also by Bergeron. We make use of a result of Carlsson and Mellit that shows that a vertical strip LLT polynomial can be obtained by applying certain compositions of operators of the Dyck path algebra to the constant $1$. Our proof gives in fact an algorithm to expand these symmetric functions in the elementary basis, and it shows, as a byproduct, that these compositions of operators are actually multiplication operators.

math.CO↗

Theta operators, refined Delta conjectures, and coinvariants

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}Δ_{e_{n-k-1}}'e_n$, and prove the case $k=0$, extending the shuffle theorem of Carlsson and Mellit to a generalized shuffle theorem for $Δ_{h_m}\nabla e_n$. Moreover we show how this implies the case $k=0$ of our generalized Delta square conjecture for $\frac{[n-k]_t}{[n]_t}Δ_{h_m}Δ_{e_{n-k}}ω(p_n)$, extending the square theorem of Sergel to a generalized square theorem for $Δ_{h_m}\nabla ω(p_n)$. Still the Theta operators will provide a conjectural formula for the Frobenius characteristic of super-diagonal coinvariants with two sets of Grassmanian variables, extending the one of Zabrocki for the case with one set of such variables. We propose a combinatorial interpretation of this last formula at $q=1$, leaving open the problem of finding a dinv statistic that gives the whole symmetric function.

math.CO↗

Weak generalized lifting property, Bruhat intervals and Coxeter matroids

We provide a weaker version of the generalized lifting property which holds in complete generality for all finite Coxeter groups, and we use it to show that every parabolic Bruhat interval of a finite Coxeter group is a Coxeter matroid. We also describe some combinatorial properties of the associated polytopes.

math.CO↗