{"paper":{"title":"Exploring a Delta Schur Conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Adriano Garsia, Jeffrey B. Remmel, Jeffrey Liese, Meesue Yoo","submitted_at":"2018-01-23T03:18:27Z","abstract_excerpt":"In \\cite{HRW15}, Haglund, Remmel, Wilson state a conjecture which predicts a purely combinatorial way of obtaining the symmetric function $\\Delta_{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 $\\Delta_{s_\\nu} 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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.07385","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}