相关论文: A streamlined proof of Goodwillie's n-excisive app…
A generalization of the Gr\"{u}nwald difference approximation for fractional derivatives in terms of a real sequence and its generating function is presented. Properties of the generating function are derived for consistency and order of…
We prove the strong form of the Gaussian product conjecture in dimension three. Our purely analytical proof simplifies previously known proofs based on combinatorial methods or computer-assisted methods, and allows us to solve the case of…
Having a function $f$ and a set of functionals $\{\mathcal{C}_{n}\}$, $c_n^f \equiv \mathcal{C}_n \left(f\right)$, one can interpret function approximation very generally as a construction of some function $\mathcal{A}_{N}^{f}$ such that…
An approximate formula for the partitions of Goldbach's Conjecture is derived using Prime Number Theorem and a heuristic probabilistic approach. A strong form of Goldbach's conjecture follows in the form of a lower bounding function for the…
This paper reformulates Goodwillie calculus of $\infty$-categories including non-presentable $\infty$-categories. In the case of presentable $\infty$-categories our definition is equivalent to Heuts's~\cite{Heuts2018} work. As an…
We prove that the Newton product of efficient polynomial projectors is still efficient. Various polynomial approximation theorems are established involving Newton product projectors on spaces of holomorphic functions on a neighborhood of a…
The Functional Machine Calculus (Heijltjes 2022) is an extension of the lambda-calculus that preserves confluent reduction and typed termination, while enabling both call-by-name and call-by-value reduction behaviour and encoding the…
We prove a closed formula for the derivative, of any order, of a implicit function, in terms of some binomial building blocks, and explain the combinatorics behind the coefficients appearing in the formula.
We propose to use Tarski's least fixpoint theorem as a basis to define recursive functions in the calculus of inductive constructions. This widens the class of functions that can be modeled in type-theory based theorem proving tool to…
Rational approximations of generalized hypergeometric functions ${}_pF_q$ of type $(n+k,k)$ are constructed by the Drummond and factorial Levin-type sequence transformations. We derive recurrence relations for these rational approximations…
We develop a new closed-form arithmetic and recursive formula for the partition function and a generalization of Andrews' smallest parts (spt) function. Using the inclusion-exclusion principle, we additionally develop a formula for the…
Assuming the length of the $3\pi$ cut to be finite and approximating the integrated amplitude by a constant, we derive an expression for the $\pi N\bar{N}$ form factor which is very close to that given by a simple pole. The specific…
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…
We present a closed-form solution for n-th term of a general three-term recurrence relation with arbitrary given n-dependent coefficients. The derivation and corresponding proof are based on two approaches, which we develop and describe in…
The category of small covariant functors from simplicial sets to simplicial sets supports the projective model structure. In this paper we construct various localizations of the projective model structure and also give a variant for…
We survey the theory and applications of Goodwillie's calculus of homotopy functors and related topics.
Jay and Given-Wilson have recently introduced the Factorisation (or SF-) calculus as a minimal fundamental model of intensional computation. It is a combinatory calculus containing a special combinator, F, which is able to examine the…
We define a theory of Goodwillie calculus for enriched functors from finite pointed simplicial G-sets to symmetric G-spectra, where G is a finite group. We extend a notion of G-linearity suggested by Blumberg to define stably excisive and…
We reconceptualize the process of forming $n$-excisive approximations to $\infty$-categories, in the sense of Heuts, as inverting the suspension functor lifted to $A_n$-cogroup objects. We characterize $n$-excisive $\infty$-categories as…
This article is the last of the series of articles where we reprove the foundational ideas of abstract six-functor formalisms developed by Liu-Zheng. We prove the theorem of partial adjoints, which is a simplicial technique of encoding…