Some algorithmic applications of partition functions in combinatorics

DOI10.1007/978-3-319-24298-9_20MaRDI QIDQ2957192zbMATH OpenOpenAlexFDO

Authors Alexander Barvinok

Publication date 25 January 2017

Published in Recent Trends in Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-24298-9_20

zbMATH Keywords

algorithmgraph homomorphismpartition functionpermanentscaling

Mathematics Subject Classification ID

Partitions of sets (05A18) Enumeration in graph theory (05C30) Eulerian and Hamiltonian graphs (05C45)

Recommendations

• Computing the partition function for perfect matchings in a hypergraph
• Combinatorics and complexity of partition functions
• Computing the partition function for graph homomorphisms with multiplicities
• Partitioning into sets of bounded cardinality
• The complexity of partition functions

Cited in

(8)

• Computing the partition function for perfect matchings in a hypergraph
• Computing the partition function for cliques in a graph
• scientific article; zbMATH DE number 95277 (Why is no real title available?)
• scientific article; zbMATH DE number 1954382 (Why is no real title available?)
• scientific article; zbMATH DE number 1439398 (Why is no real title available?)
• Combinatorics and complexity of partition functions
• Weighted counting of solutions to sparse systems of equations
• A computational framework for the study of partition functions and graph polynomials

This page was built for publication: Some algorithmic applications of partition functions in combinatorics

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