Related papers: An Arithmetic Theory for the Poly-Time Random Func…
We establish the average-case hardness of the algorithmic problem of exact computation of the partition function associated with the Sherrington-Kirkpatrick model of spin glasses with Gaussian couplings and random external field. In…
Two emergent properties in aggregation theory are investigated, namely horizontal maxitivity and comonotonic maxitivity (as well as their dual counterparts) which are commonly defined by means of certain functional equations. We completely…
Classical probabilistic rounding error analysis is particularly well suited to stochastic rounding (SR), and it yields strong results when dealing with floating-point algorithms that rely heavily on summation. For many numerical linear…
We consider a class of optimization problems that involve determining the maximum value that a function in a particular class can attain subject to a collection of difference constraints. We show that a particular linear programming…
This paper introduces new notions of asymptotic proofs, PT(polynomial-time)-extensions, PTM(polynomial-time Turing machine)-omega-consistency, etc. on formal theories of arithmetic including PA (Peano Arithmetic). This paper shows that P…
A function g, with domain the natural numbers, is a quasi-polynomial if there exists a period m and polynomials p_0,p_1,...,p_{m-1} such that g(t)=p_i(t) for t=i mod m. Quasi-polynomials classically -- and "reasonably" -- appear in Ehrhart…
Let A be the integral closure of the ring of polynomials CC[t], within the field of algebraic functions in one variable. We show that A interprets the ring of integers. This contrasts with the analogue for finite fields, proved to have a…
This article summarises the theory of several bounded functional calculi for unbounded operators that have recently been discovered. The extend the Hille--Phillips calculus for (negative) generators $A$ of certain bounded $C_0$-semigroups,…
We propose a new order, the small polynomial path order (sPOP* for short). The order sPOP* provides a characterisation of the class of polynomial time computable function via term rewrite systems. Any polynomial time computable function…
The notion of probability plays an important role in almost all areas of science and technology. In modern mathematics, however, probability theory means nothing other than measure theory, and the operational characterization of the notion…
There are two rather distinct approaches to Morse theory nowadays: smooth and discrete. We propose to study a real valued function by assembling all associated sections in a topological category. From this point of view, Reeb functions on…
For families of continuous plurisubharmonic functions we show that, in a local sense, separately bounded above implies bounded above.
This work proposes a unified theory of regularity in one hypercomplex variable: the theory of $T$-regular functions. In the special case of quaternion-valued functions of one quaternionic variable, this unified theory comprises…
We discuss a connection between two areas of mathematics which until recently seemed to be rather distant from each other: (1) noncommutative harmonic analysis on groups and (2) some topics in probability theory related to random point…
We consider a class of stochastic programs whose uncertain data has an exponential number of possible outcomes, where scenarios are affinely parametrized by the vertices of a tractable binary polytope. Under these conditions, we propose a…
Modify the Blum-Shub-Smale model of computation replacing the permitted computational primitives (the real field operations) with any finite set $B$ of real functions semialgebraic over the rationals. Consider the class of boolean decision…
The existence of string functions, which are not polynomial time computable, but whose graph is checkable in polynomial time, is a basic assumption in cryptography. We prove that in the framework of algebraic complexity, there are no such…
It is well-known that a random variable, i.e., a function defined on a probability space, with values in a Borel space, can be represented on the special probability space consisting of the unit interval with Lebesgue measure. We show an…
A mathematical proposition with a trainable pair, operator and quantum circuit, are introduced to approximate functions expressed as cubic Taylor polynomials, numerical simulations illustrate three cases.
Orthogonal polynomials and multiple orthogonal polynomials are interesting special functions because there is a beautiful theory for them, with many examples and useful applications in mathematical physics, numerical analysis, statistics…