相关论文: Blowing up Stringy Canonical Forms: An Algorithm t…

We exhibit a class of classical or tropical posynomial systems which can be solved by reduction to linear or convex programming problems. This relies on a notion of colorful vectors with respect to a collection of Newton polytopes. This…

In their work on a sharp compactness theorem for the Yamabe problem, Khuri, Marques and Schoen apply a refined blow-up analysis (what we call `second order blow-up argument' in this article) to obtain highly accurate approximate solutions…

We introduce a high-level language with Python-like syntax for string-to-string, polyregular, first-order definable transductions. This language features function calls, boolean variables, and nested for-loops. We devise and implement a…

In this paper we propose a method that uses Lagrange multipliers and numerical algebraic geometry to find all critical points, and therefore globally solve, polynomial optimization problems. We design a polyhedral homotopy algorithm that…

The idea in the title is to blow up a finite structure, replacing each 'colour or atom' by infinitely many, using blurs to represent the resulting term algebra, but the blurs are not enough to blur the structure of the finite structure in…

The scalar wave equation is solved using higher order immersed finite elements. We demonstrate that higher order convergence can be obtained. Small cuts with the background mesh are stabilized by adding penalty terms to the weak…

We concider, the blow-up solutions for a coupled reaction diffusion system with gradient terms. The main purpose is to understand whether the gradient terms effect the blow-up properties. We derive the upper and lower blow-up rate estimates…

Whereas set-valued tableaux are the combinatorial objects associated to stable Grothendieck polynomials, hook-valued tableaux are associated to stable canonical Grothendieck polynomials. In this paper, we define a novel uncrowding algorithm…

The canonical partition function of a system of rotators (classical X-Y spins) on a lattice, coupled by terms decaying as the inverse of their distance to the power alpha, is analytically computed. It is also shown how to compute a…

In this short paper, we are concerned with the blowup phenomenon of stochastic parabolic equations. By using comparison principle and the results of deterministic parabolic equations, we obtain blowup results of solutions for stochastic…

In this work, we examine a generic class of simple distributed balls-into-bins algorithms. Exploiting the strong concentration bounds that apply to balls-into-bins games, we provide an iterative method to compute accurate estimates of the…

We describe an algorithm for computing the inner product between a holomorphic modular form and a unary theta function, in order to determine whether the form is orthogonal to unary theta functions without needing a basis of the entire…

This expository note describes McGehee blow-up \cite{McGehee} in its role as one of the main tools in my recent proof with Rick Moeckel \cite{RM2} that every free homotopy class for the planar three-body problem can be realized by a…

Based on known methods for computing the number of distinct score sequences for $n$-vertex tournaments, we develop algorithms for computing the number of distinct score sequences for self-complementary tournaments, strong tournaments, and…

It is a big problem to distinguish between integrable and non-integrable Hamiltonian systems. We provide a new approach to prove the non-integrability of homogeneous Hamiltonian systems with two degrees of freedom. The homogeneous degree…

An approach to evolutionary ensemble learning for classification is proposed in which boosting is used to construct a stack of programs. Each application of boosting identifies a single champion and a residual dataset, i.e. the training…

In this paper, the author proposes a numerical method to solve a parabolic system of two quasilinear equations of nonlinear heat conduction with sources. The solution of this system may blow up in finite time. It is proved that the…

A fast algorithm to study one-dimensional self-gravitating systems, and, more generally, systems that are Lagrangian integrable between collisions, is presented. The algorithm is event-driven, and uses a heap-ordered set of predicted future…

We prove a blow-up formula for the generating series of virtual $\chi_y$-genera for moduli spaces of sheaves on projective surfaces, which is related to a conjectured formula for topological $\chi_y$-genera of G\"ottsche. Our formula is a…

We have proposed new algorithms for the numerical integration of the equations of motion for classical spin systems. In close analogy to symplectic integrators for Hamiltonian equations of motion used in Molecular Dynamics these algorithms…