BZPEERReading, trust and collaboration for research
Menu

Discover

GraphFollow connections around a paper, topic or saved view.

Workspaces

HomePick up where your research flow left off.InboxHandle requests, replies and notifications from one place.CollectionsCurate reading lists, evidence sets and shareable dossiers.ResearchSee your private provenance graph, trail and imports.CollaborationMove from discovery into focused discussion rooms.PublishDraft, preview and publish full-text research articles.

Network

ExpertsFind specialists worth following or asking for help.CommunitiesJoin research circles organized around shared work.PartnersSee external organizations active around the same topics.

Opportunities

ListingsBrowse roles, calls and collaborations with clearer fit signals.

Account

Log inReturn to your reading and collaboration workspace.Create accountStart saving work, following people and joining teams.
Log inCreate account

Researcher profile

Alessandro Iraci

Alessandro Iraci contributes to research discovery and scholarly infrastructure.

ResearcherAffiliation not importedOpen to collaborate
math.COMachine Learning

Trust snapshot

Quick read

Trust 21 - EmergingVerification L1Unclaimed author
11works
0followers
2topics
4close collaborators

Actions

Decide how to stay connected

Follow researcher0

Identity and collaboration

How to connect with this researcher

Claiming links this public author record to a researcher profile and unlocks direct collaboration workflows.

Log in to claim

Direct collaboration

Open a focused conversation when the fit is right

Claim this author entity first to unlock direct invitations.

Research graph

See the researcher in context

Open full explorer

Inspect adjacent work, topics, institutions and collaborators without jumping out to a separate graph page.

Building this graph slice

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

11 published item(s)

preprint2026arXiv

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.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

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.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

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.

0 citations0 reviewsNo code linkedOpen access
preprint2021arXiv

"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.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

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].

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

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

0 citations0 reviewsNo code linkedOpen access
preprint2019arXiv

The new dinv is not so new

In (Duane, Garsia, Zabrocki 2013) the authors introduced a new dinv statistic, denoted ndinv, on the two part case of the shuffle conjecture (Haglund et al. 2005) in order to prove a compositional refinement. Though in (Hicks, Kim 2013) a non-recursive (but algorithmic) definition of ndinv has been given, this statistic still looks a bit unnatural. In this paper we "unveil the mystery" around the ndinv, by showing bijectively that the ndinv actually matches the usual dinv statistic in a special case of the generalized Delta conjecture in (Haglund, Remmel, Wilson 2018). Moreover, we give also a non-compositional proof of the "$ehh$" case of the shuffle conjecture (after (Garsia, Xin, Zabrocki 2014)) by bijectively proving a relation with the two part case of the Delta conjecture.

0 citations0 reviewsNo code linkedOpen access
preprint2019arXiv

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.

0 citations0 reviewsNo code linkedOpen access
preprint2018arXiv

The Delta square conjecture

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 proving the specialization $m=q=0$, reducing it to the same case of the Delta conjecture, and the Schröder case, i.e. the case $\langle \cdot ,e_{n-d}h_d\rangle$. The latter provides a broad generalization of the $q,t$-square theorem of Can and Loehr (Can, Loehr 2006). We give also a combinatorial involution, which allows to establish a linear relation among our conjectures (as well as the generalized Delta conjectures) with fixed $m$ and $n$. Finally, in the appendix, we give a new proof of the Delta conjecture at $q=0$.

0 citations0 reviewsNo code linkedOpen access
preprint2018arXiv

The Schröder case of the generalized Delta conjecture

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 combinatorial interpretation of the same polynomial in terms of a new bounce statistic. Moreover, we give two more interpretations of the same polynomial in terms of doubly decorated parallelogram polyominoes, extending some of the results in (D'Adderio, Iraci 2017), which in turn extended results in (Aval et al. 2014). Also, we provide combinatorial bijections explaining some of the equivalences among these interpretations.

0 citations0 reviewsNo code linkedOpen access