A note on a counting problem arising in percolation theory
暂无分享，去创建一个
Abstract We investigate an esoteric enumeration problem on graphs which arises from a physical model related to the continuum percolation theory. It counts signed objects, but surprisingly, we are able to find an equivalent count of positive signs only, namely, restricted acyclic orientations. This reduces the counting effort, but shows on the other hand that it is a #P-complete problem.
[1] Antonio Coniglio,et al. Distribution of physical clusters , 1977 .
[2] N. Linial. Hard enumeration problems in geometry and combinatorics , 1986 .
[3] Janos Simon,et al. On the Difference Between One and Many (Preliminary Version) , 1977, ICALP.
[4] Richard P. Stanley. Acyclic orientations of graphs , 1973, Discret. Math..
[5] Salvatore Torquato,et al. Pair connectedness and mean cluster size for continuum‐percolation models: Computer‐simulation results , 1988 .