Related papers: The K-moment problem for continuous linear functio…

This work is the first check of gauge invariance for nonperturbative calculations in light-front QED. To quantize QED in an arbitrary covariant gauge, we use a light-front analog of the equal-time Stueckelberg quantization. Combined with a…

Let $\mathbb F_q$ be the finite field of $q$ elements having characteristic $p$, and denote by $\mathbb K_\infty=\mathbb F_q((1/t))$ the field of formal Laurent series in $1/t$. We consider the equidistribution in $\mathbb T=\mathbb…

A perfect matching in an undirected graph $G=(V,E)$ is a set of vertex disjoint edges from $E$ that include all vertices in $V$. The perfect matching problem is to decide if $G$ has such a matching. Recently Rothvo{\ss} proved the striking…

We prove the wellposedness of scalar wave equations on spatially flat universe as a background with nonminimal coupling with the scalar potential turned on by introducing the $k$-order linear energy and the corresponding energy norm. In the…

Cook's theorem is commonly expressed such as any polynomial time-verifiable problem can be reduced to the SAT problem. The proof of Cook's theorem consists in constructing a propositional formula A(w) to simulate a computation of TM, and…

Due to its intimate relation to Spectral Theory and Schr\"{o}dinger operators, the multivariate moment problem has been a subject of many researches, so far without essential success (if one compares with the one--dimensional case). In the…

Let $\mathbb F_q^d$ be the $d$-dimensional vector space over the finite field $\mathbb F_q$ with $q$ elements. Given $k$ sets $E_j\subset \mathbb F_q^d$ for $j=1,2,\ldots, k$, the generalized $k$-resultant modulus set, denoted by…

Kirchberg's Embedding Problem (KEP) asks whether every separable C$^*$ algebra embeds into an ultrapower of the Cuntz algebra $\mathcal{O}_2$. In this paper, we use model theory to show that this conjecture is equivalent to a local…

In this paper, we prove that nonnegative polyharmonic functions on the upper half space satisfying a conformally invariant nonlinear boundary condition have to be the "\emph{polynomials} plus \emph{bubbles}" form. The nonlinear problem is…

We study the existence of principal eigenvalues and principal eigenfunctions for weighted eigenvalue problems of the form: \begin{equation*} - \mbox{div} ( L (x) |\nabla u|^{p-2} \nabla u ) = \lambda K(x) |u|^{p-2} u \hspace{.1cm} \mbox {…

We treat the following "polynomial moment problem": for a complex polynomial P(z) and distinct complex numbers a,b such that P(a)=P(b) to describe polynomials q(z)=Q'(z) orthogonal to all degrees of P(z) on the segment [a,b]. We show that…

We consider the problem of maximizing a non-negative submodular set function $f:2^N \rightarrow \mathbb{R}_+$ over a ground set $N$ subject to a variety of packing type constraints including (multiple) matroid constraints, knapsack…

Solving high-dimensional partial differential equations (PDEs) is a major challenge in scientific computing. We develop a new numerical method for solving elliptic-type PDEs by adapting the Q-learning algorithm in reinforcement learning.…

In this article we study the K-theory of endomorphisms using noncommutative motives. We start by extending the K-theory of endomorphisms functor from ordinary rings to (stable) infinity categories. We then prove that this extended functor…

We consider the quantum mechanical problem of the motion of a spinless charged relativistic particle with mass$M$, described by the Klein-Fock-Gordon equation with equal scalar $S(\vec{r})$ and vector $V(\vec{r})$ Coulomb plus ring-shaped…

Let $R$ be a finite commutative ring with $1\ne 0$. The set $\mathcal{F}(R)$ of polynomial functions on $R$ is a finite commutative ring with pointwise operations. Its group of units $\mathcal{F}(R)^\times$ is just the set of all…

We prove some results on when functions on compact sets $K \subset \mathbb C$ can be approximated by polynomials avoiding values in given sets. We also prove some higher dimensional analogues. In particular we prove that a continuous…

Dealing with NP-hard problems, kernelization is a fundamental notion for polynomial-time data reduction with performance guarantees: in polynomial time, a problem instance is reduced to an equivalent instance with size upper-bounded by a…

Given a k-uniform hypergraph on n vertices, partitioned in k equal parts such that every hyperedge includes one vertex from each part, the k-dimensional matching problem asks whether there is a disjoint collection of the hyperedges which…

We propose that the LP-Newton method can be used to solve conic LPs over a conic box, whenever linear optimization over an otherwise unconstrained conic box is easy. In particular, if $\leq_\mathcal{K}$ is the partial order induced by a…