Related papers: You could simplify calculus
We introduce the intuitive method to select an analytic Abel function of an analytic function f at a non-fixpoint. Due to the complexity of this method by involving matrix inversion of increasing size there is little known about its…
In this paper, we give the explicit bounds for the data of objects involved in some basic theorems of Singularity theory: the Inverse, Implicit and Rank Theorems for Lipschitz mappings, Splitting Lemma and Morse Lemma, the density and…
We define the notion of {\em rational presentation of a complete metric space} in order to study metric spaces from the algorithmic complexity point of view. In this setting, we study some presentations of the space $\czu$ of uniformly…
A consistent functional calculus approach to the spectral theorem for strongly commuting normal operators on Hilbert spaces is presented. In contrast to the common approaches using projection-valued measures or multiplication operators,…
The paper deals with a comprehensive theory of mappings, whose local behavior can be described by means of linear subspaces, contained in the graphs of two (primal and dual) generalized derivatives. This class of mappings includes the…
We mainly establish a monotonicity property between some special Riemann sums of a convex function $f$ on $[a,b]$, which in particular yields that $\frac{b-a}{n+1}\sum_{i=0}^n f\left(a+i\frac{b-a}{n}\right)$ is decreasing while…
Lower and upper bounds for a given function are important in many mathematical and engineering contexts, where they often serve as a base for both analysis and application. In this short paper, we derive piecewise linear and quadratic…
For stationary two-valued harmonic functions with H\"older regularity, we establish their Lipschitz regularity and prove that the nodal set consists of analytic hypersurfaces away from a singular set. The main tools are the Almgren…
A general explicit form for generating functions for approximating fractional derivatives is derived. To achieve this, an equivalent characterisation for consistency and order of approximations established on a general generating function…
There have been several modifications of how basic calculus has been taught, but very few of these modifications have considered the computational tools available at our disposal. Here, we present a few tools that are easy to develop and…
Derivative of a function can be expressed in terms of integration over a small neighborhood of the point of differentiation, so-called differentiation by integration method. In this text a maximal generalization of existing results which…
We introduce a new generalization of Euler's $\varphi$-function associated with a system of polynomials of several variables. We reprove by a short direct approach certain known related identities, and study some other special cases that do…
We consider an equation of multiple variables in which a partial derivative does not vanish at a point. The implicit function theorem provides a local existence and uniqueness of the function for the equation. In this paper, we propose an…
In this paper, we present a general realizability semantics for the simply typed $\lambda\mu$-calculus. Then, based on this semantics, we derive both weak and strong normalization results for two versions of the $\lambda\mu$-calculus…
This is a survey on propositional proof complexity aimed at introducing the basics of the field with a particular focus on a method known as feasible interpolation. This method is used to construct "hard theorems" for several proof systems…
The purpose of this paper is to introduce basic concepts that are fundamental in the examination of composite moduli, while avoiding the notoriously difficult problem of prime-factorization. We introduce a new class of numbers, called…
In this work we establish a theory of Calculus based on the new concept of displacement. We develop all the concepts and results necessary to go from the definition to differential equations, starting with topology and measure and moving on…
The categorical models of the differential lambda-calculus are additive categories because of the Leibniz rule which requires the summation of two expressions. This means that, as far as the differential lambda-calculus and differential…
For a discrete function $f\left( x\right) $ on a discrete set, the finite difference can be either forward and backward. However, we observe that if $ f\left( x\right) $ is a sum of two functions $f\left( x\right) =f_{1}\left( x\right)…
Lifting theorems are theorems that bound the communication complexity of a composed function $f\circ g^{n}$ in terms of the query complexity of $f$ and the communication complexity of $g$. Such theorems constitute a powerful generalization…