English
Related papers

Related papers: The Continuous Skolem-Pisot Problem: On the Comple…

200 papers

We consider the robustness of computational hardness of problems whose input is obtained by applying independent random deletions to worst-case instances. For some classical $NP$-hard problems on graphs, such as Coloring, Vertex-Cover, and…

Computational Complexity · Computer Science 2015-08-11 Daniel Reichman , Igor Shinkar

We study the uniqueness question for two inverse problems on graphs. Both problems consist in finding (possibly complex) edge or nodal based quantities from boundary measurements of solutions to the Dirichlet problem associated with a…

Combinatorics · Mathematics 2015-10-13 Justin Boyer , Jack J. Garzella , Fernando Guevara Vasquez

This paper considers the problem of testing whether there exists a solution satisfying certain non-negativity constraints to a linear system of equations. Importantly and in contrast to some prior work, we allow all parameters in the system…

We prove that every weak solution to a certain class of infinitely degenerate quasilinear equations is continuous. An essential feature of the operators we consider is that their Fefferman-Phong associated metric may be non doubling with…

Analysis of PDEs · Mathematics 2014-02-03 Lyudmila Korobenko , Cristian Rios

We prove the #P-hardness of the counting problems associated with various satisfiability, graph and combinatorial problems, when restricted to planar instances. These problems include \begin{romannum} \item[{}] {\sc 3Sat, 1-3Sat, 1-Ex3Sat,…

Computational Complexity · Computer Science 2007-05-23 Harry B. Hunt , Madhav V. Marathe , Venkatesh Radhakrishnan , Richard E. Stearns

We systematically investigate the complexity of model checking the existential positive fragment of first-order logic. In particular, for a set of existential positive sentences, we consider model checking where the sentence is restricted…

Logic in Computer Science · Computer Science 2015-03-20 Hubie Chen

In this paper we study the existence of continuous solutions and their constructions for a second order iterative functional equation, which involves iterate of the unknown function and a nonlinear term. Imposing Lipschitz conditions to…

Classical Analysis and ODEs · Mathematics 2018-03-13 Xiao Tang , Weinian Zhang

In this paper we study the long-standing open question regarding the computational complexity of one of the core problems in supply chains management, the periodic joint replenishment problem. This problem has received a lot of attention…

Computational Complexity · Computer Science 2015-11-10 Tamar Cohen , Liron Yedidsion

Several recently discovered properties of multiple families of special polynomials (some orthogonal and some not) that satisfy certain differential, difference or q-difference equations are reviewed. A general method of construction of…

Mathematical Physics · Physics 2018-08-03 Oksana Bihun

The aim of this paper is investigating the existence of solutions of some semilinear elliptic problems on open bounded domains when the nonlinearity is subcritical and asymptotically linear at infinity and there is a perturbation term which…

Analysis of PDEs · Mathematics 2012-01-06 R. Bartolo , A. M. Candela , A. Salvatore

We study the local behavior of weak solutions, with possible singularities, of nonlocal nonlinear equations. We first prove that sets of capacity zero are removable for weak solutions under certain integrability conditions. We then…

Analysis of PDEs · Mathematics 2025-07-09 Minhyun Kim , Se-Chan Lee

The existence of an unbounded sequence of solutions to a conformally invariant elliptic equation having nonlocal critical-power nonlinearity is established. The primary obstacle to establishing existence of solutions is the failure of…

Analysis of PDEs · Mathematics 2025-09-16 Mona Almutairi , Mathew Gluck

This paper is concerned with H\"older regularity of viscosity solutions of second-order, fully non-linear elliptic integro-differential equations. Our results rely on two key ingredients: first we assume that, at each point of the domain,…

Analysis of PDEs · Mathematics 2010-09-06 Guy Barles , Emmanuel Chasseigne , Cyril Imbert

In a previous paper we considered a class of infinitely degenerate quasilinear equations and derived a priori bounds for high order derivatives of solutions in terms of the Lipschitz norm. We now show that it is possible to obtain bounds…

Analysis of PDEs · Mathematics 2011-03-17 Cristian Rios , Eric Sawyer , Richard Wheeden

A class of two-dimensional systems of second-order ordinary differential equations is identified in which a system requires fewer Lie point symmetries than required to solve it. The procedure distinguishes among those which are…

Classical Analysis and ODEs · Mathematics 2014-11-07 Sajid Ali , Asghar Qadir , Muhammad Safdar

Surface incompressibility, also called inextensibility, imposes a zero-surface-divergence constraint on the velocity of a closed deformable material surface. The well-posedness of the mechanical problem under such constraint depends on an…

Numerical Analysis · Mathematics 2015-07-28 Gustavo C. Buscaglia

In this article, we consider a class of degenerate singular problems. The degeneracy is captured by the presence of a class of $p$-admissible weights, which may vanish or blow up near the origin. Further, the singularity is allowed to vary…

Analysis of PDEs · Mathematics 2023-04-28 Prashanta Garain

Linear differential equations and recurrences reveal many properties about their solutions. Therefore, these equations are well-suited for representing solutions and computing with special functions. We identify a large class of existing…

Symbolic Computation · Computer Science 2026-01-14 Louis Gaillard

We study the quantitative unique continuation property of some higher order elliptic operators. In the case of $P=(-\Delta)^m$, where $m$ is a positive integer, we derive lower bounds of decay at infinity for any nontrivial solutions under…

Analysis of PDEs · Mathematics 2015-05-21 Shanlin Huang , Ming Wang , Quan Zheng

The computational complexity of the partition, 0-1 subset sum, unbounded subset sum, 0-1 knapsack and unbounded knapsack problems and their multiple variants were studied in numerous papers in the past where all the weights and profits were…

Discrete Mathematics · Computer Science 2018-02-27 Dominik Wojtczak