Related papers: The 3x+1 problem: a lower bound hypothesis
We investigate the order $\rho$ of the four entire functions in the Nevanlinna matrix of an indeterminate Hamburger moment sequence. We give an upper estimate for $\rho$ which is explicit in terms of the parameters of the canonical system…
First, we give a closed-form formula for first passage time of a reflected Brownian motion with drift. This modifies a formula by Perry et al (2004). Second, we show that the maximum before a fixed drawdown is exponentially distributed for…
We show that over the class of linear orders with additional binary relations satisfying some monotonicity conditions, monadic first-order logic has the three-variable property. This generalizes (and gives a new proof of) several known…
Bounds on the entropy of patterns of sequences generated by independently identically distributed (i.i.d.) sources are derived. A pattern is a sequence of indices that contains all consecutive integer indices in increasing order of first…
It is shown that the first $n$ prime numbers $p_1,...,p_n$ determine the next one by the recursion equation $$ p_{n+1} =\lim\limits_{s\to +\infty} [\prod\limits^n_{k=1} (1-\frac{1}{p^s_k}) \sum\limits^\infty_{j=1} \frac{1}{j^s} -1]^{-1/s}.…
A lower time bound $\Omega(\min(\nu(x), n-\nu(x))$ for counting the number of ones in a binary input word $x$ of length $n$ is presented, where $\nu(x)$ is the number of ones. The operations available are increment, decrement, bit-wise…
We give the proof of a tight lower bound on the probability that a binomial random variable exceeds its expected value. The inequality plays an important role in a variety of contexts, including the analysis of relative deviation bounds in…
For any odd positive integer $x$, define $(x_n)_{n\geqslant 0} $ and $(a_n )_{n\geqslant 1} $ by setting $x_{0}=x, \,\, x_n =\cfrac{3x_{n-1} +1}{2^{a_n }}$ such that all $x_n $ are odd. The 3x+1 problem asserts that there is an $x_n =1$ for…
In this note, we are interested in obtaining uniform upper bounds for the number of powerful numbers in short intervals $(x, x + y]$. We obtain unconditional upper bounds $O(\frac{y}{\log y})$ and $O(y^{11/12})$ for all powerful numbers and…
A suite of three evolution systems is presented in the framework of the 3+1 formalism. The first one is of second order in space derivatives and has the same causal structure of the Baumgarte-Shapiro-Shibata-Nakamura (BSSN) system for a…
We explore singular second-order boundary value problems with mixed boundary conditions on a general time scale. Using the lower and upper solutions method combined with the Brouwer fixed point theorem we demonstrate the existence of a…
We study the Escape Problem for discrete-time linear dynamical systems over compact semialgebraic sets. We establish a uniform upper bound on the number of iterations it takes for every orbit of a rational matrix to escape a compact…
The work takes another look at the number of runs that a string might contain and provides an alternative proof for the bound. We also propose another stronger conjecture that states that, for a fixed order on the alphabet, within every…
Obtaining lower bounds for NP-hard problems has for a long time been an active area of research. Recent algebraic techniques introduced by Jonsson et al. (SODA 2013) show that the time complexity of the parameterized SAT($\cdot$) problem…
We consider optimal stopping problems, in which a sequence of independent random variables is drawn from a known continuous density. The objective of such problems is to find a procedure which maximizes the expected reward; this is often…
This paper is devoted to study the existence of solutions and the monotone method of second-order periodic boundary value problems when the lower and upper solutions $\alpha$ and $\beta$ violate the boundary conditions $…
Based on an optimal rate wavelet series representation, we derive a local modulus of continuity result with a refined almost sure upper bound for fractional Brownian motion. \sloppy The obtained upper bound of the small fractional Brownian…
We prove some new results on existence of solutions to first--order ordinary differential equations with deviating arguments. Delay differential equations are included in our general framework, which even allows deviations to depend on the…
We bound the number of permutations with a fixed number $r$ of $321 \ominus p_0$ patterns by a constant times the number of permutations which avoid $321 \ominus p_0$. We use this new upper bound to show that the ordinary generating…
We improve the upper bound for the maximum possible number of stable matchings among $n$ jobs and $n$ applicants from $131072^n+O(1)$ to $3.55^n+O(1)$. To establish this bound, we state a novel formulation of a certain entropy bound that is…