Related papers: The interpolant existence problem for weak K4 and …
We investigate the following question: if a polynomial can be evaluated at rational points by a polynomial-time boolean algorithm, does it have a polynomial-size arithmetic circuit? We argue that this question is certainly difficult.…
We consider the classical problems of interpolating a polynomial given a black box for evaluation, and of multiplying two polynomials, in the setting where the bit-lengths of the coefficients may vary widely, so-called unbalanced…
Multilinear interpolation is a powerful tool used in obtaining strong type boundedness for a variety of operators assuming only a finite set of restricted weak-type estimates. A typical situation occurs when one knows that a multilinear…
The permanent versus determinant conjecture is a major problem in complexity theory that is equivalent to the separation of the complexity classes VP_{ws} and VNP. Mulmuley and Sohoni (SIAM J. Comput., 2001) suggested to study a…
In this paper, we study the complexity of the chip-firing reachability problem. We show that for Eulerian digraphs, the reachability problem can be decided in strongly polynomial time, even if the digraph has multiple edges. We also show a…
In this article we study the existence of solutions to a fourth-order nonlinear PDE related to crystal surface growth. The key difficulty in the equations comes from the mobility matrix, which depends on the gradient of the solution. When…
Dynamic logic is a powerful approach to reasoning about programs and their executions, obtained by extending classical logic with modalities that can express program executions as formulas. However, the use of dynamic logic in the setting…
We consider the computational versions of the Erd\H os-Szekeres theorem and related problems in 3 dimensions. We show that, in constrast to the planar case, no polynomial time algorithm exists for determining the largest (empty) convex…
We provide the first (non-labelled) sequent calculi for bimodal provability logics with "usual" provability predicates. In particular, we introduce calculi for the logics CS, CSM and ER. Additionally, we present non-wellfounded versions of…
In this paper we consider the critical exponent problem for the semilinear damped wave equation with time-dependent coefficients. We treat the scale invariant cases. In this case the asymptotic behavior of the solution is very delicate and…
We show that the problem to decide whether two (convex) polytopes, given by their vertex-facet incidences, are combinatorially isomorphic is graph isomorphism complete, even for simple or simplicial polytopes. On the other hand, we give a…
We present a variation of Maehara's method to construct Craig-Lyndon interpolants for the three-valued propositional logic of here and there (HT), also known as G\"odel's $G_3$, a superintuitionistic logic of importance in logic…
The aim of this paper is investigating the existence and multiplicity of weak solutions to non--local equations involving the {\em magnetic fractional Laplacian}, when the nonlinearity is subcritical and asymptotically linear at infinity.…
We are concerned with the question of well-posedness of stochastic three dimensional incompressible Euler equations. In particular, we introduce a novel class of dissipative solutions and show that (i) existence; (ii) weak--strong…
We prove a complexity dichotomy theorem for a class of Holant problems on 3-regular bipartite graphs. Given an arbitrary nonnegative weighted symmetric constraint function $f = [x_0, x_1, x_2, x_3]$, we prove that the bipartite Holant…
A graph $G$ is said to be an $(s, k)$-polar graph if its vertex set admits a partition $(A, B)$ such that $A$ and $B$ induce, respectively, a complete $s$-partite graph and the disjoint union of at most $k$ complete graphs. Polar graphs and…
In this paper, we first establish a criterion based on contractive function for the existence of polynomial attractors. This criterion only involves some rather weak compactness associated with the repeated limit inferior and requires no…
We prove the global-in-time existence of nonnegative weak solutions to a class of fourth order partial differential equations on a convex bounded domain in arbitrary spatial dimensions. Our proof relies on the formal gradient flow structure…
We show that a global holomorphic section of $\mathscr{O}(d)$ restricted to a closed complex subspace $X \subset \mathbb{P}^n$ has an interpolant if and only if it satisfies a set of moment conditions that involves a residue current…
We discuss a weak constraint qualification for conic linear programs and its applications for a few classes of cones. This constraint qualification is used to give a solution to a problem proposed by Shapiro and Z\v{a}linescu and show that…