Related papers: A Mathematical Proof of Dodgson's Algorithm

We consider controllability for divergence-free systems that have a conserved quantity and satisfy a H\"ormander condition. It is shown that such systems are controllable, provided that the conserved quantity is a proper function. The proof…

The existence of a (p-)optimal propositional proof system is a major open question in (proof) complexity; many people conjecture that such systems do not exist. Krajicek and Pudlak (1989) show that this question is equivalent to the…

In this note, we give an alternate proof of the multinomial theorem using a probabilistic approach. Although the multinomial theorem is basically a combinatorial result, our proof may be simpler for a student familiar with only basic…

Proving programs terminating is a fundamental computer science challenge. Recent research has produced powerful tools that can check a wide range of programs for termination. The analog for probabilistic programs, namely termination with…

We propose a new approach to explain Bayesian Networks. The approach revolves around a new definition of a probabilistic argument and the evidence it provides. We define a notion of independent arguments, and propose an algorithm to extract…

This paper proposes uni-orthogonal and bi-orthogonal nonnegative matrix factorization algorithms with robust convergence proofs. We design the algorithms based on the work of Lee and Seung [1], and derive the converged versions by utilizing…

The direct or algorithmic approach for the Jacobian problem, consisting of the direct construction of the inverse polynomials is proposed. The so called principle and derived Jacobi conditions are proposed and discussed. The algorithmic…

The features of a logically sound approach to a theory of statistical reasoning are discussed. A particular approach that satisfies these criteria is reviewed. This is seen to involve selection of a model, model checking, elicitation of a…

We study a posterior sampling approach to efficient exploration in constrained reinforcement learning. Alternatively to existing algorithms, we propose two simple algorithms that are more efficient statistically, simpler to implement and…

We give an algorithmic proof of Pick's theorem which calculates the area of a lattice-polygon in terms of the lattice-points.

This article introduces an adaptive sorting algorithm that can relocate elements accurately by substituting their values into a function which we name it the guessing function. We focus on building this function which is the mapping…

The paper introduces a generalization for known probabilistic models such as log-linear and graphical models, called here multiplicative models. These models, that express probabilities via product of parameters are shown to capture…

We use G\"{o}del's Dialectica interpretation to produce a computational version of the well known proof of Ramsey's theorem by Erd\H{o}s and Rado. Our proof makes use of the product of selection functions, which forms an intuitive…

Solution methods for linear equation systems in a commutative ring are discussed. Four methods are compared, in the setting of several different rings: Dodgson's method [1], Bareiss's method [2] and two methods of the author - method by…

We propose a constructive proof for the Ambrosetti-Rabinowitz Mountain Pass Theorem providing an algorithm, based on a bisection method, for its implementation. The efficiency of our algorithm, particularly suitable for problems in high…

We give a formal Laurent series proof of Andrews's $q$-Dyson Conjecture, first proved by Zeilberger and Bressoud.

We consider the problem of approximating a given element $f$ from a Hilbert space $\mathcal{H}$ by means of greedy algorithms and the application of such procedures to the regression problem in statistical learning theory. We improve on the…

In this paper we propose several strategies for the exact computation of the determinant of a rational matrix. First, we use the Chinese Remaindering Theorem and the rational reconstruction to recover the rational determinant from its…

In this research, an optimal algorithm for the Collatz conjecture is presented. Properties such as the convergence of the algorithm and an equation that relates the algorithm to the classical Collatz conjecture are obtained. It is validated…

In this paper we present a combinatorial proof of Selberg's integral formula. We start by giving a bijective proof of a Theorem about the number of topological orders of a certain related directed graph. Selberg's Integral Formula then…