For some deterministic nonlinear PDEs on the torus whose solutions may blow up in finite time, we show that, under suitable conditions term, blow-up is delayed by multiplicative noise of transport type a certain scaling limit. The main result applied to 3D Keller–Segel, Fisher–KPP, and 2D Kuramoto–Sivashinsky equations, yielding long-time existence for large initial data with high probability.

In this paper, we study the solution of an initial boundary value problem for a quasilinear parabolic equation with a nonlinear boundary condition. We first show that any positive solution blows up in finite time. For a monotone solution, we have either the single blow-up point on the boundary, or blow-up on the whole domain, depending on the parameter range. Then, in the single blow-up point c...

We prove a localized non blow-up theorem of the Beale–Kato–Majda type for solution 3D incompressible Euler equations.

In the orbifold limit of K3, one can give exact conformal field theory description of D-branes wrapped on certain non-supersymmetric cycles of K3. We study the effect of switching on the ‘non-geometric blow up modes’ corresponding to anti-symmetric tensor gauge field flux through the 2-cycles on these D-branes. Working to first order in the blow up parameter, we determine the region of the modu...

There are many nonlinear parabolic equations whose solutions develop singularity in finite time, say T. In many cases, a certain norm of the solution tends to infinity as time t approaches T. Such a phenomenon is called blow-up, and T is called the blow-up time. This paper is concerned with approximation of blow-up phenomena in nonlinear parabolic equations. For numerical computations or for ot...

The blow-up of a graph is obtained by replacing every vertex with a finite collection of copies so that the copies of two vertices are adjacent if and only if the originals are. If every vertex is replaced with the same number of copies, then the resulting graph is called a balanced blow-up. We show that any graph which contains the maximum number of induced copies of a sufficiently large balan...

Deterministic two-way transducers define the robust class of regular functions which is, among other good properties, closed under composition. However, the best known algorithms for composing two-way transducers cause a double exponential blow-up in the size of the inputs. In this paper, we introduce a class of transducers for which the composition has polynomial complexity. It is the class of...