Related papers: The 3x+1 problem: a lower bound hypothesis
We present a new lower bound on the differential entropy rate of stationary processes whose sequences of probability density functions fulfill certain regularity conditions. This bound is obtained by showing that the gap between the…
The dynamics of the second order rational difference equation $\displaystyle{z_{n+1}=\frac{\alpha + \alpha z_{n}+\beta z_{n-1}}{1+z_{n}}}$ with complex parameters $\alpha$, $\beta$ and arbitrary complex initial conditions is investigated.…
We consider the well-known problem of the computation of the (limiting) time-dependent performance characteristics of one-dimensional continuous-time birth and death processes on $\mathbb{Z}$ with time varying and possible state-dependent…
General upper bounds on fluctuations of trajectory observables were recently obtained. It turned out that the size of fluctuations of dynamical observable is limited from below and from above. For the moment generating function of general…
One of the first and easy to use techniques for proving run time bounds for evolutionary algorithms is the so-called method of fitness levels by Wegener. It uses a partition of the search space into a sequence of levels which are traversed…
The upper bound on the capacity of a 3-node discrete memoryless relay channel is considered, where a source X wants to send information to destination Y with the help of a relay Z. Y and Z are independent given X, and the link from Z to Y…
The purpose of this paper is to introduce the idea of triangular Ramsey numbers and provide values as well as upper and lower bounds for them. To do this, the combinatorial game Mines is introduced; after some necessary theorems about…
We consider the stability problem for a unitary N+1 fermionic model, i.e., a system of $N$ identical fermions interacting via zero-range interactions with a different particle, in the case of infinite two-body scattering length. We present…
We investigate a moving boundary problem for a Brownian particle on the semi-infinite line in which the boundary moves by a distance proportional to the time between successive collisions of the particle and the boundary. Phenomenologically…
Extending previous analyses on function classes like linear functions, we analyze how the simple (1+1) evolutionary algorithm optimizes pseudo-Boolean functions that are strictly monotone. Contrary to what one would expect, not all of these…
We study a recursion that generates real sequences depending on a parameter $x$. Given a negative $x$ the growth of the sequence is very difficult to estimate due to canceling terms. We reduce the study of the recursion to a problem about a…
We give a generalization of Collatz conjecture or 3n+1 problem on 2-adic completion of Q. A isometric of $Q_2$ provides information on the average behavior of the firsts terms of the sequence according to the class of $u_0$ modulo $2^m$. A…
This paper explores the use of the standard approach for proving runtime bounds in discrete domains---often referred to as drift analysis---in the context of optimization on a continuous domain. Using this framework we analyze the (1+1)…
Recently, several bounds have been obtained on the number of solutions to congruences of the type $$ (x_1+s)...(x_{\nu}+s)\equiv (y_1+s)...(y_{\nu}+s)\not\equiv0 \pmod p $$ modulo a prime $p$ with variables from some short intervals. Here,…
This paper proposes a formula expression for the well-known Collatz conjecture (or 3x+1 problem), which can pinpoint all the growth points in the orbits of the Collatz map for any natural numbers. The Collatz map $Col: \mathcal{N}+1…
We prove existence and uniqueness of solutions of a large class of initial-boundary-value problems characterized by a quasi-linear third order equation (the third order term being dissipative) on a finite space interval with Dirichlet,…
We analyze the asymptotic behavior of sequences of random variables defined by an initial condition, a stationary and ergodic sequence of random matrices, and an induction formula involving multiplication is the so-called max-plus algebra.…
Dickson's Lemma is a simple yet powerful tool widely used in termination proofs, especially when dealing with counters or related data structures. However, most computer scientists do not know how to derive complexity upper bounds from such…
We study random compositions of transformations having certain uniform fiberwise properties and prove bounds which in combination with other results yield a quenched central limit theorem equipped with a convergence rate, also in the…
We use stack words to find a new, simple proof for the best known upper bound for the number of 3-stack sortable permutations of a given length. This is the first time that stack words are used to obtain such a result.