Related papers: Solvability of equations in elementary functions

We prove boundedness and regularity estimates for weak solutions to a class of linear nonlocal equations involving integro-differential operators with almost no order of differentiability. In particular, we show that bounded weak solutions…

We prove the existence of non-decaying real solutions of the Johnson equation, vanishing as $x\to+\infty$. We obtain asymptotic formulas as $t\to\infty$ for the solutions in the form of an infinite series of asymptotic solitons with curved…

Our aim is to show that it is impossible to find a bound for the power of the first fixed point of the aleph function.

We establish an explicit formula for the general solution of the Benjamin-Ono equation on the torus and on the line. Contents 1. Introduction 1 1.1. The Benjamin-Ono equation 1 1.2. The Lax pair 2 1.3. The explicit formula on the torus 3…

We prove the existence of non-smooth solutions to fully nonlinear uniformly elliptic equations.

We prove that the set of points where a subharmonic function fails to be continuous is polar.

We present a new approach to solving polynomial ordinary differential equations by transforming them to linear functional equations and then solving the linear functional equations. We will focus most of our attention upon the first-order…

We derive the infinite product of the tangent function expressed in terms of trigonometric expressions such as Eulers Sinc function and Vietes formula, along with their generalizations. All the results presented in this work are novel.

We prove local unique solvability of the wave equation for a large class of weakly singular, locally bounded space-time metrics in a suitable space of generalised functions.

We construct time almost-periodic solutions (global in time) with finite regularity to the incompressible Euler equations on the torus $\T^d$, with $d=3$ and $d\in\N$ even.

This somewhat unusual proof for the fact that the reals are uncountable, which is adapted from one of Bourbaki's proofs in "Fonctions d'une variable reelle", may be of some interest.

This paper examines the application of Tarski's Undefinability Theorem to first-order arithmetic. The generally accepted view is that for this case the Theorem establishes that arithmetic truth is not arithmetic. A careful examination of…

Several older and more recent results on the boundaries of solvability and unsolvability in tag systems are surveyed. Emphasis will be put on the significance of computer experiments in research on very small tag systems.

We prove a mean value formula for weak solutions of $div(|y|^{a}\grad u)=0$ in $\mathbb{R}^{n+1}=\{(x,y): x\in\mathbb{R}^{n}, y\in\mathbb{R}\}$, $-1<a<1$ and balls centered at points of the form $(x,0)$. We obtain an explicit nonlocal…

We prove a.s. (almost sure) unisolvency of interpolation by continuous random sampling with respect to any given density, in spaces of multivariate a.e. (almost everywhere) analytic functions. Examples are given concerning polynomial and…

We study the regularity of solutions of functional equations of a generalized mean value type. In this paper we give sufficient conditions for the regularity by using hypoellipticity which is a concept of the theory of partial differential…

We prove a uniqueness theorem for a large class of functional equations in the plane, which resembles in form a classical result of Aczel. It is also shown that functional equations in this class are overdetermined in the sense of Paneah.…

We give a new simple proof of Dehn's theorem by generalizing the notion of area. The method proposed in the present article is actually the "translation" of the method of additive functions into the elementary math language.

We establish the solvability criteria for the equation $x^q=a$ in the field of $p$-adic numbers, for any $q$ in two cases: (i) $q$ is not divisible by $p$; (ii) $q=p$. Using these criteria we show that any $p$-adic number can be represented…

We consider the thesis that an arithmetical relation, which holds for any, given, assignment of natural numbers to its free variables, is Turing-decidable if, and only if, it is the standard representation of a PA-provable formula. We show…