Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

29

COMBINATORICS
1998

favoriteEmaildiscussreport

76views more COMBINATORICS 1998»

An Exploration of the Permanent-Determinant Method

13 years 10 months ago

An Exploration of the Permanent-Determinant Method

Download www.combinatorics.org

The permanent-determinant method and its generalization, the HafnianPfaﬃan method, are methods to enumerate perfect matchings of plane graphs that were discovered by P. W. Kasteleyn. We present several new techniques and arguments related to the permanent-determinant with consequences in enumerative combinatorics. Here are some of the results that follow from these techniques:

Greg Kuperberg

Real-time Traffic

COMBINATORICS 1998 | HafnianPfaﬃan Method | Perfect Matchings | Permanent-determinant Method |

claim paper

Related Content

» Evidence Explorer A Tool for Exploring ModelChecking Proofs

» Intelligent exploration method for XCS

» An exploration method for general robotic systems equipped with multiple sensors

» Automatic Annotation for KoreanApproach Based on the Contextual Exploration Method

» Fast Design Space Exploration Method for Reconfigurable Architectures

» Exploration of bat wing morphology through a strip method and visualization

» Generation as method for explorative learning in computer science education

» Efficient methods for embedded system design space exploration

» Automated Analytical Methods to Support Visual Exploration of HighDimensional Data

Post Info
More Details (n/a)

Added	21 Dec 2010
Updated	21 Dec 2010
Type	Journal
Year	1998
Where	COMBINATORICS
Authors	Greg Kuperberg

Comments (0)