Related papers: RCF4: Inconsistent Quantification
For which sets A does there exist a mapping, computed by a total or partial recursive function, such that the mapping, when its domain is restricted to A, is a 1-to-1, onto mapping to $\Sigma^*$? And for which sets A does there exist such a…
The predictive power of perturbative QCD (pQCD) depends on two important issues: (1) how to eliminate the renormalization scheme-and-scale ambiguities at fixed order, and (2) how to reliably estimate the contributions of unknown…
In addition to inherent computational challenges, the absence of a canonical method for quantifying `persistence' in multi-parameter persistent homology remains a hurdle in its application. One of the best known quantifications of…
We prove the equivalence of several natural notions of conformal maps between sub-Riemannian manifolds. Our main contribution is in the setting of those manifolds that support a suitable regularity theory for subelliptic $p$-Laplacian…
We propose a new family of regularized R\'enyi divergences parametrized not only by the order $\alpha$ but also by a variational function space. These new objects are defined by taking the infimal convolution of the standard R\'enyi…
We start with a random polynomial $P^{N}(z)$ of degree $N$ with independent coefficients. We then consider a new polynomial $P_{t}^{N}$ obtained by $\lceil Nt\rceil$ applications of a fractional differential operator of the form $z^{a}…
Due to the unobservability of confoundings, there has been widespread concern about how to compute causality quantitatively. To address this challenge, proxy-based negative control approaches have been commonly adopted, where auxiliary…
In this work we attempt to generalize our result in [6] [7] for real rings (not just von Neumann regular real rings). In other words we attempt to characterize and construct real closure * of commutative unitary rings that are real. We also…
Most modern (classical) programming languages support recursion. Recursion has also been successfully applied to the design of several quantum algorithms and introduced in a couple of quantum programming languages. So, it can be expected…
We prove reducibility of a class of quasi-periodically forced linear equations of the form \[ \partial_tu-\partial_x\circ (1+a(\omega t, x))u+\mathcal{Q}(\omega t)u=0,\quad x\in\mathbb{T}:=\mathbb{R}/2\pi\mathbb{Z}, \] where $u=u(t,x)$, $a$…
Solving optimization problems with high performance is the target of existing works of Quantum Approximate Optimization Algorithm (QAOA). With this intention, we propose an advanced QAOA based on incremental learning, where the training…
Minimum numbers decide e.g. whether a given map f: S^m --> S^n/G from a sphere into a spherical space form can be deformed to a map f' such that f(x) not equal f'(x) for all x in S^m. In this paper we compare minimum numbers to…
We study a family of piecewise expanding maps on the plane, generated by composition of a rotation and an expansive similitude of expansion constant $\beta$. We give two constants $B_1$ and $B_2$ depending only on the fundamental domain…
In order to develop efficient tools for automated reasoning with inconsistency (theorem provers), eventually making Logics of Formal inconsistency (LFI) a more appealing formalism for reasoning under uncertainty, it is important to develop…
We introduce a non-perturbative continuum framework to study the dynamics of quantum field theory (QFT), applied here to the CP(N-1) model, using Ecalle's theory of resurgent trans-series, combined with the physical principle of continuity,…
Quantum spaces with $\frak{su}(2)$ noncommutativity can be modelled by using a family of $SO(3)$-equivariant differential $^*$-representations. The quantization maps are determined from the combination of the Wigner theorem for $SU(2)$ with…
We consider the problem of estimating the optimal transport map between two probability distributions, $P$ and $Q$ in $\mathbb R^d$, on the basis of i.i.d. samples. All existing statistical analyses of this problem require the assumption…
This paper establishes comprehensive stability results for quasi-variational inequalities (QVIs) under monotone perturbations of the governing operator. We prove strong convergence of both minimal and maximal solutions when sequences of…
The extension of Non-Relativistic-to-Covariant classification scheme seems to be an urgent problem in the Hadron Spectroscopy. Here are given the recent results of our research. 1) Brief history of our way of the extension on Kinematical…
We analyse how the standard reductions between constraint satisfaction problems affect their proof complexity. We show that, for the most studied propositional, algebraic, and semi-algebraic proof systems, the classical constructions of…