Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 0705.3751

On the expressive power of planar perfect matching and permanents of bounded treewidth matrices

Laurent Lyaudet·Pascal Koiran·Uffe Flarup
View original source ↗Read source document ↗Export metadata ↓

Abstract

Valiant introduced some 25 years ago an algebraic model of computation along with the complexity classes VP and VNP, which can be viewed as analogues of the classical classes P and NP. They are defined using non-uniform sequences of arithmetic circuits and provides a framework to study the complexity for sequences of polynomials. Prominent examples of difficult (that is, VNP-complete) problems in this model includes the permanent and hamiltonian polynomials. While the permanent and hamiltonian polynomials in general are difficult to evaluate, there have been research on which special cases of these polynomials admits efficient evaluation. For instance, Barvinok has shown that if the underlying matrix has bounded rank, both the permanent and the hamiltonian polynomials can be evaluated in polynomial time, and thus are in VP. Courcelle, Makowsky and Rotics have shown that for matrices of bounded treewidth several difficult problems (including evaluating the permanent and hamiltonian polynomials) can be solved efficiently. An earlier result of this flavour is Kasteleyn's theorem which states that the sum of weights of perfect matchings of a planar graph can be computed in polynomial time, and thus is in VP also. For general graphs this problem is VNP-complete. In this paper we investigate the expressive power of the above results. We show that the permanent and hamiltonian polynomials for matrices of bounded treewidth both are equivalent to arithmetic formulas. Also, arithmetic weakly skew circuits are shown to be equivalent to the sum of weights of perfect matchings of planar graphs.

Explore related subjects

cs.DMcs.CC

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Laurent Lyaudet, Pascal Koiran, Uffe Flarup. 2007-05-25. On the expressive power of planar perfect matching and permanents of bounded treewidth matrices. https://arxiv.org/abs/0705.3751

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

The Richness of CSP Non-redundancy

In the field of constraint satisfaction problems (CSP), a clause is called redundant if its satisfaction is implied by satisfying all other clauses. An instance of CSP$(P)$ is called non-redundant if it does not contain any redundant clause. The non-redundancy (NRD) of a predicate $P$ is the maximum number of clauses in a non-redundant instance of CSP$(P)$, as a function of the number of variables $n$. Recent progress has shown that non-redundancy is crucially linked to many other important questions in computer science and mathematics including sparsification, kernelization, query complexity, universal algebra, and extremal combinatorics. Given that non-redundancy is a nexus for many of these important problems, the central goal of this paper is to more deeply understand non-redundancy. Our first main result shows that for every rational number $r \ge 1$, there exists a finite CSP predicate $P$ such that the non-redundancy of $P$ is $Θ(n^r)$. Our second main result explores the concept of conditional non-redundancy first coined by Brakensiek and Guruswami [STOC 2025]. We completely classify the conditional non-redundancy of all binary predicates (i.e., constraints on two variables) by connecting these non-redundancy problems to the structure of high-girth graphs in extremal combinatorics. Inspired by these concrete results, we build off the work of Carbonnel [CP 2022] to develop an algebraic theory of conditional non-redundancy. As an application of this algebraic theory, we revisit the notion of Mal'tsev embeddings, which is the most general technique known to date for establishing that a predicate has linear non-redundancy. For example, we provide the first example of predicate with a Mal'tsev embedding that cannot be attributed to the structure of an Abelian group, but rather to the structure of the quantum Pauli group.

cs.DM↗
arXiv2026

Zero Forcing Sets in Temporal Graphs

The Zero Forcing (or corruption) of a graph is the problem of finding a minimum-size ``corrupting'' set. It corresponds to a subset of its vertices that can corrupt the whole graph by iterating the following rule: if a corrupted vertex has exactly one neighbor that is not yet corrupted, the neighbor gets corrupted. The iteration of this process comes from the fact that the corruption of a vertex might enable new corruptions (from itself or some of its neighbors). For this reason, one can consider a step of corruption, where all the possible instances of the corruption rule are applied at once. This paper investigates Zero Forcing on temporal graphs, where the topology of the graph evolves throughout the experiment. At each time step (or snapshot) of the graph, a step of corruption is resolved wherever possible. We study the problem of finding a minimum-size corrupting set such that the whole (temporal) graph is corrupted at the end of the experiment. We present a panorama of results, including NP-hardness in some not-so-restrictive scenarios, polynomial algorithms, and a solution to an open question when the whole graph must be corrupted in a single step.

cs.DM↗
arXiv2026

An Algorithm for Linear Parametric Minimum Cycle Mean Problem

The minimum cycle mean problem (MCM) on weighted digraphs is the problem of finding the minimum value of the cycle mean, that is, the ratio of the cost to the length, over all cycles. Despite its wide range of applications to discrete event systems, the parametric counterpart of the MCM has received relatively little attention in the literature, unlike other parametric problems in network optimization. In this paper, we consider the linear parametric MCM, where all edges $e$ have cost $a(e)-b(e)t$ with parameter $t$. We propose an algorithm to solve the linear parametric MCM in $O((m+n\log n)n^2W)$ time, where $n$ is the number of vertices, $m$ is the number of edges, and $W$ is the maximum absolute value of the coefficients $b(e) \in \mathbb{Z}$. The central technique of the proposed method is the algorithm for the parametric shortest path problem. The MCM is closely related to spectral theory in the tropical semiring, where the ``$\min$'' operation is regarded as addition and ``$+$'' as multiplication. By exploiting the connection between them, we provide a method to compute the eigenvalues and eigenvectors of tropical parametric matrices.

cs.DM↗