Related papers: A survey of local-global methods for Hilbert's Ten…
Let $\mathcal{X}$ be a p-adic Hilbert space. Let $A:\mathcal{D}(A)\subseteq \mathcal{X}\to \mathcal{X}$ and $B: \mathcal{D}(B)\subseteq \mathcal{X}\to \mathcal{X}$ be possibly unbounded self-adjoint linear operators. For $x \in…
The present work includes some of the author's original researches on integer solutions of Diophantine liner equations and systems. The notion of "general integer solution" of a Diophantine linear equation with two unknowns is extended to…
In the Hilbert space $H$, the inverse problem of determining the right-hand side of the abstract subdiffusion equation with the fractional Caputo derivative is considered. For the forward problem, a non-local in time condition $u(0)=u(T)$…
The classical Hilbert specialization property is a field-theoretic tool ensuring that polynomial irreducibility over a field is preserved under specialization of some of the variables. We develop an integral counterpart by introducing the…
A Grobner basis-based algorithm for solving the Frobenius Instance Problem is presented, and this leads to an algorithm for solving the Frobenius Problem that can handle numbers with thousands of digits. Connections to irreducible…
After introducing the sub-Riemannian geometry of the Heisenberg group Hn, n \geq 1, we recall some basics about hypersurfaces endowed with the H-perimeter measure and horizontal Green's formulas. Then, we describe a class of compact closed…
In this paper we study Newton's method for solving the generalized equation $F(x)+T(x)\ni 0$ in Hilbert spaces, where $F$ is a Fr\'echet differentiable function and $T$ is set-valued and maximal monotone. We show that this method is local…
We present the first local problem that shows a super-constant separation between the classical randomized LOCAL model of distributed computing and its quantum counterpart. By prior work, such a separation was known only for an artificial…
At the 1900 International Congress of Mathematicians, Hilbert claimed that the Riemann zeta function is not the solution of any algebraic ordinary differential equation its region of analyticity \cite{HilbertProb}. In 2015, Van Gorder…
This paper is motivated by two problems in the theory of Diophantine approximation, namely, Davenport's problem regarding badly approximable points on submanifolds of a Euclidean space and Schmidt's problem regarding the intersections of…
We consider a matrix Riemann-Hilbert problem for the sextic nonlinear Schr\"{o}dinger equation with a non-zero boundary conditions at infinity. Before analyzing the spectrum problem, we introduce a Riemann surface and uniformization…
In this paper, we give explicit descriptions of versions of (Local-) Backtracking Gradient Descent and New Q-Newton's method to the Riemannian setting.Here are some easy to state consequences of results in this paper, where X is a general…
Although the Kadanoff-Baym equations are typically solved using time-stepping methods, iterative global-in-time solvers offer potential algorithmic advantages, particularly when combined with compressed representations of two-time objects.…
The purpose of this paper is to investigate the existence and estimation of Hausdorff and fractal dimension of global attractors for a delayed reaction-diffusion equation on an unbounded domain. The noncompactness of the domain cause the…
We deal with the solution of a generic linear inverse problem in the Hilbert space setting. The exact right hand side is unknown and only accessible through discretised measurements corrupted by white noise with unknown arbitrary…
In this article, I provide a solution to a rank computation problem related to the computation of the Hilbert-Kunz function for any disjoint-term trinomial hypersurface, over any field of characteristic 2. This rank computation problem was…
Let f(t,X) be an irreducible polynomial over the field of rational functions k(t), where k is a number field. Let O be the ring of integers of k. Hilbert's irreducibility theorem gives infinitely many integral specializations of t to values…
The Erd\H{o}s--Ginzburg--Ziv Problem is a classical extremal problem in discrete geometry. Given $m$ and $n$, the problem asks about the smallest number $s$ such that among any $s$ points in the integer lattice $\mathbb{Z}^n$ one can find…
We review a family of algorithms for Lyapunov- and Riccati-type equations which are all related to each other by the idea of \emph{doubling}: they construct the iterate $Q_k = X_{2^k}$ of another naturally-arising fixed-point iteration…
In this paper the Riemann-Hilbert problem, with jump supported on a appropriate curve on the complex plane with a finite endpoint at the origin, is used for the study of corresponding matrix biorthogonal polynomials associated with Laguerre…