SearcharxivSearch

arXiv subjects

Alessandro Iraci

Publications and source records attributed to Alessandro Iraci.

At least 19 recordsLinked to original sources

Leaving the Hall: explicit formulas for Negu\c{t} 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 Negu\c{t} 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 Negu\c{t} 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

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

Falling stars: a fall-decorated rational shuffle theorem

In this paper, we formulate a rational analog of the fall Delta theorem and the Delta square conjecture. We find a new dinv statistic on fall-decorated paths on a $(m+k) \times (n+k)$ rectangle that simultaneously extends the previously known dinv statistics on decorated square objects and non-decorated rectangular objects. We prove a symmetric function formula for the $q,t$-generating function of fall-decorated rectangular Dyck paths as a skewing operator applied to $e_{m,n+km}$ and, conditionally on the rectangular paths conjecture, an analog formula for fall-decorated rectangular paths.

math.CO

The super nabla operator

We consider here a new operator, called ``super nabla'', which is shown to be generic among operators for which the modified Macdonald polynomials are joint eigenfunctions. All previously known Macdonald eigenoperators can readily be obtained from super nabla, including the usual nabla operator, the Delta operators, and other operators that have appeared in the literature. Thus, the super nabla operator furnishes an overall unified viewpoint on this family of operators, as well as opening up new possibilities. We prove several new identities arising from specializations of the parameters $q$ and $t$ involved in the specification of these operators, as well as unifying combinatorial interpretations.

math.CO

A Proof of the Symmetric Theta Conjecture when q = 0

In 10.1093/imrn/rnac258, the authors conjecture a combinatorial formula for the expressions $Ξe_α\rvert_{t=1}$, known as Symmetric Theta Trees Conjecture, in terms of tiered trees with an inversion statistic. In 10.1017/fms.2024.14, the authors prove a combinatorial formula for the same symmetric function, in terms of doubly labelled Dyck paths with the area statistic. In this paper, we give an explicit bijection between the subsets of the two families of objects when the relevant statistic is equal to $0$, thus proving the Symmetric Theta Tree Conjecture when $q=0$.

math.CO

Learning to Play 7 Wonders Duel Without Human Supervision

This paper introduces ZeusAI, an artificial intelligence system developed to play the board game 7 Wonders Duel. Inspired by the AlphaZero reinforcement learning algorithm, ZeusAI relies on a combination of Monte Carlo Tree Search and a Transformer Neural Network to learn the game without human supervision. ZeusAI competes at the level of top human players, develops both known and novel strategies, and allows us to test rule variants to improve the game's balance. This work demonstrates how AI can help in understanding and enhancing board games.

cs.AI

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

Smirnov words and the Delta Conjectures

We provide a combinatorial interpretation of the symmetric function $\left.Θ_{e_k}Θ_{e_l}\nabla e_{n-k-l}\right|_{t=0}$ in terms of segmented Smirnov words. The motivation for this work is the study of a diagonal coinvariant ring with one set of commuting and two sets of anti-commuting variables, whose Frobenius characteristic is conjectured to be the symmetric function in question. Furthermore, this function is related to the Delta conjectures. Our work is a step towards a unified formulation of the two versions, as we prove a unified Delta theorem at $t=0$.

math.CO

Delta and Theta Operator Expansions

We give an elementary symmetric function expansion for $MΔ_{m_γe_1}Πe_λ^{\ast}$ and $MΔ_{m_γe_1}Πs_λ^{\ast}$ when $t=1$ in terms of what we call $γ$-parking functions and lattice $γ$-parking functions. Here, $Δ_F$ and $Π$ are certain eigenoperators of the modified Macdonald basis and $M=(1-q)(1-t)$. Our main results in turn give an elementary basis expansion at $t=1$ for symmetric functions of the form $M Δ_{Fe_1} Θ_{G} J$ whenever $F$ is expanded in terms of monomials, $G$ is expanded in terms of the elementary basis, and $J$ is expanded in terms of the modified elementary basis $\{Πe_λ^\ast\}_λ$. Even the most special cases of this general Delta and Theta operator expression are significant; we highlight a few of these special cases. We end by giving an $e$-positivity conjecture for when $t$ is not specialized, proposing that our objects can also give the elementary basis expansion in the unspecialized symmetric function.

math.CO

Charmed roots and the Kroweras complement

Although both noncrossing partitions and nonnesting partitions are uniformly enumerated for Weyl groups, the exact relationship between these two sets of combinatorial objects remains frustratingly mysterious. In this paper, we give a precise combinatorial answer in the case of the symmetric group: for any standard Coxeter element, we construct an equivariant bijection between noncrossing partitions under the Kreweras complement and nonnesting partitions under a Coxeter-theoretically natural cyclic action we call the Kroweras complement. Our equivariant bijection is the unique bijection that is both equivariant and support-preserving, and is built using local rules depending on a new definition of charmed roots. Charmed roots are determined by the choice of Coxeter element -- in the special case of the linear Coxeter element $(1, 2, \dots, n)$, we recover one of the standard bijections between noncrossing and nonnesting partitions.

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

Rectangular analogues of the square paths conjecture and the univariate Delta conjecture

In this paper, we extend the rectangular side of the shuffle conjecture by stating a rectangular analogue of the square paths conjecture. In addition, we describe a set of combinatorial objects and one statistic that are a first step towards a rectangular extension of (the rise version of) the Delta conjecture, and of (the rise version of) the Delta square conjecture, corresponding to the case $q=1$ of an expected general statement. We also prove our new rectangular paths conjecture in the special case when the sides of the rectangle are coprime.

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

A proof of the fermionic Theta coinvariant conjecture

Let $(x_1, \dots, x_n, y_1, \dots, y_n)$ be a list of $2n$ commuting variables, $(θ_1, \dots, θ_n, ξ_1, \dots, ξ_n)$ be a list of $2n$ anticommuting variables, and $\mathbb{C}[X_n, Y_n] \otimes \wedge \{Θ_n, Ξ_n\}$ be the algebra generated by these variables. D'Adderio, Iraci, and Vanden Wyngaerd introduced the {\em Theta operators} on the ring of symmetric functions and used them to conjecture a formula for the quadruply-graded $\mathfrak{S}_n$-isomorphism type of $\mathbb{C}[X_n,Y_n] \otimes \wedge \{Θ_n, Ξ_n\}/I$ where $I$ is the ideal generated by $\mathfrak{S}_n$-invariants with vanishing constant term. We prove their conjecture in the `purely fermionic setting' obtained by setting the commuting variables equal $x_i, y_i$ equal to zero.

math.CO

"Pushing" our way from the valley Delta to the generalised valley Delta

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 square conjecture, and to suggest a symmetric function identity later stated and proved in [D'Adderio, Romero 2020]. In this paper, we use the pushing algorithm together with the aforementioned symmetric function identity in order to prove that the valley version of the Delta conjecture implies the valley version of the generalised Delta conjecture, which means that they are actually equivalent. Combining this with the results in [Iraci, Vanden Wyngaerd 2020], we prove that the valley version of the Delta conjecture also implies the corresponding generalised Delta square conjecture.

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

A valley version of the Delta square conjecture

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$ operators introduced in [D'Adderio, Iraci, Vanden Wyngaerd 2019 - Theta 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