Related papers: Bounds for the 3x+1 Problem using Difference Inequ…
We derive a new first-order formulation for Einstein's equations which involves fewer unknowns than other first-order formulations that have been proposed. The new formulation is based on the 3+1 decomposition with arbitrary lapse and…
We study the integrality gap of convex mixed-integer programs, that is, the difference between the optimal value of such a problem and the optimal value of its continuous relaxation. We study classes of convex sets whose associated…
Understanding the limits of quantum theory in terms of uncertainty and correlation has always been a topic of foundational interest. Surprisingly this pursuit can also bear interesting applications such as device-independent quantum…
Often some interesting or simply curious points are left out when developing a theory. It seems that one of them is the existence of an upper bound for the fraction of area of a convex and closed plane area lying outside a circle with which…
Let $p$ and $q$ be two distinct fixed prime numbers and $(n_i)_{i\geq 0}$ the sequence of consecutive integers of the form $p^a\cdot q^b$ with $a,b\ge 0$. Tijdeman gave a lower bound (1973) and an upper bound (1974) for the gap size…
The $3x+1$ problem concerns the iteration of the map $T:\mathbb{Z}\to\mathbb{Z}$ defined by $T(x)=x/2$ for even $x$ and $T(x)=(3x+1)/2$ for odd $x$. We study the \emph{coefficient stopping time} dynamics of $T$ (in the sense of Terras) by…
We improve the upper bound of the following inequalities for the gamma function $\Gamma$ due to H. Alzer and the author. \begin{equation*}…
A neat 1972 result of Pohl asserts that [3n/2]-2 comparisons are sufficient, and also necessary in the worst case, for finding both the minimum and the maximum of an n-element totally ordered set. The set is accessed via an oracle for…
Grothendieck inequalities are fundamental inequalities which are frequently used in many areas of mathematics and computer science. They can be interpreted as upper bounds for the integrality gap between two optimization problems: a…
We obtain new upper and lower bounds on the number of unit perimeter triangles spanned by points in the plane. We also establish improved bounds in the special case where the point set is a section of the integer grid.
In 1921 Blichfeldt gave an upper bound on the number of integral points contained in a convex body in terms of the volume of the body. More precisely, he showed that $#(K\cap\Z^n)\leq n! \vol(K)+n$, whenever $K\subset\R^n$ is a convex body…
For relatively prime positive integers u_0 and r, we consider the arithmetic progression {u_k := u_0+k*r} (0 <= k <= n). Define L_n := lcm{u_0,u_1,...,u_n} and let a >= 2 be any integer. In this paper, we show that, for integers alpha,r >=…
The $3x+1$ Conjecture asserts that the $T$-orbit of every positive integer $x$ contains $1$, where $T$ maps $x$ to $x/2$ for $x$ even and to $(3x+1)/2$ for $x$ odd. Several authors have studied the analogous map, $T_q$, which maps $x\in…
We discuss three convolution inequalities that are connected to additive combinatorics. Cloninger and the second author showed that for nonnegative $f \in L^1(-1/4, 1/4)$, $$ \max_{-1/2 \leq t \leq 1/2} \int_{\mathbb{R}}{f(t-x) f(x) dx}…
We consider the following problem: Given a rational matrix $A \in \setQ^{m \times n}$ and a rational polyhedron $Q \subseteq\setR^{m+p}$, decide if for all vectors $b \in \setR^m$, for which there exists an integral $z \in \setZ^p$ such…
We present an algorithm for computing upper bounds for the Online Bin Stretching Problem with a small number of bins and the resulting upper bounds for 4, 5 and 6 bins. This both demonstrates the possibility of using computer search for…
In this paper, we consider the one-to-one correspondence between a 2-adic integer and its parity sequence under iteration of the so-called "3x+1" map. First, we prove a new formula for the inverse transform. Next, we briefly review what is…
Counting integer points in large convex bodies with smooth boundaries containing isolated flat points is oftentimes an intermediate case between balls (or convex bodies with smooth boundaries having everywhere positive curvature) and cubes…
A method to compute guaranteed lower bounds to the eigenvalues of the Maxwell system in two or three space dimensions is proposed as a generalization of the method of Liu and Oishi [SIAM J. Numer. Anal., 51, 2013] for the Laplace operator.…
Large-scale eigenvalue problems arise in various fields of science and engineering and demand computationally efficient solutions. In this study, we investigate the subspace approximation for parametric linear eigenvalue problems, aiming to…