Related papers: Computational complexity of the avalanche problem …
Quantifying the universality of avalanche observables beyond critical exponents is of current great interest in theory and experiments. Here, we improve the characterization of the spatio-temporal process inside avalanches in the…
We study a directed stochastic sandpile model of Self-Organized Criticality, which exhibits recurrent, multiple topplings, putting it in a separate universality class from the exactly solved model of Dhar and Ramaswamy. We show that in the…
We study complex Monge-Ampere equations on Hermitian manifolds, extending classical existence results of Yau and Aubin in the Kahler case, and those of Caffarelli, Kohn, Nirenberg and Spruck for the Dirichlet problem in $C^n$. As an…
We numerically study avalanches in the two dimensional Abelian sandpile model in terms of a sequence of waves of toppling events. Priezzhev et al [PRL 76, 2093 (1996)] have recently proposed exact results for the critical exponents in this…
This article is based on a talk given by one of us (EVI) at the conference ``StatPhys-Taipei-1997''. It overviews the exact results in the theory of the sandpile model and discusses shortly yet unsolved problem of calculation of avalanche…
Tiling planar regions with dominoes is a classical problem in which the decision and counting problems are polynomial. We prove a variety of hardness results (both NP- and #P-completeness) for different generalizations of dominoes in three…
In 1977 P.Yang asked whether there exist complete immersed complex submanifolds g : M^k --> C^N with bounded image. A positive answer is known for holomorphic curves (k=1) and partial answers are known for the case when k>1. The principal…
We show that the problem of deciding whether the vertex set of a graph can be covered with at most two bicliques is in NP$\cap$coNP. We thus almost determine the computational complexity of a problem whose status has remained open for quite…
We revisit the problem of one-dimensional Anderson localization, by providing perturbative expression for Lyapunov exponent of Anderson model with next-nearest-neighbor (nnn) hopping. By comparison with exact numerical results, we discuss…
It is well-known that the Vertex Cover problem is in P on bipartite graphs, however; the computational complexity of the Partial Vertex Cover problem on bipartite graphs is open. In this paper, we first show that the Partial Vertex Cover…
The average avalanche size can be calculated exactly in a number of models of self-organised criticality (SOC). While the calculation is straight-forward in one dimension, it is more involved in higher dimensions and further complicated by…
Exhibiting a deep connection between purely geometric problems and real algebra, the complexity class $\exists \mathbb{R}$ plays a crucial role in the study of geometric problems. Sometimes $\exists \mathbb{R}$ is referred to as the 'real…
We prove that the problem of determination of factor gauge groups given the rank of the gauge group at any given vacuum in the Landscape is in the computational complexity class NPC. This extends a result of Denef and Douglas on the…
Deciding whether a graph can be embedded in a grid using only unit-length edges is NP-complete, even when restricted to binary trees. However, it is not difficult to devise a number of graph classes for which the problem is polynomial, even…
We consider one-dimensional Calder\'on's problem for the variable exponent $p(\cdot)$-Laplace equation and find out that more can be seen than in the constant exponent case. The problem is to recover an unknown weight (conductivity) in the…
We study sandpile models with stochastic toppling rules and having sticky grains so that with a non-zero probability no toppling occurs, even if the local height of pile exceeds the threshold value. Dissipation is introduced by adding a…
We study distributions of dissipative and nondissipative avalanches in Manna's stochastic sandpile, in one and two dimensions. Our results lead to the following conclusions: (1) avalanche distributions, in general, do not follow simple…
Using the transfer matrix method, we give the exact solution of a deterministic sandpile model for arbitrary $N$, where $N$ is the size of a single toppling. The one- and two-point functions are given in term of the eigenvalues of an $N…
The avalanche statistics in a stochastic sandpile model where toppling takes place with a probability p is investigated. The limiting case p=1 corresponds to the Bak-Tang-Wiesenfeld (BTW) model with deterministic toppling rule. Based on the…
We close three open problems in the separation complexity of valid inequalities for the knapsack polytope. Specifically, we establish that the separation problems for extended cover inequalities, (1,k)-configuration inequalities, and weight…