Related papers: Computational complexity of the avalanche problem …
In arXiv:1711.10132 a new approximating invariant ${\mathsf{TC}}^{\mathcal{D}}$ for topological complexity was introduced called $\mathcal{D}$-topological complexity. In this paper, we explore more fully the properties of…
This paper first analyzes the resolution complexity of two random CSP models (i.e. Model RB/RD) for which we can establish the existence of phase transitions and identify the threshold points exactly. By encoding CSPs into CNF formulas, it…
We perform extensive simulations of the sandpile model on a Sierpinski gasket. Critical exponents for waves and avalanches are determined. We extend the existing theory of waves to the present case. This leads to an exact value for the…
Computational complexity is examined using the principle of increasing entropy. To consider computation as a physical process from an initial instance to the final acceptance is motivated because many natural processes have been recognized…
The airplane refueling problem is a nonlinear combinatorial optimization problem, and its equivalent problem the $n$-vehicle exploration problem is proved to be NP-complete (arXiv:2304.03965v1, The $n$-vehicle exploration problem is…
In this paper we extend the works of Tancer and of Malgouyres and Franc\'es, showing that $(d,k)$-collapsibility is NP-complete for $d\geq k+2$ except $(2,0)$. By $(d,k)$-collapsibility we mean the following problem: determine whether a…
We analyze the statistics of gaps ($\Delta H$) between successive avalanches in one dimensional random field Ising models (RFIMs) in an external field $H$ at zero temperature. In the first part of the paper we study the nearest-neighbour…
In this study, we investigate the computational complexity of some variants of generalized puzzles. We are provided with two sets S_1 and S_2 of polyominoes. The first puzzle asks us to form the same shape using polyominoes in S_1 and S_2.…
We study the Lusternik-Schnirelmann category and topological complexity of 1-dimensional spaces. We define both invariants as lengths of suitable closed filtrations, as opposed to a more common definition based on open covers. Our main…
A recent letter titled "Explicit Analytical Solution for Random Close Packing in d=2 and d=3" published in Physical Review Letters proposes a first-principle computation of the random close packing (RCP) density in spatial dimensions d=2…
In this paper, we study the Cauchy problem for a generalized integrable Camassa-Holm equation with both quadratic and cubic nonlinearity. By overcoming the difficulties caused by the complicated mixed nonlinear structure, we firstly…
We prove that if $P$ is a set of $n$ points in $\mathbb{C}^2$, then either the points in $P$ determine $\Omega(n^{1-\epsilon})$ complex distances, or $P$ is contained in a line with slope $\pm i$. If the latter occurs then each pair of…
We give a complexity dichotomy theorem for the counting Constraint Satisfaction Problem (#CSP in short) with complex weights. To this end, we give three conditions for its tractability. Let F be any finite set of complex-valued functions,…
This paper addresses the existence of codimension one stable manifolds for the pseudo-conformal blow-up solution for critical one-dimensional NLS. By the work of Perelman and Merle, Raphael, the blow-up rate of these solutions is far from…
We study the so-called dynamic coverage problem by agents located in some topological graph. The agents must visit all regions of interest but they also should stay connected to the base via multi-hop. We prove that the algorithmic…
We introduce Nevanlinna--Pick norms associated with finite families of characters in a commutative semisimple Banach algebra and study the class $NP_\infty$, where all such norms are minimal. Our main result is a topological rigidity…
We initiate a general study of what we call orientation completion problems. For a fixed class C of oriented graphs, the orientation completion problem asks whether a given partially oriented graph P can be completed to an oriented graph in…
It is consistent that the continuum be arbitrary large and no absolute $\kappa$-Borel set $X$ of density $\kappa$, $\aleph_1<\kappa<\mathfrak{c}$, condenses onto a compact metric space. It is consistent that the continuum be arbitrary large…
In this paper, we consider the Cauchy problem for the generalized Camassa-Holm equation that includes the Camassa-Holm as well as the Novikov equation on the line. We present a new and unified method to prove the sharp ill-posedness for the…
This article provide new approach to solve P vs NP problem by using cardinality of bases function. About NP-Complete problems, we can divide to infinite disjunction of P-Complete problems. These P-Complete problems are independent of each…