Related papers: Approximating Holant problems by winding
In this paper we provide a framework for the study of isoperimetric problems in finitely generated group, through a combinatorial study of universal covers of compact simplicial complexes. We show that, when estimating filling functions,…
We study the computational problem of computing a fair means clustering of discrete vectors, which admits an equivalent formulation as editing a colored matrix into one with few distinct color-balanced rows by changing at most $k$ values.…
A nonlinear inverse problem of antiplane elasticity for a multiply connected domain is examined. It is required to determine the profile of $n$ uniformly stressed inclusions when the surrounding infinite body is subjected to antiplane…
Rice's theorem shows that nontrivial extensional properties of partial recursive functions are undecidable. For finite weighted Boolean optimization/CSP-style slices, a Rice-style structural analogue holds for tractability classification:…
On a closed manifold, consider the space of all Riemannian metrics for which -Delta + kR is positive (nonnegative) definite, where k > 0 and R is the scalar curvature. This spectral generalization of positive (nonnegative) scalar curvature…
We give a fully polynomial randomized approximation scheme to compute a lower bound for the matching polynomial of any weighted graph at a positive argument. For the matching polynomial of complete bipartite graphs with bounded weights…
A generalized 1-in-3SAT problem is defined and found to be in complexity class P when restricted to a certain subset of CNF expressions. In particular, 1-in-kSAT with no restrictions on the number of literals per clause can be decided in…
We demonstrate a compactness result holding broadly across supervised learning with a general class of loss functions: Any hypothesis class $H$ is learnable with transductive sample complexity $m$ precisely when all of its finite…
This paper proposes a new Helmholtz decomposition based windowed Green function (HD-WGF) method for solving the time-harmonic elastic scattering problems on a half-space with Dirichlet boundary conditions in both 2D and 3D. The Helmholtz…
The Farrington-Manning method is a common method for evaluating equivalence and non-inferiority of independent proportions. It is implemented in various software, in particular SAS$^\circledR$ PROC FREQ, and the R$^\circledR$ function…
The exact 2-point function of certain physically motivated operators in SYK-like spin glass models is computed, bypassing the Schwinger-Dyson equations. The models possess an IR low energy conformal window, but our results are exact at all…
Holant problems are a family of counting problems on graphs, parametrised by sets of complex-valued functions of Boolean inputs. Holant^c denotes a subfamily of those problems, where any function set considered must contain the two unary…
This work develops a covariance function which allows for a stronger spatial correlation for pairs of points in the direction of a vector such as wind and weaker for pairs which are perpendicular to it. It derives a simple covariance…
We show how up-to techniques for (bi-)similarity can be used in the setting of weighted systems. The problems we consider are language equivalence, language inclusion and the threshold problem (also known as universality problem) for…
We give a 1.488-approximation for the classic scheduling problem of minimizing total weighted completion time on unrelated machines. This is a considerable improvement on the recent breakthrough of $(1.5 - 10^{-7})$-approximation (STOC…
In this paper we give a fully polynomial randomized approximation scheme (FPRAS) for the number of matchings in k-uniform hypergraphs whose intersection graphs contain few claws. Our method gives a generalization of the canonical path…
This article, which is substantially motivated by the previous joint work with J. McKay [8], establishes the analytic analogues of the relations we found free probability has with Witt vectors. Therefore, we first present a novel analytic…
In this note we find optimal one-sided majorants of exponential type for the signum function subject to certain monotonicity conditions. As an application, we use these special functions to obtain a simple Fourier analysis proof of the…
A class of short-range potentials on the line is considered as an asymptotically vanishing phenomenological alternative to the popular confining polynomials. We propose a method which parallels the analytic Hill-Taylor description of…
We study the complexity of Boolean constraint satisfaction problems (CSPs) when the assignment must have Hamming weight in some congruence class modulo M, for various choices of the modulus M. Due to the known classification of tractable…