Related papers: Weak and Strong Versions of Effective Transfinite …
The notion of weak truth-table reducibility plays an important role in recursion theory. In this paper, we introduce an elaboration of this notion, where a computable bound on the use function is explicitly specified. This elaboration…
Deterministic two-way transducers capture the class of regular functions. The efficiency of composing two-way transducers has a direct implication in algorithmic problems related to reactive synthesis, where transformation specifications…
We reveal that a suitable running coupling $\alpha(q^2)$ can reverse the direction of the one-particle-exchange (OPE) force at long distance if (and under general assumptions, only if) the exchanged particle has a mass $m$, either intrinsic…
We prove a quantitative reverse isoperimetric inequality for embedded surfaces with Willmore energy bounded away from $8\pi$. We use this result to analyze the negative $L^2$ gradient flow of the Willmore energy plus a positive multiple of…
The relation between representations and positive definite functions is a key concept in harmonic analysis on topological groups. Recently this relation has been studied on topological groupoids. This is the second in a series of papers in…
In classical inverse linear optimization, one assumes a given solution is a candidate to be optimal. Real data is imperfect and noisy, so there is no guarantee this assumption is satisfied. Inspired by regression, this paper presents a…
We show how polynomial path orders can be employed efficiently in conjunction with weak innermost dependency pairs to automatically certify polynomial runtime complexity of term rewrite systems and the polytime computability of the…
In this paper, we obtain almost sure invariance principles with rate of order $n^{1/p}\log^\beta n$, $2< p\le 4$, for sums associated to a sequence of reverse martingale differences. Then, we apply those results to obtain similar…
We show that positive elements with respect to the twisted convolutions, belonging to some ultra-test function space of certain order at origin, belong to the ultra-test function space of the same order everywhere. We apply the result to…
This paper examines the completion of an w-ordered sequence of recursive definitions which on the one hand defines an increasing sequence of nested set and on the other redefines successively a numeric variable as the cardinal of the…
Based on a reduction processing, we rewrite a hypergeometric term as the sum of the difference of a hypergeometric term and a reduced hypergeometric term (the reduced part, in short). We show that when the initial hypergeometric term has a…
We consider a class of abstract second order evolution equations with a restoring force that is strictly superlinear at infinity with respect to the position, and a dissipation mechanism that is strictly superlinear at infinity with respect…
We consider two algorithms which can be used for proving positivity of sequences that are defined by a linear recurrence equation with polynomial coefficients (P-finite sequences). Both algorithms have in common that while they do succeed…
Inverse optimization describes a process that is the "reverse" of traditional mathematical optimization. Unlike traditional optimization, which seeks to compute optimal decisions given an objective and constraints, inverse optimization…
Suppose we are given a computably enumerable object arise from algorithmic randomness or computable analysis. We are interested in the strength of oracles which can compute an object that approximates this c.e. object. It turns out that,…
If a semantically open language has no constraints on self-reference, one can prove an absurdity. The argument utilizes co-referring names 'a0' and 'a1', and the definition of a functional expression 'The reflection of x = y'. The…
The aim of this paper is to highlight a hitherto unknown computational aspect of Nonstandard Analysis pertaining to Reverse Mathematics (RM). In particular, we shall establish RM-equivalences between theorems from Nonstandard Analysis in a…
Counterfactual explanations (CEs) are advocated as being ideally suited to providing algorithmic recourse for subjects affected by the predictions of machine learning models. While CEs can be beneficial to affected individuals, recent work…
Every statement of the Ramsey theory of finite structures corresponds to the fact that a particular category has the Ramsey property. We can, then, compare the strength of Ramsey statements by comparing the ``Ramsey strength'' of the…
Specific definitions of the core and core-EP inverses of complex tensors are introduced. Some characterizations, representations and properties of the core and core-EP inverses are investigated. The results are verified using specific…