相关论文: A streamlined proof of Goodwillie's n-excisive app…

We construct a smooth real-valued function P(n) in [0,1], defined via a triple integral with a periodic kernel, that approximates the characteristic function of prime numbers. The function is built to suppress when n is divisible by some m…

The number of $n$-gaussoids is shown to be a double exponential function in $n$. The necessary bounds are achieved by studying construction methods for gaussoids that rely on prescribing $3$-minors and encoding the resulting combinatorial…

Nguyen has shown that on averaging over $a=1,...,q$ the 3-fold divisor function has exponent of distribution 2/3, following \cite {banks}. We follow [2] which leads to stronger bounds.

We study the number $p(n,t)$ of partitions of $n$ with difference $t$ between largest and smallest parts. Our main result is an explicit formula for the generating function $P_t(q) := \sum_{n \ge 1} p(n,t) \, q^n$. Somewhat surprisingly,…

We prove a discrete approximation of functionals with jumps and creases.

In 1974, M. B. Nathanson proved that every irrational number $\alpha$ represented by a simple continued fraction with infinitely many elements greater than or equal to $k$ is approximable by an infinite number of rational numbers $p/q$…

We construct a functor from the category of admissible finitely presented o-representations of GL(2,F) to the category of finite length o-representations of Gal_{Q_p}, for any finite extension F of Q_p and the ring of integers o of a finite…

In the present paper we use the expansion formula of the polylogarithm function to construct approximations of the Caputo derivative which are related to the midpoint approximation of the integral in the definition of the Caputo derivative.…

We prove a generalization of the Arone-Ching chain rule for Goodwillie derivatives by showing that for any pair of reduced finitary functors $F \colon \mathcal{D} \to \mathcal{E}$ and $G \colon \mathcal{C} \to \mathcal{D}$ between…

We incorporate strong negation in the theory of computable functionals TCF, a common extension of Plotkin's PCF and G\"{o}del's system $\mathbf{T}$, by defining simultaneously strong negation $A^{\mathbf{N}}$ of a formula $A$ and strong…

This note relies mainly on a refined version of the main results of the paper by F. Catrina and D. Costa (J. Differential Equations 2009). We provide very short and self-contained proofs. Our results are sharp and minimizers are obtained in…

Given a monotonically decreasing $\psi: \mathbb{N} \to [0,\infty)$, Khintchine's Theorem provides an efficient tool to decide whether, for almost every $\alpha \in \mathbb{R}$, there are infinitely many $(p,q) \in \mathbb{Z}^2$ such that…

We compute modular Galois representations associated with a newform $f$, and study the related problem of computing the coefficients of $f$ modulo a small prime $\ell$. To this end, we design a practical variant of the complex…

We show that the multiple divisor functions of integers in invertible residue classes modulo a prime number, as well as the Fourier coefficients of GL(N) Maass cusp forms for all N larger than 2, satisfy a central limit theorem in a…

We prove an essentially surjective Galois-correspondence-like functor for $n$-stacks. More specifically, it gives an essentially surjective functor from the $\infty$-category of $n$-stacks of finite sets with an action of the fundamental…

In this paper we consider how to use the convolution method to construct approximations, which consist of fuzzy numbers sequences with good properties, for a general fuzzy number. It shows that this convolution method can generate…

We present a new algorithm to rapidly compute the two-point (2PCF), three-point (3PCF) and n-point (n-PCF) correlation functions in roughly O(N log N) time for N particles, instead of O(N^n) as required by brute force approaches. The…

We investigate the rational approximation of fractional powers of unbounded positive operators attainable with a specific integral representation of the operator function. We provide accurate error bounds by exploiting classical results in…

Let $X_{1},...,X_{n}$ be compact spaces and $X=X_{1}\times ... \times X_{n}.$ Consider the approximation of a function $f\in C(X)$ by sums $g_{1}(x_{1})+... g_{n}(x_{n}),$ where $g_{i}\in C(X_{i}),$ $i=1,...,n.$ In [8], M.Golomb obtained a…

We prove some constructive results that on first and maybe even on second glance seem impossible.