Related papers: An algorithmic proof of Bachet's conjecture and th…
In this paper we affirm Br\"{u}ck conjecture provided $f$ is of hyper-order less than one by studying the infinite hyper-order of solutions of a complex differential equation.
Decision theories offer principled methods for making choices under various types of uncertainty. Algorithms that implement these theories have been successfully applied to a wide range of real-world problems, including materials and drug…
A theorem, usually attributed to Barr, yields that (A) geometric implications deduced in classical L_{\infty\omega} logic from geometric theories also have intuitionistic proofs. Barr's theorem is of a topos-theoretic nature and its proof…
We discuss the notion of reduction of a special type of explicit solutions which generalize the solutions appearing in the classical Laplace cascade method of integration of hyperbolic equations of the second order in the plane. We give…
In the seminal book M\'echanique analitique, Lagrange, 1788, the notion of a Lagrange multiplier was first introduced in order to study a smooth minimization problem subject to equality constraints. The idea is that, under some regularity…
In this paper, we solve in the convergence set, the fractional logistic equation making use of Euler's numbers. To our knowledge, the answer is still an open question. The key point is that the coefficients can be connected with Euler's…
We give a new proof for a theorem of Ehrhart regarding the quasi-polynomiality of the function that counts the number of integer points in the integral dilates of a rational polytope. The proof involves a geometric bijection,…
An outlier is a datapoint that is set apart from a sample population. The outlier theorem in algorithmic information theory states that given a computable sampling method, outliers must appear. We present a simple proof to the outlier…
Bertrand's paradox is a famous problem of probability theory, pointing to a possible inconsistency in Laplace's principle of insufficient reason. In this article we show that Bertrand's paradox contains two different problems: an "easy"…
We consider the problem of computing the Euler characteristic of an abstract simplicial complex given by its vertices and facets. We show that this problem is #P-complete and present two new practical algorithms for computing Euler…
It is an original method based on systems of prameters represented by reals which obey to an infinite descent (convergent sequences). We define calculus of quotients and they conduct quickly to a consequent result. Our own scepticism made…
The aim of this note is to provide a simple proof of some well-known identities and recurrences relating classical Bernoulli and Euler numbers by using the Abel sum of the divergent series $\sum_{n=0}^\infty (-1)^{n} (n+1)^k$, $k$ a…
Set out here are some fundamental theories that may be regarded as newly discovered metamathematics of the odd integers in relation to the Collatz conjecture (also called the 3x+1 problem). Originally motivated by the requirement to invent…
This paper discusses limitations of reflexive and diagonal arguments as methods of proof of limitative theorems (e.g. G\"odel's theorem on Entscheidungsproblem, Turing's halting problem or Chaitin-G\"odel's theorem). The fact, that a formal…
In this paper, we study the problems of minimizing a functional depending on the Caputo fractional derivative of order $0< \alpha \leq 1$ and the Riemann- Liouville fractional integral of order $\beta >0$ under certain constraints. A…
Recent results by Harrow et. al. and by Ta-Shma, suggest that quantum computers may have an exponential advantage in solving a wealth of linear algebraic problems, over classical algorithms. Building on the quantum intuition of these…
In a recent work, Andrews gave analytic proofs of two conjectures concerning some variations of two combinatorial identities between partitions of a positive integer into odd parts and partitions into distinct parts discovered by Beck.…
We present an algorithm for a class of statistical inference problems. The main idea is to reformulate the inference problem as an optimization procedure, based on the generation of surrogate (auxiliary) functions. This approach is…
The structure of the Euler-Lagrange equations for a general Lagrangian theory is studied. For these equations we present a reduction procedure to the so-called canonical form. In the canonical form the equations are solved with respect to…
We prove the existence of minimizers of causal variational principles on second countable, locally compact Hausdorff spaces. Moreover, the corresponding Euler-Lagrange equations are derived. The method is to first prove the existence of…