Related papers: Approximating Holant problems by winding
We consider hierarchical variational inequality problems, or more generally, variational inequalities defined over the set of zeros of a monotone operator. This framework includes convex optimization over equilibrium constraints and…
Horn-satisfiability or Horn-SAT is the problem of deciding whether a satisfying assignment exists for a Horn formula, a conjunction of clauses each with at most one positive literal (also known as Horn clauses). It is a well-known…
We develop a new approach to recurrence and the existence of non-constant harmonic functions on infinite weighted graphs. The approach is based on the capacity of subsets of metric boundaries with respect to intrinsic metrics. The main tool…
We study the approximation complexity of the partition function of the eight-vertex model on general 4-regular graphs. For the first time, we relate the approximability of the eight-vertex model to the complexity of approximately counting…
The POPLMARK Challenge comprises a set of problems intended to measure the strength of reasoning systems in the realm of mechanizing programming language meta-theory at the time the challenge was enunciated. Included in the collection is…
The two-dimensional transient problem that is studied concerns a semi-infinite crack in an isotropic solid comprising an infinite strip and a half-plane joined together and having the same elastic constants. The crack propagates along the…
We study the structure of the solution space and behavior of local search methods on random 3-SAT problems close to the SAT/UNSAT transition. Using the overlap measure of similarity between different solutions found on the same problem…
This paper addresses synthesizing receding-horizon controllers for nonlinear, control-affine dynamical systems under multiple incompatible hard and soft constraints. Handling incompatibility of constraints has mostly been addressed in…
In engineering practice one often encounters planar problems, where the corresponding vector space of forces, velocities or (infinitesimal) displacements is three dimensional. This paper shows how these spaces can be factorized, such that…
We consider the problem of smoothing algebraic cycles with rational coefficients on smooth projective complex varieties up to homological equivalence. We show that a solution to this problem would be incompatible with the validity of the…
Using Green$'$s function and operator techniques we give a closed expression for the response of a non-relativistic system interacting through confining, harmonic forces. The expression for the incoherent part permits rapid evaluation of…
A method is described to count simple diagonal walks on $\mathbb{Z}^2$ with a fixed starting point and endpoint on one of the axes and a fixed winding angle around the origin. The method involves the decomposition of such walks into smaller…
This article is dedicated to solving the Einstein constraint equations with apparent horizon boundaries and freely specified mean curvature. The main novelty is that we study the conformal constraint equations assuming only low regularity.
A new description of the universal Whitham hierarchy in terms of a factorization problem in the Lie group of canonical transformations is provided. This scheme allows us to give a natural description of dressing transformations, string…
We exhibit a non-varying phenomenon for the counting problem of cylinders, weighted by their area, passing through two marked (regular) Weierstrass points of a translation surface in a hyperelliptic connected component…
We present a modified Front Tracking (mFT) scheme for hyperbolic systems of conservation laws in one space dimension, in which we allow arbitrarily large nonlinear waves. We build the scheme by introducing and solving a ``generalized…
Given a countable transitive model of set theory and a partial order contained in it, there is a natural countable Borel equivalence relation on generic filters over the model; two are equivalent if they yield the same generic extension. We…
We study a colourful generalization of the linear programming feasibility problem, comparing the algorithms introduced by Barany and Onn with new methods. We perform benchmarking on generic and ill-conditioned problems, as well as as…
The need for analytic continuation arises frequently in the context of inverse problems. Notwithstanding the uniqueness theorems, such problems are notoriously ill-posed without additional regularizing constraints. We consider several…
We prove existence of weak solutions to the obstacle problem for semilinear wave equations (including the fractional case) by using a suitable approximating scheme in the spirit of minimizing movements. This extends the results in [9],…