Related papers: A streamlined proof of Goodwillie's n-excisive app…
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.
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…
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,…
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.
We provide a proof of the the Front-Door adjustment formula using the do-calculus.
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…
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…
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…
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…
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…
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$…
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.
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…
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…
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…
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…
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…
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…
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…