Related papers: You could simplify calculus
We develop a generalization of manifold calculus in the sense of Goodwillie-Weiss where the manifold is replaced by a simplicial complex. We consider functors from the category of open subsets of a fixed simplical complex into the category…
We present a simple functional programming language, called Dual PCF, that implements forward mode automatic differentiation using dual numbers in the framework of exact real number computation. The main new feature of this language is the…
Integration at a point is a new kind of integration derived from integration over an interval in infinitesimal and infinity domains which are spaces larger than the reals. Consider a continuous monotonic divergent function that is…
In this short note we have proved an enhanced version of a theorem of Lorentz [1] and its generalization to the multivariate case which gives a non- uniform estimate of degree of approximation by a polynomial with positive coefficients. The…
Composite minimization involves a collection of smooth functions which are aggregated in a nonsmooth manner. In the convex setting, we design an algorithm by linearizing each smooth component in accordance with its main curvature. The…
We establish an analogue of the first fundamental theorem of calculus for functions defined on the Wasserstein space of probability measures. Precisely, we show that if a function on the Wasserstein space is sufficiently regular in the…
A standard informal method for analyzing the asymptotic complexity of a program is to extract a recurrence that describes its cost in terms of the size of its input, and then to compute a closed-form upper bound on that recurrence. We give…
This article is centered around generalizing a previous implicit function theorem of the author to be applicable for maps f:E sqcap F to F which can be lifted to Keller C^k_pi maps f_i:E sqcap F_i to F_i with F_i Banach and F=projlim F_i .…
We introduce several generalizations of classical computer science problems obtained by replacing simpler objective functions with general submodular functions. The new problems include submodular load balancing, which generalizes load…
We consider generalized solutions of the Perona-Malik equation in dimension one, defined as all possible limits of solutions to the semi-discrete approximation in which derivatives with respect to the space variable are replaced by…
This paper concerns the explicit treatment of substitutions in the lambda calculus. One of its contributions is the simplification and rationalization of the suspension calculus that embodies such a treatment. The earlier version of this…
Generalized analytic functions over generalized analytic manifolds are build from sums of convergent real power series with non-negative real exponents (and some well-ordering condition on the support). In a paper by Mart\'in-Villaverde,…
We propose a new framework to design and analyze accelerated methods that solve general monotone equation (ME) problems $F(x)=0$. Traditional approaches include generalized steepest descent methods and inexact Newton-type methods. If $F$ is…
In this paper, we introduce the polynomial continued fraction, a close relative of the well-known simple continued fraction expansions which are widely used in number theory and in general. While they may not possess all the intriguing…
We introduce a category-theoreticabstraction of a syntax with auxiliary functions, called an admissiblemonad morphism. Relying on an abstract form of structural recursion,we then design generic tools to construct admissible monad…
We solve the Dirichlet problem in the unit disc and derive the Poisson formula using very elementary methods and explore consequent simplifications in other foundational areas of complex analysis.
We obtain conditions for the differentiability of weak solutions for a second-order uniformly elliptic equation in divergence form with a homogeneous co-normal boundary condition. The modulus of continuity for the coefficients is assumed to…
This note points out a lemma on closures of monotonic increasing functions and shows how it is applicable to decomposition and modularity for semantics defined as the least fixedpoint of some monotonic function. In particular it applies to…
A loss function measures the discrepancy between the true values (observations) and their estimated fits, for a given instance of data. A loss function is said to be proper (unbiased, Fisher consistent) if the fits are defined over a unit…
A sharp bound is obtained for the number of ways to express the monomial $X^n$ as a product of linear factors over $\mathbb{Z}/p^{\alpha}\mathbb{Z}$. The proof relies on an induction-on-scale procedure which is used to estimate the number…