Related papers: Optimal Cooperation and Submodularity for Computin…
We show how to obtain a fast component-by-component construction algorithm for higher order polynomial lattice rules. Such rules are useful for multivariate quadrature of high-dimensional smooth functions over the unit cube as they achieve…
An exact analytical solution of generalized three-state double-chain Potts model with multi-spin interactions which are invariant under cyclic shift of all spin values is obtained. The partition function in a finite cyclically closed strip…
We consider the problem of sampling from the Potts model on random regular graphs. It is conjectured that sampling is possible when the temperature of the model is in the uniqueness regime of the regular tree, but positive algorithmic…
This paper presents the first combinatorial polynomial-time algorithm for minimizing submodular set functions, answering an open question posed in 1981 by Grotschel, Lovasz, and Schrijver. The algorithm employs a scaling scheme that uses a…
We present a quantum algorithm for combinatorial optimization using the cost structure of the search states. Its behavior is illustrated for overconstrained satisfiability and asymmetric traveling salesman problems. Simulations with…
A matroid is a notion of independence in combinatorial optimization which is closely related to computational efficiency. In particular, it is well known that the maximum of a constrained modular function can be found greedily if and only…
We explore the Potts model on the generalized decorated square lattice, with both nearest (J1) and next-neighbor (J2) interactions. Using the tensor renormalization-group method augmented by higher-order singular value decompositions, we…
A generalization of recent group-theoretic matrix multiplication algorithms to an analogue of the theory of partial matrix multiplication is presented. We demonstrate that the added flexibility of this approach can in some cases improve…
This article provides a comprehensive exploration of submodular maximization problems, focusing on those subject to uniform and partition matroids. Crucial for a wide array of applications in fields ranging from computer science to systems…
Sampling from the $q$-state ferromagnetic Potts model is a fundamental question in statistical physics, probability theory, and theoretical computer science. On general graphs, this problem may be computationally hard, and this hardness…
We give an FPTAS and an efficient sampling algorithm for the high-fugacity hard-core model on bounded-degree bipartite expander graphs and the low-temperature ferromagnetic Potts model on bounded-degree expander graphs. The results apply,…
Multi-robot cooperative control has gained extensive research interest due to its wide applications in civil, security, and military domains. This paper proposes a cooperative control algorithm for multi-robot systems with general linear…
In this work, we present a compact analytical approximation for the quantum partition function of systems composed of quantum oscillators. The proposed formula is general and applicable to an arbitrary number of oscillators described by a…
We present and analyze low-temperature series and complex-temperature partition function zeros for the $q$-state Potts model with $q=4$ on the honeycomb lattice and $q=3,4$ on the triangular lattice. A discussion is given as to how the…
We present exact calculations of the zero-temperature partition function for the $q$-state Potts antiferromagnet (equivalently, the chromatic polynomial) for families of arbitrarily long strip graphs of the square and triangular lattices…
We study the complexity of approximating the partition function of the $q$-state Potts model and the closely related Tutte polynomial for complex values of the underlying parameters. Apart from the classical connections with quantum…
We present exact calculations of the partition function of the $q$-state Potts model on (i) open, (ii) cyclic, and (iii) M\"obius strips of the honeycomb (brick) lattice of width $L_y=2$ and arbitrarily great length. In the infinite-length…
We determine the general structure of the partition function of the $q$-state Potts model in an external magnetic field, $Z(G,q,v,w)$ for arbitrary $q$, temperature variable $v$, and magnetic field variable $w$, on cyclic, M\"obius, and…
With any state of a multipartite quantum system its separability polytope is associated. This is an algebro-topological object (non-trivial only for mixed states) which captures the localisation of entanglement of the state. Particular…
This paper studies the polynomial optimization problem whose feasible set is a union of several basic closed semialgebraic sets. We propose a unified hierarchy of Moment-SOS relaxations to solve it globally. Under some assumptions, we prove…