中文
相关论文

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

200 篇论文

This is a (slightly edited) version of the PhD dissertation of the author, submitted to Brown University in July 2005. We construct a homotopy calculus of functors in the sense of Goodwillie for the categories of rational homotopy theory.…

代数拓扑 · 数学 2007-05-23 Ben Walter

The aim of this note is a proof of a recent conjecture of Kellner concerning the number of distinct prime factors of a particular product of primes. The proof uses profound results from analytic number theory, such as Granville-Ramar\'{e}'s…

数论 · 数学 2017-05-30 Olivier Bordellès

In 1996 N. Chevallier proved a beautiful lemma which connects Diophantine approximation and multidimensional generalizations of the famous Three Distance Theorem. Using this lemma we show how known results about multidimensional three…

数论 · 数学 2025-02-12 Anton Shutov

We compute the closest convex piecewise linear-quadratic (PLQ) function with minimal number of pieces to a given univariate piecewise linear-quadratic function. The Euclidean norm is used to measure the distance between functions. First, we…

最优化与控制 · 数学 2025-03-25 Namrata Kundu , Yves Lucet

Separate consideration of properties of roots of Third Painlev\'e transcendents (P_III-functions) is necessary due to irregularity the differential equation defining them reveals on the subset of the phase space where its solution would…

经典分析与常微分方程 · 数学 2025-10-30 S. I. Tertychniy

We study functors F from C_f to D where C and D are simplicial model categories and C_f is the full subcategory of C consisting of objects that factor a fixed morphism f from A to B. We define the analogs of Eilenberg and Mac Lane's cross…

代数拓扑 · 数学 2014-03-03 Kristine Bauer , Brenda Johnson , Randy McCarthy

We give an arithmetical proof of the strong normalization of the $\lambda$-calculus (and also of the $\lambda\mu$-calculus) where the type system is the one of simple types with recursive equations on types. The proof using candidates of…

逻辑 · 数学 2009-05-08 René David , Karim Nour

We give explicit and asymptotic lower bounds for the quantity $|e^{s/t}-M/N|$ by studying a generalized continued fraction expansion of $e^{s/t}$. In cases $|s|\geq 3$ we improve existing results by extracting a large common factor from the…

数论 · 数学 2016-09-23 Kalle Leppälä , Tapani Matala-aho , Topi Törmä

A fast approximation to the Boys functions (related to the lower incomplete gamma function of half-integer parameter) by a single closed-form analytical expression for all argument values have been developed and tested. Besides the…

数值分析 · 数学 2025-07-09 Dimitri N. Laikov

We give a deterministic algorithm for approximately counting satisfying assignments of a degree-$d$ polynomial threshold function (PTF). Given a degree-$d$ input polynomial $p(x_1,\dots,x_n)$ over $R^n$ and a parameter $\epsilon> 0$, our…

计算复杂性 · 计算机科学 2013-12-02 Anindya De , Rocco Servedio

For each $n\in\mathbb{N}$, let $[n]\phi$ mean "the sentence $\phi$ is true in all $\Sigma_{n+1}$-correct transitive sets." Assuming G\"odel's axiom $V = L$, we prove the following graded variant of Solovay's completeness theorem: the set of…

逻辑 · 数学 2024-02-26 Juan Pablo Aguilera , Fedor Pakhomov

On [3, p. 199] one says "We mention parenthetically that the proof of [99, Lemma 41.3] is incorrect, and we do not know whether it, [99, Theorem 41.5] and [99, Theorem 41.6] are true". The previously cited reference [99] is our reference…

泛函分析 · 数学 2009-10-21 M. D. Voisei

We improve on Gonek-Montgomery's quantitative version of Kronecker's approximation theorem.

数论 · 数学 2024-05-14 Daria Maksimova

The aim of this paper is to present a very simple original, purely formal, proof of Quillen's adjunction theorem for derived functors, and of some more recent variations and generalizations of this theorem. This is obtained by proving an…

代数拓扑 · 数学 2007-05-23 Georges Maltsiniotis

In this short note we give an alternative proof of Glivenko's Theorem, stating that a formula $\phi$ is provable in classical propositional logic if and only if $\neg\neg\phi$ is provable in intuitionistic propositional logic. We work in…

逻辑 · 数学 2015-10-27 Pedro Sánchez Terraf

We prove a quantitative version of the Duffin-Schaeffer conjecture with an almost sharp error term. Precisely, let $\psi:\mathbb{N}\to[0,1/2]$ be a function such that the series $\sum_{q=1}^\infty \varphi(q)\psi(q)/q$ diverges. In addition,…

数论 · 数学 2024-09-23 Dimitris Koukoulopoulos , James Maynard , Daodao Yang

We prove that the Goodwillie tower of a weak equivalence preserving functor from spaces to spectra can be expressed in terms of the tower for stable mapping spaces. Our proof is motivated by interpreting the functors P_n and D_n as…

代数拓扑 · 数学 2009-12-21 Peter Oman

This paper presents simple, syntactic strong normalization proofs for the simply-typed lambda-calculus and the polymorphic lambda-calculus (system F) with the full set of logical connectives, and all the permutative reductions. The…

计算机科学中的逻辑 · 计算机科学 2008-04-17 Aleksander Wojdyga

Estimates of the approximate factor model are increasingly used in empirical work. Their theoretical properties, studied some twenty years ago, also laid the ground work for analysis on large dimensional panel data models with cross-section…

计量经济学 · 经济学 2020-08-04 Jushan Bai , Serena Ng

We present efficient algorithms for computing the $N$-point correlation functions (NPCFs) of random fields in arbitrary $D$-dimensional homogeneous and isotropic spaces. Such statistics appear throughout the physical sciences, and provide a…

天体物理仪器与方法 · 物理学 2022-09-14 Oliver H. E. Philcox , Zachary Slepian