{"paper":{"title":"Recursive structures in the multispecies TASEP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.MP"],"primary_cat":"cond-mat.stat-mech","authors_text":"Arvind Ayyer, Chikashi Arita, Kirone Mallick, Sylvain Prolhac","submitted_at":"2011-04-19T14:04:35Z","abstract_excerpt":"We consider a multi-species generalization of the totally asymmetric simple exclusion process (TASEP) with the simple hopping rule: for x and yth-class particles (x<y), the transition xy -> yx occurs with a rate independent from the values x and y. P. A. Ferrari and J. Martin (2007) obtained the stationary state of this model thanks to a combinatorial algorithm, which was subsequently interpreted as a matrix product representation by Evans et al. (2009). This `matrix ansatz' shows that the stationary state of the multi-species TASEP with N classes of particles (N-TASEP) can be constructed alge"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.3752","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"}