Related papers: Generalized low solution of $\mathsf{RT}_k^1$ prob…
We consider the IVP associated to the generalized KdV equation with low degree of non-linearity \begin{equation*} \partial_t u + \partial_x^3 u \pm |u|^{\alpha}\partial_x u = 0,\; x,t \in \mathbb{R},\;\alpha \in (0,1). \end{equation*} By…
A coarse description of a subset A of omega is a subset D of omega such that the symmetric difference of A and D has asymptotic density 0. We study the extent to which noncomputable information can be effectively recovered from all coarse…
For a complex number $x$, $\Vert x\Vert:=\min\{|x-m|:m\in\mathbb{Z}\}$. Let $k\geq 1$ be an integer, and $K$ be a number field. Let $\alpha_1,\ldots,\alpha_k$ be algebraic numbers with $|\alpha_i|\geq 1$ and let $d_i$ denotes the degree of…
We present a notion of forcing that can be used, in conjunction with other results, to show that there is a Martin-L\"of random set X such that X does not compute 0' and X computes every K-trivial set.
In the present paper, we study the existence of normalized solutions to the following Kirchhoff type equations \begin{equation*} -\left(a+b\int_{\R^3}|\nabla u|^2\right)\Delta u+V(x)u+\lambda u=g(u)~\hbox{in}~\R^3 \end{equation*} satisfying…
We present a generalization of Lie's method for finding the group invariant solutions to a system of partial differential equations. Our generalization relaxes the standard transversality assumption and encompasses the common situation…
As one of the seven open problems in the addendum to their 1989 book "Computability in Analysis and Physics", Pour-El and Richards proposed ``... the recursion theoretic study of particular nonlinear problems of classical importance.…
In this paper we propose two new generic attacks on the Rank Syndrome Decoding (RSD) problem Let $C$ be a random $[n,k]$ rank code over $GF(q^m)$ and let $y=x+e$ be a received word such that $x \in C$ and the $Rank(e)=r$. The first attack…
In this paper, the existence and multiplicity of nontrivial radial convex solutions to general coupled system of $k_i$-Hessian equations in a unit ball are studied via a fixed-point theorem. In particular, we obtain the uniqueness of…
Conventional reinforcement learning (RL) algorithms exhibit broad generality in their theoretical formulation and high performance on several challenging domains when combined with powerful function approximation. However, developing RL…
Given a single observation from a Gaussian distribution with unknown mean $\theta$, we design computationally efficient procedures that can approximately generate an observation from a different target distribution $Q_{\theta}$ uniformly…
We present and analyze a natural hierarchy of weak theories, develop analysis in them, and show that they are interpretable in bounded quantifier arithmetic $\text{I}\Delta_0$ (and hence in Robinson arithmetic Q). The strongest theories…
The concept of Generalized Inverse based Decoding (GID) is introduced, as an algebraic framework for the syndrome decoding problem (SDP) and low weight codeword problem (LWP). The framework has ground on two characterizations by generalized…
We consider the class of counting problems,i.e. functions in $\#$P, which are self reducible, and have easy decision version, i.e. for every input it is easy to decide if the value of the function $f(x)$ is zero. For example,…
Every K-trivial set is computable from an incomplete Martin-L\"of random set, i.e., a Martin-L\"of random set that does not compute 0'.
We illustrate the strength of Algebraic Methods, adapting Gaussian Elimination and Substitution to the problem of Exact Boolean Satisfiability. For 1-in-3 SAT with non-negated literals we are able to obtain considerably smaller equivalent…
The inverse problem for representation functions takes as input a triple (X,f,L), where X is a countable semigroup, f : X --> N_0 \cup {\infty} a function, L : a_1 x_1 + ... + a_h x_h an X-linear form and asks for a subset A \subseteq X…
We show that any Leray-Hopf weak solution to 3D Navier-Stokes equations with initial values u0 2 H1=2(R3) belong to L1(0; 1; H1=2(R3)) and thus it is regular. For the proof, flrst, we construct a supercritical space, the norm of which is…
In the study of random access machines (RAMs) it has been shown that the availability of an extra input integer, having no special properties other than being sufficiently large, is enough to reduce the computational complexity of some…
We study multidimensional configurations (infinite words) and subshifts of low pattern complexity using tools of algebraic geometry. We express the configuration as a multivariate formal power series over integers and investigate the setup…