Related papers: On the logarithmic energy of solutions to the poly…
In this paper, we prove the global existence and uniqueness of the solution of the stochastic logarithmic Schr\"odinger (SlogS) equation driven by additive noise or multiplicative noise. The key ingredient lies on the regularized stochastic…
Let f be a degree D univariate polynomial with real coefficients and exactly m monomial terms. We show that in the special case m=3 we can approximate within eps all the roots of f in the interval [0,R] using just O(log(D)log(Dlog(R/eps)))…
We discuss a method based on a segmentary approximation of solutions of the Schr\"odinger by quadratic splines, for which the coefficients are determined by a variational method that does not require the resolution of complicated algebraic…
Considering the difficult problem under classical computing model can be solved by the quantum algorithm in polynomial time, t-multiple discrete logarithm problems presented. The problem is non-degeneracy and unique solution. We talk about…
We show that efficient norm-conserving pseudopotentials for electronic structure calculations can be obtained from a polynomial Ansatz for the potential. Our pseudopotential is a polynomial of degree ten in the radial variable and fulfills…
We use symbolic expressions for traces of positive integer powers of a Hermitian operator (or, equivalently, coefficients of corresponding characteristic polynomial) to find solutions for the problems as follows: Factorization of…
Explicit solution of an infinite horizon optimal stopping problem for a Levy processes with a polynomial reward function is given, in terms of the overall supremum of the process, when the solution of the problem is one-sided. The results…
In this note, we present an algorithm that yields many new methods for constructing doubly stochastic and symmetric doubly stochastic matrices for the inverse eigenvalue problem. In addition, we introduce new open problems in this area that…
Electric vehicles with multiple motors provide a flexibility in meeting the driver torque demand, which calls for minimizing the battery energy consumption through torque allocation. In this paper, we present an approach to this problem…
We study the high-energy behavior of the scattering amplitudes in quantum electrodynamics beyond the leading order of the small electron mass expansion in the leading logarithmic approximation. In contrast to the Sudakov logarithms, the…
We complete the complexity classification by degree of minimizing a polynomial over the integer points in a polyhedron in $\mathbb{R}^2$. Previous work shows that optimizing a quadratic polynomial over the integer points in a polyhedral…
Approximating ground and a fixed number of excited state energies, or equivalently low order Hamiltonian eigenvalues, is an important but computationally hard problem. Typically, the cost of classical deterministic algorithms grows…
We revisit the Cauchy problem for the logarithmic Schr\"odinger equation and construct strong solutions in $H^1$, the energy space, and the $H^2$-energy space. The solutions are provided in a constructive way, which does not rely on…
The logarithmic nonlinearity has been used in many partial differential equations (PDEs) for modeling problems in various applications.Due to the singularity of the logarithmic function, it introducestremendous difficulties in establishing…
Energy problems are important in the formal analysis of embedded or autonomous systems. Using recent results on star-continuous Kleene omega-algebras, we show here that energy problems can be solved by algebraic manipulations on the…
How can we understand the origins of highly symmetrical objects? One way is to characterize them as the solutions of natural optimization problems from discrete geometry or physics. In this paper, we explore how to prove that exceptional…
We show that the one-parameter family of special solutions of P$_\mathrm{II}$, the second Painlev\'e equation, constructed from the Airy functions, as well as associated solutions of P$_\mathrm{XXXIV}$ and S$_\mathrm{II}$, can be expressed…
We present polylogarithmic approximation algorithms for variants of the Shortest Path, Group Steiner Tree, and Group ATSP problems with vector costs. In these problems, each edge e has a non-negative vector cost $c_e \in…
This paper studies the hierarchy of local minimums of a polynomial in the space. For this purpose, we first compute H-minimums, for which the first and second order optimality conditions are satisfied. To compute each H-minimum, we…
The standard approach for finding eigenvalues and eigenvectors of matrix polynomials starts by embedding the coefficients of the polynomial into a matrix pencil, known as linearization. Building on the pioneering work of Nakatsukasa and…