Related papers: An algorithmic proof of Bachet's conjecture and th…
In this work, we argue for the importance of causal reasoning in creating fair algorithms for decision making. We give a review of existing approaches to fairness, describe work in causality necessary for the understanding of causal…
Euler's theorem asserts that $A(n)=B(n)$ where $A(n)$ is the number of partitions of $n$ into distinct parts and $B(n)$ is the number of partitions of $n$ into odd parts. In this paper, it is proved that for $n>0$, \begin{align*}…
In this article we demonstrate how algorithmic probability theory is applied to situations that involve uncertainty. When people are unsure of their model of reality, then the outcome they observe will cause them to update their beliefs. We…
The usage of elementary submodels is a simple but powerful method to prove theorems, or to simplify proofs in infinite combinatorics. First we introduce all the necessary concepts of logic, then we prove classical theorems using elementary…
It is well known that the Euler method for a random ordinary differential equation $\mathrm{d}X_t/\mathrm{d}t = f(t, X_t, Y_t)$ driven by a stochastic process $\{Y_t\}_t$ with $\theta$-H\"older sample paths is estimated to be of strong…
This article presents new methodology for sample-based Bayesian inference when data are partitioned and communication between the parts is expensive, as arises by necessity in the context of "big data" or by choice in order to take…
We prove a unified and general criterion for the uniqueness of critical points of a functional in the presence of constraints such as positivity, boundedness, or fixed mass. Our method relies on convexity properties along suitable paths and…
In this article, we continue our investigation into the unique continuation properties of real-valued solutions to elliptic equations in the plane. More precisely, we make another step towards proving a quantitative version of Landis'…
It was claimed recently that a low order post-Newtonian (PN) Lagrangian formulation, which corresponds to the Euler-Lagrange equations up to an infinite PN order, can be identical to a PN Hamiltonian formulation at the infinite order from a…
Let $\mathscr{L}$ denote the $\mathbf{Q}$-vector space of logarithms of algebraic numbers. In this expository work, we provide an introduction to the study of ranks of matrices with coefficients in $\mathscr{L}$. We begin by considering a…
An extension of the Legendre transform to non-convex functions with vanishing Hessian as a mix of envelope and general solutions of the Clairaut equation is proposed. Applying this to systems with constraints, the procedure of finding a…
Lambek calculus is a logical foundation of categorial grammar, a linguistic paradigm of grammar as logic and parsing as deduction. Pentus (2010) gave a polynomial-time algorithm for determ- ining provability of bounded depth formulas in the…
This manuscript proposes a probabilistic framework for algorithms that iteratively solve unconstrained linear problems $Bx = b$ with positive definite $B$ for $x$. The goal is to replace the point estimates returned by existing methods with…
The fundamental problem of the calculus of variations on time scales concerns the minimization of a delta-integral over all trajectories satisfying given boundary conditions. In this paper we prove the second Euler-Lagrange necessary…
In the modern Bayesian view classical probability theory is simply an extension of conventional logic, i.e., a quantitative tool that allows for consistent reasoning in the presence of uncertainty. Classical theory presupposes, however,…
This paper presents some considerations about the Goldbach's conjecture (GC). The work is based on elementary results of the number theory and it provides a constructive method that permits, given an even integer, to find at least a pair of…
The aim of this paper is to present a new algorithm for proving mixed trigonometric-polynomial inequalities by reducing to polynomial inequalities. Finally, we show the great applicability of this algorithm and as examples, we use it to…
This chapter provides a overview of Bayesian inference, mostly emphasising that it is a universal method for summarising uncertainty and making estimates and predictions using probability statements conditional on observed data and an…
In this work, using the well-known mean-value theorem (Lagrange's theorem) we obtain an inequality for n-th order differential equations with retarded argument. If the retarded argument vanishes then the inequality turns to an inequality…
We prove necessary optimality conditions of Euler-Lagrange type for generalized problems of the calculus of variations on time scales with a Lagrangian depending not only on the independent variable, an unknown function and its delta…