Representing polynomial of ST-CONNECTIVITY
We show that the coefficients of the representing polynomial of any monotone Boolean function are the values of the M\"obius function of an atomistic lattice related to this function. Using this we determine the representing polynomial of any Boolean function corresponding to a ST-CONNECTIVITY...
Saved in:
| Published in: | Discrete mathematics and theoretical computer science Vol. 25:2; no. Combinatorics |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Discrete Mathematics & Theoretical Computer Science
29.04.2024
|
| Subjects: | |
| ISSN: | 1365-8050, 1365-8050 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | We show that the coefficients of the representing polynomial of any monotone
Boolean function are the values of the M\"obius function of an atomistic
lattice related to this function. Using this we determine the representing
polynomial of any Boolean function corresponding to a ST-CONNECTIVITY problem
in acyclic quivers (directed acyclic multigraphs). Only monomials corresponding
to unions of paths have non-zero coefficients which are $(-1)^D$ where $D$ is
an easily computable function of the quiver corresponding to the monomial (it
is the number of plane regions in the case of planar graphs). We determine that
the number of monomials with non-zero coefficients for the two-dimensional $n
\times n$ grid connectivity problem is $2^{\Omega(n^2)}$. |
|---|---|
| ISSN: | 1365-8050 1365-8050 |
| DOI: | 10.46298/dmtcs.9934 |