Related papers: The 3x+1 problem: a lower bound hypothesis

Let $A_1, A_2, \ldots, A_n$ be events in a sample space. Given the probability of the intersection of each collection of up to $k+1$ of these events, what can we say about the probability that at least $r$ of the events occur? This question…

We introduce linear programs encoding regular expressions of finite languages. We show that, given a language, the optimum value of the associated linear program is a lower bound on the size of any regular expression of the language.…

We present new lower and upper bounds for the compression rate of binary prefix codes optimized over memoryless sources according to two related exponential codeword length objectives. The objectives explored here are exponential-average…

We study solutions to the equation $a+b=c$, where $a,b,c$ form a triple of coprime natural numbers. The $abc$ conjecture asserts that, for any $\epsilon>0$, such triples satisfy $\mathrm{rad}(abc) \ge c^{1-\epsilon}$ with finitely many…

We demonstrate that the number of cycles for two problems of the family of generalized 3x+1 mappings is possible finite.

First-order probabilistic models combine representational power of first-order logic with graphical models. There is an ongoing effort to design lifted inference algorithms for first-order probabilistic models. We analyze lifted inference…

Let ${\mathcal D}(n)$ be the maximal determinant for $n \times n$ $\{\pm 1\}$-matrices, and $\mathcal R(n) = {\mathcal D}(n)/n^{n/2}$ be the ratio of ${\mathcal D}(n)$ to the Hadamard upper bound. Using the probabilistic method, we prove…

We estimate the frequency of singular matrices and of matrices of a given rank whose entries are parametrised by arbitrary polynomials over the integers and modulo a prime $p$. In particular, in the integer case, we improve a recent bound…

In this paper, we introduce a novel technique for constrained submodular maximization, inspired by barrier functions in continuous optimization. This connection not only improves the running time for constrained submodular maximization but…

Using a method we have utilized previously, namely through a finite power series expansion which also sometimes is known as the "radix polynomial" representation of an integer, we find an upper bound for a van der Waerden number that has a…

From known effective bounds on the prime counting function of the form \[ |\pi(x)-\mathrm{Li}(x)| < a \;x \;(\ln x)^{b} \; \exp\left(-{c}\; \sqrt{\ln x}\right); \qquad (x \geq x_0); \] it is possible to establish exponentially tight…

Set out here are some fundamental theories that may be regarded as newly discovered metamathematics of the odd integers in relation to the Collatz conjecture (also called the 3x+1 problem). Originally motivated by the requirement to invent…

We analyze the stopping-time and cycle structure of the normalized Collatz iteration. Using a recursive description of admissible binary sequences, we show that every integer $m \equiv 3 \pmod{4}$ arises uniquely and derive new bounds for…

We derive information-theoretic converses (i.e., lower bounds) for the minimum time required by any algorithm for distributed function computation over a network of point-to-point channels with finite capacity, where each node of the…

Consider the set of all sequences of $n$ outcomes, each taking one of $m$ values, that satisfy a number of linear constraints. If $m$ is fixed while $n$ increases, most sequences that satisfy the constraints result in frequency vectors…

We consider a variant on the Tetranacci sequence, where one adds the previous four terms, then divides the sum by two until the result is odd. We give an algorithm for constructing "initially division-poor" sequences, where over an initial…

A set of energy-momentum constraint-preserving boundary conditions is proposed for the first-order Z4 case. The stability of a simple numerical implementation is tested in the linear regime (robust stability test), both with the standard…

We develop a new analysis for the length of controlled bad sequences in well-quasi-orderings based on Higman's Lemma. This leads to tight multiply-recursive upper bounds that readily apply to several verification algorithms for…

This paper presents new lower and upper bounds for the optimal compression of binary prefix codes in terms of the most probable input symbol, where compression efficiency is determined by the nonlinear codeword length objective of…

The existence of greatest lower bounds in the imbalance order of path-length sequences of binary trees is seen to be a consequence of a joint monotonicity property of the greater and lower expension operations. Path length sequences that…