Related papers: The Complexity of Partition Functions on Hermitian…
We describe efficient differentiation methods for computing Jacobians and gradients of a large class of matrix functions including the matrix logarithm $\log(A)$ and $p$-th roots $A^{\frac{1}{p}}$. We exploit contour integrals and conformal…
We analyze models of spin glasses on the two-dimensional square lattice by exploiting symmetry arguments. The replicated partition functions of the Ising and related spin glasses are shown to have many remarkable symmetry properties as…
We study the problem of approximating the Ising model partition function with complex parameters on bounded degree graphs. We establish a deterministic polynomial-time approximation scheme for the partition function when the interactions…
We analyze integral representation and $\Gamma$-convergence properties of functionals defined on \emph{piecewise rigid functions}, i.e., functions which are piecewise affine on a Caccioppoli partition where the derivative in each component…
We study a class of functional problems reducible to computing $f^{(n)}(x)$ for inputs $n$ and $x$, where $f$ is a polynomial-time bijection. As we prove, the definition is robust against variations in the type of reduction used in its…
Graphs are widely used to model execution dependencies in applications. In particular, the NP-complete problem of partitioning a graph under constraints receives enormous attention by researchers because of its applicability in…
We study the semiclassical partition function in the frame work of the Morse theory, to clarify the phase factor of the partition function and to relate it to the eta invariant of Atiyah. Converting physical system with potential into a…
Recently it was shown that, for every fixed k>1, given a finite simply connected simplicial complex X, the kth homotopy group \pi_k(X) can be computed in time polynomial in the number n of simplices of X. We prove that this problem is…
The partition functions $P(n,m,p)$, the number of integer partitions of $n$ into exactly $m$ parts with each part at most $p$, and $Q(n,m,p)$, the number of integer partitons of $n$ into exactly $m$ distinct parts with each part at most…
Aims. In this work we rigorously show the shortcomings of various simplifications that are used to calculate the total internal partition function. These shortcomings can lead to errors of up to 40 percent or more in the estimated partition…
Graph partitioning is a key fundamental problem in the area of big graph computation. Previous works do not consider the practical requirements when optimizing the big data analysis in real applications. In this paper, motivated by…
We give general conditions for the existence of a Hamiltonian operator whose discrete time evolution matches the partition function of certain solvable lattice models. In particular, we examine two classes of lattice models: the classical…
Imaging Mueller polarimetry has already proved its potential for metrology, remote sensing and biomedicine. The real-time applications of this modality require both video rate image acquisition and fast data post-processing algorithms.…
We demonstrate that statistics of certain classes of set partitions is described by generating functions related to the Burgers, Ibragimov--Shabat and Korteweg--de Vries integrable hierarchies.
For an Abelian surface $A$ with a symplectic action by a finite group $G$, one can define the partition function for $G$-invariant Hilbert schemes \[Z_{A, G}(q) = \sum_{d=0}^{\infty} e(\text{Hilb}^{d}(A)^{G})q^{d}.\] We prove the reciprocal…
The theory of partition congruences has been a fascinating and difficult subject for over a century now. In attempting to prove a given congruence family, multiple possible complications include the genus of the underlying modular curve,…
In this paper we introduce the new notion of complex isoparametric functions on Riemannian manifolds. These are then employed to devise a general method for constructing proper $p$-harmonic functions. We then apply this to construct the…
We answer the following question posed by Lechuga: Given a simply-connected space $X$ with both $H_*(X,\qq)$ and $\pi_*(X)\otimes \qq$ being finite-dimensional, what is the computational complexity of an algorithm computing the cup-length…
Partition functions for dimers on closed oriented surfaces are known to be alternating sums of Pfaffians of Kasteleyn matrices. In this paper, we obtain the formula for the coefficients in terms of discrete spin structures.
Let $p$ be a prime. In this paper, we compute complexities of some simple modules of symmetric groups labelled by two-part partitions. Most of the simple modules considered here are contained in the $p$-blocks with non-abelian defect…