The design of efficient dynamic programming and transfer matrix enumeration algorithms

DOI10.1088/1751-8121/AA8120zbMATH Open1371.05011OpenAlexW2736800348WikidataQ60692413 ScholiaQ60692413MaRDI QIDQ5363387FDOQ5363387

Authors: Andrew R. Conway 

Publication date: 6 October 2017

Published in: Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1088/1751-8121/aa8120

Recommendations

• A new transfer-matrix algorithm for exact enumerations: self-avoiding polygons on the square lattice
• Algebraic dynamic programming
• Publication:5751948
• Algorithmic combinatorics based on slicing posets
• Fast enumeration of combinatorial objects

zbMATH Keywords

lattice modelstransfer matrixenumeration algorithm

Mathematics Subject Classification ID

Dynamic programming (90C39) Exact enumeration problems, generating functions (05A15) Lattice packing and covering (number-theoretic aspects) (11H31)

Cites Work

• Analytic combinatorics
• Excluded permutation matrices and the Stanley-Wilf conjecture
• Enumerations of lattice animals and trees
• Counting polyominoes: yet another attack
• Using functional equations to enumerate 1324-avoiding permutations
• On \(1324\)-avoiding permutations
• Enumerating 2D percolation series by the finite-lattice method: theory
• Algebraic techniques for enumerating self-avoiding walks on the square lattice
• Self-avoiding polygons on the square lattice
• Equivalence of the two-dimensional directed animal problem to a one- dimensional path problem
• Animaux et arbres guingois. (Animals and guingois trees)
• A new transfer-matrix algorithm for exact enumerations: self-avoiding polygons on the square lattice

Cited In (3)

• Solving unconstrained binary polynomial programs with limited reach: application to low autocorrelation binary sequences
• Design, implementation, and analysis of maximum transversal algorithms
• Exact site-percolation probability on the square lattice

This page was built for publication: The design of efficient dynamic programming and transfer matrix enumeration algorithms

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