Related papers: Approximating the Existential Theory of the Reals
The method of ``Total Least Squares'' is proposed as a more natural way (than ordinary least squares) to approximate the data if both the matrix and and the right-hand side are contaminated by ``errors''. In this tutorial note, we give a…
We present the partial evolutionary tensor neural networks (pETNNs), a novel framework for solving time-dependent partial differential equations with high accuracy and capable of handling high-dimensional problems. Our architecture…
In this paper we study the existence and linear stability of almost periodic solutions for a NLS equation on the circle with external parameters. Starting from the seminal result of Bourgain (2005) on the quintic NLS, we propose a novel…
Relying on a fundamental empirical identity of heavy and inertial mass it is proposed to bring a status of general theory of relativity (GTR) of Einstein up to a level of Unified Field Theory. To do this, a thoroughgoing revision of…
Approximation theory is concerned with the ability to approximate functions by simpler and more easily calculated functions. The first question we ask in approximation theory concerns the {\it possibility of approximation}. Is the given…
Effective field theories (EFTs) have been widely used as a framework in order to place constraints on the Planck suppressed Lorentz violations predicted by various models of quantum gravity. There are however technical problems in the EFT…
We study the non-relativistic (NR) limit of relativistic spacetimes in relation with the topology of the Universe. We first show that the NR limit of the Einstein equation is only possible in Euclidean topologies, i.e. for which the…
We prove that the electron density function of a real physical system can be uniquely determined by its values on any finite subsystem. This establishes the existence of a rigorous density-functional theory for any open electronic system.…
This is an attempt to create a consistent and non-trivial extension of quantum theory, describing in detail the quantum measurement process. A tentative but concrete model is presented, based on the concept of multiple…
Exponential tilting is a technique commonly used in fields such as statistics, probability, information theory, and optimization to create parametric distribution shifts. Despite its prevalence in related fields, tilting has not seen…
This paper discusses various theorems on the approximation capabilities of neural networks (NNs), which are known as universal approximation theorems (UATs). The paper gives a systematic overview of UATs starting from the preliminary…
Main goal of this paper is to generalize Hadamard's real part theorem and invariant forms of Borel-Carath\'eodory's theorem from complex analysis to solutions of the Riesz system in the three-dimensional Euclidean space in the framework of…
For the stationary Gross-Pitaevskii equation with harmonic real and linear imaginary potentials in the space of one dimension, we study the ground state in the limit of large densities (large chemical potentials), where the solution…
We describe how physical universes that are composed of gauge and gravitationally interacting bosonic and fermionic quantum fields arise from the generic discrete distribution of many quantifiable properties of arbitrary static entities.…
We study approximations of theories both in general context and with respect to some natural classes of theories. Some kinds of approximations are considered, connections with finitely axiomatizable theories and minimal generating sets of…
A space-discretization for the elastic flow of inextensible curves is devised and quasi-optimal convergence of the corresponding semi-discrete problem is proved for a suitable discretization of the nonlinear inextensibility constraint.…
We prove the existence of solutions for an evolution quasi-variational inequality with a first order quasilinear operator and a variable convex set, which is characterized by a constraint on the absolute value of the gradient that depends…
The approximate degree of a Boolean function f is the least degree of a real polynomial that approximates f pointwise to error at most 1/3. Approximate degree is known to be a lower bound on quantum query complexity. We resolve or nearly…
A quasi-entropy is constructed for tensors averaged by a density function on $SO(3)$ using the log-determinant of a covariance matrix. It serves as a substitution of the entropy for tensors derived from a constrained minimization that…
An NP-hard combinatorial optimization problem $\Pi$ is said to have an {\em approximation threshold} if there is some $t$ such that the optimal value of $\Pi$ can be approximated in polynomial time within a ratio of $t$, and it is NP-hard…