Related papers: On the remainder in the Taylor theorem

We give a reformulation of the Lehmer conjecture about algebraic integers in terms of a simple counting problem modulo p.

Turing's famous 'machine' framework provides an intuitively clear conception of 'computing with real numbers'. A recursive counterexample to a theorem shows that the theorem does not hold when restricted to computable objects. These…

We prove the neo-classical inequality with the optimal constant, which was conjectured by T. J. Lyons [Rev. Mat. Iberoamericana 14 (1998) 215-310]. For the proof, we introduce the fractional order Taylor's series with residual terms. Their…

This short note reports a master theorem on tight asymptotic solutions to divide-and-conquer recurrences with more than one recursive term: for example, T(n) = 1/4 T(n/16) + 1/3 T(3n/5) + 4 T(n/100) + 10 T(n/300) + n^2.

In this note we examine Littlewood's proof of the prime number theorem. We show that this can be extended to provide an equivalence between the prime number theorem and the non-vanishing of Riemann's zeta-function on the one-line. Our…

We first partly develop a mathematical notion of stable consistency intended to reflect the actual consistency property of human beings. Then we give a generalization of the first and second G\"odel incompleteness theorem to stably…

Here, we give upper and lower bounds on the count of positive integers $n\le x$ dividing the $n$th term of a nondegenerate linearly recurrent sequence with simple roots.

In this note we observe that automated theorem provers (ATPs) that recursively enumerate theorems in a particular way will fail to identify some valid theorems for a reason that is analogous to how G\"odel proved the existence of what are…

We prove a lower bound of $\tilde{\Omega}(n^{1/3})$ for the query complexity of any two-sided and adaptive algorithm that tests whether an unknown Boolean function $f:\{0,1\}^n\rightarrow \{0,1\}$ is monotone or far from monotone. This…

The Euclidean algorithm makes possible a simple but powerful generalization of Taylor's theorem. Instead of expanding a function in a series around a single point, one spreads out the spectrum to include any number of points with given…

This note discusses three examples given in the recent technical correspondence paper [1], which addresses the results presented in [2,3,4]. It is shown that the first example ([1], Section 3) is irrelevant to the results of [2]. The second…

We consider "Taylor domination" property for an analytic function $f(z)=\sum_{k=0}^{\infty}a_{k}z^{k},$ in the complex disk $D_R$, which is an inequality of the form \[ |a_{k}|R^{k}\leq C\ \max_{i=0,\dots,N}\ |a_{i}|R^{i}, \ k \geq N+1. \]…

A very simple but useful almost sure convergence theorem of probability is given.

Restriction is a natural quasi-order on $d$-way tensors. We establish a remarkable aspect of this quasi-order in the case of tensors over a fixed finite field -- namely, that it is a well-quasi-order: it admits no infinite antichains and no…

The classical inequality of Bohr concerning Taylor coeficients of bounded holomorphic functions on the unit disk, has proved to be of significance in answering in the negative the conjecture that if the non-unital von Neumann inequality…

`What more than its truth do we know if we have a proof of a theorem in a given formal system?' We examine Kreisel's question in the particular context of program termination proofs, with an eye to deriving complexity bounds on program…

A very short proof of the Fej\'er-Riesz lemma is presented in the matrix case

Let $A,B\in B(H)$. We present among others a simple proof of the widely known result stating that if $0\leq A\leq B$, then $\sqrt A\leq \sqrt B$. The same idea is used to prove that if $0\leq A\leq B$ and $A$ is invertible, then $B$ too is…

The purpose of this letter is to investigate the time complexity consequences of the truncated Taylor series, known as Taylor Polynomials \cite{bakas2019taylor,Katsoprinakis2011,Nestoridis2011}. In particular, it is demonstrated that the…

We prove that a continuous function $f:(0,\infty) \to (0,\infty)$ is operator monotone increasing if and only if $f(A \: !_t \: B) \leqs f(A) \: !_t \: f(B)$ for any positive operators $A,B$ and scalar $t \in [0,1]$. Here, $!_t$ denotes the…