Related papers: A survey of local-global methods for Hilbert's Ten…
Solving non-linear Diophantine systems lies at the mathematical core of integer optimization and cryptography. While the general unbounded problem is undecidable, even over bounded integer domains it remains classically intractable in the…
The Hubbard model is a simplified description for the evolution of interacting spin-1/2 fermions on a d-dimensional lattice. In a kinetic scaling limit, the Hubbard model can be associated with a matrix-valued Boltzmann equation, the…
The existence of a global attractor for wave equations in unbounded domains is a challenging problem due to the non-compactness of the Sobolev embeddings. To overcome this difficulty, some authors have worked with weighted Sobolev spaces…
In this article, we extend the framework developed in \cite{unbounded_domain_cadiot} to allow for rigorous proofs of existence of smooth, localized solutions in semi-linear partial differential equations possessing both space and non-space…
The Hidden Subgroup Problem (HSP) is a computational problem which includes as special cases integer factorization, the discrete logarithm problem, graph isomorphism, and the shortest vector problem. The celebrated polynomial-time quantum…
Classifying points in high dimensional spaces is a fundamental geometric problem in machine learning. In this paper, we address classifying points in the $d$-dimensional Hilbert polygonal metric. The Hilbert metric is a generalization of…
We consider a stochastic version of the proximal point algorithm for optimization problems posed on a Hilbert space. A typical application of this is supervised learning. While the method is not new, it has not been extensively analyzed in…
Let $I$ be a homogeneous ideal in the polynomial ring $R = k[z_1, \cdots, z_n]$ , where $k$ is an algebraically closed field of characteristic zero. Macaulay's Theorem provides constraints on the Hilbert function of $I$ or $R/I$ from one…
The method of choice for describing attractive quantum systems is Hartree-Fock-Bogoliubov (HFB) theory. This is a nonlinear model which allows for the description of pairing effects, the main explanation for the superconductivity of certain…
We consider two algorithmic problems concerning sub-semigroups of Heisenberg groups and, more generally, two-step nilpotent groups. The first problem is Intersection Emptiness, which asks whether a finite number of given finitely generated…
In this paper convex optimization techniques are employed for convex optimization problems in infinite dimensional Hilbert spaces. A first order optimality condition is given. Let $f : \mathbb{R}^{n}\rightarrow \mathbb{R}$ and let $x\in…
Let $G$ be a simple graph on $n$ vertices, and let $J_G$ denotes the corresponding binomial edge ideal in $S=\mathbb{K}[x_1,\ldots,x_n,y_1,\ldots,y_n]$, where $\mathbb{K}$ is a field. We show that if a vertex satisfies a certain degree…
Using a geometric construction, we solve Plateau's Problem in the Heisenberg group $\mathbb{H}^{1}$ for intrinsic graphs defined on a convex domain $D$, under a smallness condition either on the boundary $\partial D$ or on the Lipschitz…
Let ${\mathbf P}$ be the class of polynomial-time decision problems and $\mathbf{NP}$ be the class of nondeterministic polynomial time decision problems. We prove the following: Theorem 3. The classes ${\mathbf P}$ and $\mathbf{NP}$ are…
We present methods for locally solving the Dynamic Programming Equations (DPE) and the Hamilton Jacobi Bellman (HJB) PDE that arise in the infinite horizon optimal control problem. The method for solving the DPE is the discrete time version…
We study a variant of the Riemann-Hilbert problem on the complements of hyperplane arrangements. This problem asks whether a given local system on the complement can be realized as the solution sheaf of a logarithmic Pfaffian system with…
Daniel Simon's 1994 discovery of an efficient quantum algorithm for solving the hidden subgroup problem (HSP) over Z_2^n provided one of the first algebraic problems for which quantum computers are exponentially faster than their classical…
The split common fixed-point problem is an inverse problem that consists in finding an element in a fixed-point set such that its image under a bounded linear operator belongs to another fixed-point set. Recently Censor and Segal proposed…
We present and analyze two algorithms for computing the Hilbert class polynomial $H_D$ . The first is a p-adic lifting algorithm for inert primes p in the order of discriminant D < 0. The second is an improved Chinese remainder algorithm…
The paper considers the Hilbert space $\hat{H}_r$ of real functions summable with the square $L^2(a,b)_r$ on any interval $\{(a,b)_r\}_{r=1}^{\infty}\in \mathbb{R}$. It is shown on the basis of the theorem on zeros of real orthogonal…