Related papers: A Randomized Version of the Collatz $3x + 1$ Probl…
The Randomized Kaczmarz Algorithm is a randomized method which aims at solving a consistent system of over determined linear equations. This note discusses how to find an optimized randomization scheme for this algorithm, which is related…
The 3x+ 1 problem concerns iteration of the map on the integers given by T(n) = (3n+1)/2 if n is odd; T(n) = n/2 if n is even. The 3x+1 Conjecture asserts that for every positive integer n > 1 the forward orbit of n under iteration by T…
The representation of numbers in rational base $p/q$ was introduced in 2008 by Akiyama, Frougny & Sakarovitch, with a special focus on the case $p/q=3/2$. Unnoticed since then, natural questions related to representations in that specific…
In this paper, we show that any proof of the Collatz 3n+1 Conjecture must have an infinite number of lines; therefore, no formal proof is possible.
We give a short proof of Belaga's result on bounds to perigees of $(3x+d)$-cycles of a given oddlength. We also reformulate the Collatz cycle conjecture which is rather a algorithmic problem into a purely arithmetic problem.
In this paper we are shown the following facts: The probability of increased $ A_{k}=P(T^{k} (x_{0})>T^{k-1} (x_{0})) $, and the probability of decrease $B_{k}=P(T^{k} (x_{0})<T^{k-1} (x_{0}))$ in step $ k $ of a Collataz procedure…
We improve on Gonek-Montgomery's quantitative version of Kronecker's approximation theorem.
We prove an improved form of an expectation of Polya and discuss several related questions
This article presents a coupling approach for the approximation of iterated stochastic integrals of length three. The generation of such integrals is the central problem of higher-order pathwise approximations for SDEs, which still lacks a…
In this paper I present a 3SAT algorithm based on the randomized algorithm of Papadimitriou from 1991, and Schoning from 1991. We also present strong arguments that this algorithm finds a solution (if it exists) for a 3SAT problem with high…
We propose a stochastic optimization method for the minimization of the sum of three convex functions, one of which has Lipschitz continuous gradient as well as restricted strong convexity. Our approach is most suitable in the setting where…
We present a deterministic polynomial-time algorithm that solves the 3-satisfiability problem.
A major problem in evaluating stochastic local search algorithms for NP-complete problems is the need for a systematic generation of hard test instances having previously known properties of the optimal solutions. On the basis of…
We here elaborate on a quantitative argument to support the validity of the Collatz conjecture, also known as the (3x + 1) or Syracuse conjecture. The analysis is structured as follows. First, three distinct fixed points are found for the…
In this invited contribution, we revisit the stochastic shortest path problem, and show how recent results allow one to improve over the classical solutions: we present algorithms to synthesize strategies with multiple guarantees on the…
In this paper we give stochastic solutions of conformable fractional Cauchy problems. The stochastic solutions are obtained by running the processes corresponding to Cauchy problems with a nonlinear deterministic clock.
In the Collatz 3x+1 problem, there are 3 possibilities: Starting from any positive number, we either reach the trivial loop (1,4,2), end up in a non-trivial loop, or go until infinity. In this paper, we shall show that if a non-trivial loop…
We study distributed optimization problems over a network when the communication between the nodes is constrained, and so information that is exchanged between the nodes must be quantized. This imperfect communication poses a fundamental…
A variational equation of the third order in three-dimensional space is proposed which describes autoparallel curves of some connection.
By first solving the equation $x^3+y^3+z^3=k$ with fixed $k$ for $z$ and then considering the distance to the nearest integer function of the result, we turn the sum of three cubes problem into an optimisation one. We then apply three…