中文
相关论文

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

200 篇论文

We call positive integer n a near-perfect number, if it is sum of all its proper divisors, except of one of them ("redundant divisor"). We prove an Euclid-like theorem for near-perfect numbers and obtain some other results for them.

数论 · 数学 2012-02-20 Vladimir Shevelev

Let F be a number field and p be a prime. In the Successive Approximation Theorem, we prove that, for each positive integer n, finitely many candidates for the Galois group G(p,n,F) of the n-th stage F(p,n) of the p-class tower…

数论 · 数学 2017-10-13 Daniel C. Mayer

We introduce a collection of polynomials $F_N$, associated to each positive integer $N$, whose divisibility properties yield a reformulation of the Goldbach conjecture. While this reformulation certainly does not lead to a resolution of the…

We show that a realization of a closed connected PL-manifold of dimension n-1 in n-dimensional Euclidean space (n>2) is the boundary of a convex polyhedron (finite or infinite) if and only if the interior of each (n-3)-face has a point,…

计算几何 · 计算机科学 2007-05-23 Konstantin Rybnikov

We give a direct and elementary proof of the theorem on formal functions by studying the behaviour of the Godement resolution of a sheaf of modules under completion.

代数几何 · 数学 2007-11-29 Fernado Sancho , Pedro Sancho

We provide a proof of the the Front-Door adjustment formula using the do-calculus.

人工智能 · 计算机科学 2018-06-28 Mohammad Ali Javidian , Marco Valtorta

The method of self-similar factor approximants is completed by defining the approximants of odd orders, constructed from the power series with the largest term of an odd power. It is shown that the method provides good approximations for…

数学物理 · 物理学 2009-11-13 V. I. Yukalov , E. P. Yukalova

In this note we introduce a Waldschmidt decomposition of divisors which might be viewed as a generalization of Zariski decomposition based on the effectivity rather than the nefness of divisors. As an immediate application we prove a…

代数几何 · 数学 2018-02-27 Marcin Dumnicki , Tomasz Szemberg , Justyna Szpond

We present an extension to the $\mathtt{mathlib}$ library of the Lean theorem prover formalizing the foundations of computability theory. We use primitive recursive functions and partial recursive functions as the main objects of study, and…

计算机科学中的逻辑 · 计算机科学 2019-07-19 Mario Carneiro

A multidimesional function $y(\vec r)$ defined by a sample of points $\{\vec r_i,y_i\}$ is approximated by a differentiable function $\widetilde y(\vec r)$. The problem is solved by using the Gauss-Hermite folding method developed in the…

计算物理 · 物理学 2007-05-23 Krzysztof Pomorski

A finite expansion of the exponential map for a $N\times N$ matrix is presented. The method uses the Cayley-Hamilton theorem for writing the higher matrix powers in terms of the first N-1 ones. The resulting sums over the corresponding…

高能物理 - 理论 · 物理学 2008-11-26 Alexander Laufer

We generalise the Fundamental Theorem of Calculus to higher dimensions. Our generalisation is based on the observation that the antiderivative of a function of $n$-variables is a solution of a partial differential equation of order $n$…

综合数学 · 数学 2024-02-23 Filip Bár

An astonishingly simple analytical frequency approximation formula for a class of strongly nonlinear oscillators is derived and applied to various example systems yielding useful quick estimates.

其他凝聚态物理 · 物理学 2016-04-15 Kevin Rapedius

We introduce novel results for approximate inference on planar graphical models using the loop calculus framework. The loop calculus (Chertkov and Chernyak, 2006) allows to express the exact partition function of a graphical model as a…

人工智能 · 计算机科学 2009-05-25 V. Gómez , H. J. Kappen , M. Chertkov

This paper introduces two sequent calculi for intuitionistic strong L\"ob logic ${\sf iSL}_\Box$: a terminating sequent calculus ${\sf G4iSL}_\Box$ based on the terminating sequent calculus ${\sf G4ip}$ for intuitionistic propositional…

逻辑 · 数学 2023-03-07 Iris van der Giessen , Rosalie Iemhoff

The Functional Machine Calculus (Heijltjes 2022) is a new approach to unifying the imperative and functional programming paradigms. It extends the lambda-calculus, preserving the key features of confluent reduction and typed termination, to…

编程语言 · 计算机科学 2026-03-03 Willem Heijltjes

Here, in a series of articles, we show methods for calculating propositional statements using algebraic polynomials as symbols for the connectives, which are named operators. These polynomials originate from the transformation between the…

逻辑 · 数学 2026-02-09 Pelle Brooke Borgeke

We shall consider a result of Fel'dman, where a sharp Baker-type lower bound is obtained for linear forms in the values of some E-functions. Fel'dman's proof is based on an explicit construction of Pad\'e approximations of the first kind…

数论 · 数学 2017-04-07 Keijo Väänänen

A reasonably complete theory of the approximation of an irrational by rational fractions whose numerators and denominators lie in prescribed arithmetic progressions is developed in this paper. Results are both, on the one hand, from a…

数论 · 数学 2014-08-27 Faustin Adiceam

A conjecture predicting an injective and surjective mapping $X = \displaystyle\frac{\sigma(p^k)}{p^k}, Y = \displaystyle\frac{\sigma(m^2)}{m^2}$ between OPNs $N = {p^k}{m^2}$ (with Euler factor $p^k$) and rational points on the hyperbolic…

数论 · 数学 2013-10-17 Jose Arnaldo B. Dris