Related papers: Effective Kohn Algorithm for Special Domain Define…
We consider a smooth boundary b\Omega which is q-convex in the sense that its Levi-form has positive trace on every complex q-plane. We prove that b\Omega is tangent of infinite order to the complexification of each of its submanifolds…
Efficient algorithms for many problems in optimization and computational algebra often arise from casting them as systems of polynomial equations. Blum, Shub, and Smale formalized this as Hilbert's Nullstellensatz Problem $HN_R$: given…
Fractional Klein-Kramers equation can well describe subdiffusion in phase space. In this paper, we develop the fully discrete scheme for fractional Klein-Kramers equation based on the backward Euler convolution quadrature and local…
This study presents a novel algorithm for identifying the set of extreme points that constitute the exact convex hull of a point set in high-dimensional Euclidean space. The proposed method iteratively solves a sequence of dynamically…
In this paper, we prove the existence of a classical solution to a Neumann boundary problem for Hessian equations in uniformly convex domain. The methods depend upon the established of a priori derivative estimates up to second order. So we…
A numerical scheme is presented for solving the Helmholtz equation with Dirichlet or Neumann boundary conditions on piecewise smooth open curves, where the curves may have corners and multiple junctions. Existing integral equation methods…
We reduce the problem of proving deterministic and nondeterministic Boolean circuit size lower bounds to the analysis of certain two-dimensional combinatorial cover problems. This is obtained by combining results of Razborov (1989),…
We study a basic algorithmic problem in algebraic geometry, which we call NNL, of constructing a normalizing map as per Noether's Normalization Lemma. For general explicit varieties, as formally defined in this paper, we give a randomized…
We present algorithms to solve coupled systems of linear differential equations, arising in the calculation of massive Feynman diagrams with local operator insertions at 3-loop order, which do {\it not} request special choices of bases.…
The problem of finding a nontrivial factor of a polynomial f(x) over a finite field F_q has many known efficient, but randomized, algorithms. The deterministic complexity of this problem is a famous open question even assuming the…
We introduce the Hidden Polynomial Function Graph Problem as a natural generalization of an abelian Hidden Subgroup Problem (HSP) where the subgroups and their cosets correspond to graphs of linear functions over the finite field F_p. For…
We use the averaged variational principle introduced in a recent article on graph spectra [7] to obtain upper bounds for sums of eigenvalues of several partial differential operators of interest in geometric analysis, which are analogues of…
In this paper, we revisit the nonoverlapping domain decomposition methods for solving elliptic problems with high contrast coefficients. Some interesting results are discovered. We find that the Dirichlet-Neumann algorithm and Robin-Robin…
We prove lower bounds of order $n\log n$ for both the problem to multiply polynomials of degree $n$, and to divide polynomials with remainder, in the model of bounded coefficient arithmetic circuits over the complex numbers. These lower…
We give relatively simple sufficient conditions on a Fourier multiplier, so that it maps functions with the H$\ddot{o}$lder property with respect to a part of the variables to functions with the H$o$lder property with respect to all…
Extreme learning machines (ELMs), which preset hidden layer parameters and solve for last layer coefficients via a least squares method, can typically solve partial differential equations faster and more accurately than Physics Informed…
With view to applications, we establish a correspondence between two problems: (i) the problem of finding continuous positive definite extensions of functions $F$ which are defined on open bounded domains $\Omega$ in $\mathbb{R}$, on the…
Our main goal is to describe the integral kernel of the dbar-Neumann operator on certain non-smooth domains, the so-called Henkin-Leiterer domains. We do so by explicitly constructing an integral kernel which accounts for the main mapping…
Consider the following generalized hidden shift problem: given a function f on {0,...,M-1} x Z_N satisfying f(b,x)=f(b+1,x+s) for b=0,1,...,M-2, find the unknown shift s in Z_N. For M=N, this problem is an instance of the abelian hidden…
Koopman analysis of a general dynamics system provides a linear Koopman operator and an embedded eigenfunction space, enabling the application of standard techniques from linear analysis. However, in practice, deriving exact operators and…