Related papers: Constrained inhomogeneous spherical equations: ave…
Given $n\in N$ and $x,\gamma\in R$, let \begin{equation*} ||\gamma-nx||^\prime=\min\{|\gamma-nx+m|:m\in Z, \gcd (n,m)=1\}, \end{equation*} %where $(n,m)$ is the largest common divisor of $n$ and $m$. Two conjectures in the coprime…
The Promise Constraint Satisfaction Problem (PCSP for short) is a generalization of the well-studied Constraint Satisfaction Problem (CSP). The PCSP has its roots in such classic problems as the Approximate Graph Coloring and the…
In this paper one shows if the number of natural solutions of a general linear equation is limited or not. Also, it is presented a method of solving the Diophantine equation $ax-by=c$ in the set of natural numbers, and an example of solving…
We prove a general theorem providing smoothed analysis estimates for conic condition numbers of problems of numerical analysis. Our probability estimates depend only on geometric invariants of the corresponding sets of ill-posed inputs.…
We study robust convex quadratic programs where the uncertain problem parameters can contain both continuous and integer components. Under the natural boundedness assumption on the uncertainty set, we show that the generic problems are…
We prove that the Diophantine problem for orientable quadratic equations in free metabelian groups is decidable and furthermore, NP-complete. In the case when the number of variables in the equation is bounded, the problem is decidable in…
Let E_n={x_i=1, x_i+x_j=x_k, x_i \cdot x_j=x_k: i,j,k \in {1,...,n}}. There is an algorithm that for every computable function f:N->N returns a positive integer m(f), for which a second algorithm accepts on the input f and any integer…
Recently, W. M. Schmidt and L. Summerer introduced a new theory which allowed them to recover the main known inequalities relating the usual exponents of Diophantine approximation to a point in $\mathbb{R}^n$, and to discover new ones. They…
In this paper we study the obstacle problems for the fractional Lapalcian of order $s\in(0,1)$ in a bounded domain $\Omega\subset\mathbb R^n$, under mild assumptions on the data.
We show that any second order linear ordinary diffrential equation with constant coefficients (including the damped and undumped harmonic oscillator equation) admits an exact discretization, i.e., there exists a difference equation whose…
We prove the global in time existence of spherically symmetric solutions to an initial-boundary value problem for a system of partial differential equations, which consists of the equations of linear elasticity and a nonlinear,…
In this paper, we consider the homogeneous complex k-Hessian equation in $\Omega\backslash\{0\}$. We prove the existence and uniqueness of the $C^{1,\alpha}$ solution by constructing approximating solutions. The key point for us is to…
We investigate the solvability of the Diophantine equation in the title, where $d>1$ is a square-free integer, $p, q$ are distinct odd primes and $x,y,a,b$ are unknown positive integers with $\gcd(x,y)=1$. We describe all the integer…
Unique existence of analytically strong solutions to stochastic partial differential equations (SPDE) with drift given by the subdifferential of a quasi-convex function and with general multiplicative noise is proven. The proof applies a…
We study a class of fractional $p$-Laplacian problems with weights which are possibly singular on the boundary of the domain. We provide existence and multiplicity results as well as characterizations of critical groups and related…
We consider the Dirichlet problem for two types of degenerate elliptic Hessian equations . New results about solvability of the equations in the $C^{1,1}$ space are provided.
The problem of computing differential constraints for a family of evolution PDEs is discussed from a constructive point of view. A new method, based on the existence of generalized characteristics for evolution vector fields, is proposed in…
We establish generalised fractional boundary Hardy-type inequality, in the spirit of Caffarelli-Kohn-Nirenberg inequality for different values of $s$ and $p$ on various domains in $\mathbb{R}^d, ~ d \geq 1$. In particular, for Lipschitz…
An averaging result is proved for stochastic evolution equations with highly oscillating coefficients. This result applies in particular to equations with almost periodic coefficients. The convergence to the solution of the averaged…
A CSP with n variables ranging over a domain of d values can be solved by brute-force in d^n steps (omitting a polynomial factor). With a more careful approach, this trivial upper bound can be improved for certain natural restrictions of…