A note on a counting problem arising in percolation theory

Rafi Levy; Eli Shamir

doi:10.1016/0012-365X(93)90377-6

A note on a counting problem arising in percolation theory

Rafi Levy
, Eli Shamir^*

^*Corresponding author for this work

Einstein Institute of Mathematics

Research output: Contribution to journal › Article › peer-review

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.

Original language	English
Pages (from-to)	361-365
Number of pages	5
Journal	Discrete Mathematics
Volume	114
Issue number	1-3
DOIs	https://doi.org/10.1016/0012-365X(93)90377-6
State	Published - 28 Apr 1993

Access to Document

10.1016/0012-365X(93)90377-6

Cite this

@article{77ac75ae7e0742c9a45053b6c28ff4f8,

title = "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.",

author = "Rafi Levy and Eli Shamir",

year = "1993",

month = apr,

day = "28",

doi = "10.1016/0012-365X(93)90377-6",

language = "אנגלית",

volume = "114",

pages = "361--365",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier B.V.",

number = "1-3",

}

TY - JOUR

T1 - A note on a counting problem arising in percolation theory

AU - Levy, Rafi

AU - Shamir, Eli

PY - 1993/4/28

Y1 - 1993/4/28

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/43949167612

U2 - 10.1016/0012-365X(93)90377-6

DO - 10.1016/0012-365X(93)90377-6

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:43949167612

SN - 0012-365X

VL - 114

SP - 361

EP - 365

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 1-3

ER -

A note on a counting problem arising in percolation theory

Abstract

Access to Document

Other files and links

Fingerprint

Cite this