Enumerative combinatorics of lattice polymers

DOI10.1090/NOTI2255MaRDI QIDQ5006137zbMATH OpenOpenAlexFDO

Authors Nathan Clisby

Publication date 12 August 2021

Published in Notices of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1090/noti2255

zbMATH Keywords

lattice polymersrandom walk

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41) Statistical mechanics of polymers (82D60)

Recommendations

• Some problems in the counting of lattice animals, polyominoes, polygons and walks
• Exact solutions of lattice polymer models
• Some combinatorial problems in statistical physics
• Exactly solvable lattice model of rooted branched polymers
• Exactly solved models

Cited in

(4)

• scientific article; zbMATH DE number 4012616 (Why is no real title available?)
• scientific article; zbMATH DE number 4112590 (Why is no real title available?)
• The second Vassiliev measure of uniform random walks and polygons in confined space
• The strict-weak lattice polymer

This page was built for publication: Enumerative combinatorics of lattice polymers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5006137)