Related papers: Note on Prime Gaps and Zero Spacings
Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. In the context of a branch-and-bound framework for solving these packing problems to optimality, it is…
Given two points in the plane, and a set of "obstacles" given as curves through the plane with assigned weights, we consider the point-separation problem, which asks for the minimum-weight subset of the obstacles separating the two points.…
This article derives lower bounds on the supremal (strict) p-negative type of finite metric spaces using purely elementary techniques. The bounds depend only on the cardinality and the (scaled) diameter of the underlying finite metric…
In this paper we discuss various special problems on packing and covering. Among others we survey the problems and results concerning finite arrangements, Minkowskian, saturated, compact, and totally separable packings. We discuss shortest…
The point placement problem is to determine the positions of a set of $n$ distinct points, P = {p1, p2, p3, ..., pn}, on a line uniquely, up to translation and reflection, from the fewest possible distance queries between pairs of points.…
In this paper, we show some results about the gap between a prime number and its consecutive prime number for large enough prime numbers. We show that the gap between a prime number $p_n$ and its consecutive prime number is not larger than…
One field of particular interest in Number Theory concerns the gaps between consecutive primes. Within the last few years, very important results have been achieved on how small these gaps can be. The strongest of these results were…
We introduce a new probabilistic model of the primes consisting of integers that survive the sieving process when a random residue class is selected for every prime modulus below a specific bound. From a rigorous analysis of this model, we…
We prove that a positive proportion of the gaps between consecutive primes are short gaps of length less than any fixed fraction of the average spacing between primes.
This paper considers pairs of optimization problems that are defined from a single input and for which it is desired to find a good approximation to either one of the problems. In many instances, it is possible to efficiently find an…
The Bandwidth Problem seeks for a simultaneous permutation of the rows and columns of the adjacency matrix of a graph such that all nonzero entries are as close as possible to the main diagonal. This work focuses on investigating novel…
New exceptional (i.e. non-repeating) prime number multiplets are given and formulated in terms of arithmetic progressions, along with laws governing them. Accompanying repeating prime number multiplets are pointed out. Prime number…
We collect some open problems about minimal presentations of numerical semigroups and, more generally, about defining ideals and free resolutions of their semigroup rings and associated graded rings. We emphasize both long-standing problems…
We obtain upper bounds on the number of finite sets $\mathcal S$ of primes below a given bound for which various $2$ variable $\mathcal S$-unit equations have a solution.
We obtain optimal lower and upper bounds for the (additive) integrality gaps of integer knapsack problems. In a randomised setting, we show that the integrality gap of a "typical" knapsack problem is drastically smaller than the integrality…
We show that the existence of arithmetic progressions with few primes, with a quantitative bound on "few", implies the existence of larger gaps between primes less than x than is currently known unconditionally. In particular, we derive…
In the past few decades there has been a good deal of papers which are concerned with optimization problems in different areas of mathematics (along 0-1 words, finite or infinite) and which yield - sometimes quite unexpectedly - balanced…
We study sharp frame bounds of Gabor systems over rectangular lattices for different windows and integer oversampling rate. In some cases we obtain optimality results for the square lattice, while in other cases the lattices optimizing the…
The paper focuses on some versions of connected dominating set problems: basic problems and multicriteria problems. A literature survey on basic problem formulations and solving approaches is presented. The basic connected dominating set…
In this paper several examples of gaps (lacunes) between dimensions of maximal and submaximal symmetric models are considered, which include investigation of number of independent linear and quadratic integrals of metrics and counting the…