Related papers: Bounds for the 3x+1 Problem using Difference Inequ…
We show that there are sets of $n$ points in the plane with $n$ arbitrarily large that contain more than $n^{1.014}$ pairs of points separated by a distance exactly $1$. This improves on very recent work of a team at OpenAI, who proved the…
A classic result of Cook et al. (1986) bounds the distances between optimal solutions of mixed-integer linear programs and optimal solutions of the corresponding linear relaxations. Their bound is given in terms of the number of variables…
Let $T(n)=\left\{\begin{array}{ll}3n+1&(n\hbox{ odd})\frac n2&(n\hbox{ even})\end{array}\right.$ ($n\in\mathbb Z$). We call "the orbit of the integer $n$", the set $$ \mathcal O_n:=\{m\in\mathbb Z\;:\;\exists k\ge0,\ m=T^k(n)\} $$ and we…
In 2001 Thunder gave an estimate for the number of integer solutions of decomposable form inequalities under the assumption that the forms are of finite type. The purpose of this article is to generalize this result to forms which are of…
We consider the problem of identifying n points in the plane using disks, i.e., minimizing the number of disks so that each point is contained in a disk and no two points are in exactly the same set of disks. This problem can be seen as an…
We improve the best known upper bound for the bracketing number of $d$-dimensional axis-parallel boxes anchored in $0$ (or, put differently, of lower left orthants intersected with the $d$-dimensional unit cube $[0,1]^d$). More precisely,…
Taking a new approach towards analyzing the Collatz Problem, or, 3x+1 conjecture. Introducing some new functions, the Collatz-2 and Collatz-3 sequences, as well as deducing results related to Collatz-2 and Collatz-3 sequences.
This paper presents some new inequalities, the most important of which is the inequality given in Theorem 2.1. It can solve a class of inequalities by a unified method. An important application of the inequality given in Theorem 2.1 is to…
The $3x+1$ problem, also called the Collatz conjecture, is a very interesting unsolved mathematical problem related to computer science. This paper generalized this problem by relaxing the constraints, i.e., generalizing this deterministic…
The 3x+1 semigroup is the multiplicative semigroup generated by the rational numbers of form (2k+1)/(3k+2) for non-negative k, together with 2. This semigroup encodes backward iteration under the 3x+1 map, and the 3x+1 conjecture implies…
We design new approximation algorithms for the Multiway Cut problem, improving the previously known factor of 1.32388 [Buchbinder et al., 2013]. We proceed in three steps. First, we analyze the rounding scheme of Buchbinder et al., 2013 and…
We describe a large-scale computational experiment to study structure in the numbers of real solutions to osculating instances of Schubert problems. This investigation uncovered Schubert problems whose computed numbers of real solutions…
The paper describes several applications of information inequalities to problems in database theory. The problems discussed include: upper bounds of a query's output, worst-case optimal join algorithms, the query domination problem, and the…
This short note describes the tentative form of a finite-dimensional optimization problem that may be of use in a second-generation proof of the Kepler conjecture. In the original 1998 proof of the Kepler conjecture, the form of the…
We report on a new 3D numerical code designed to solve the Einstein equations for general vacuum spacetimes. This code is based on the standard 3+1 approach using cartesian coordinates. We discuss the numerical techniques used in developing…
Experimenters report an upper limit if the signal they are trying to detect is non-existent or below their experiment's sensitivity. Such experiments may be contaminated with a background too poorly understood to subtract. If the background…
In the multiway cut problem, we are given an undirected graph with non-negative edge weights and a collection of $k$ terminal nodes, and the goal is to partition the node set of the graph into $k$ non-empty parts each containing exactly one…
In this paper, we study quantum query complexity of the following rather natural tripartite generalisations (in the spirit of the 3-sum problem) of the hidden shift and the set equality problems, which we call the 3-shift-sum and the…
In the paper, some special linear combinations of the terms of rational cycles of generalized Collatz sequences are studied. It is proved that if the coefficients of the linear combinations satisfy some conditions then these linear…
We investigate the boundedness of solutions of the first order linear difference equation of the form $x_{n+1} = Ax_{n} + y_{n}, \; n \geq 1$ where $A$ is a square matrix with complex entries, sequence $\{y_{n}\}_{n\geq 1}$ and initial…