2000 character limit reached
The completeness of the Bethe ansatz for the periodic ASEP
Published 12 Nov 2015 in math-ph, cond-mat.stat-mech, math.AG, math.MP, and nlin.SI | (1511.03762v2)
Abstract: The asymmetric simple exclusion process (ASEP) for N particles on a ring with L sites may be analyzed using the Bethe ansatz. In this paper, we provide a rigorous proof that the Bethe ansatz is complete for the periodic ASEP. More precisely, we show that for all but finitely many values of the hopping rate, the solutions of the Bethe ansatz equations do indeed yield all L choose N eigenstates. The proof follows ideas of Langlands and Saint-Aubin, which draw upon a range of techniques from algebraic geometry, topology and enumerative combinatorics.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.