Related papers: Discrepancy One among Homogeneous Arithmetic Progr…

A graph has \emph{diameter} D if every pair of vertices are connected by a path of at most D edges. The Diameter-D Augmentation problem asks how to add the a number of edges to a graph in order to make the resulting graph have diameter D.…

In 1975 Szemer\'edi proved that a set of integers of positive upper density contains arbitrarily long arithmetic progressions. Bergelson and Leibman showed in 1996 that the common difference of the arithmetic progression can be a square, a…

We prove that the size of the product set of any finite arithmetic progression $\mathcal{A}\subset \mathbb{Z}$ satisfies \[|\mathcal A \cdot \mathcal A| \ge \frac{|\mathcal A|^2}{(\log |\mathcal A|)^{2\theta +o(1)} } ,\] where…

Let $S$ and $D$ each be a set of orthogonal line segments in the plane. A line segment $s\in S$ \emph{stabs} a line segment $s'\in D$ if $s\cap s'\neq\emptyset$. It is known that the problem of stabbing the line segments in $D$ with the…

Answering an informal question of K. Park, we show that by fixing some irrational alpha to have a particular standard continued fraction expansion, we may force the associated discrepancy sequences for all x in [0,1), which track the…

Let $ (H_s(n))_{n \geq 1} $ be an $s-$dimensional generalized Halton's sequence. Let $\emph{D}^{*}_N$ be the discrepancy of the sequence $ (H_s(n) )_{n = 1}^{N} $. It is known that $D^{*}_{N} =O(\ln^s N)$ as $N \to \infty $. In this paper,…

We determine the order of magnitude of H(x,y,z), the number of integers n\le x having a divisor in (y,z], for all x,y and z. We also study H_r(x,y,z), the number of integers n\le x having exactly r divisors in (y,z]. When r=1 we establish…

In this paper, we prove a $p$-Hardy inequality on the discrete half-line with weights $n^{\alpha}$ for all real $p > 1$. Building on the work of Miclo for $p = 2$ and Muckenhoupt in the continuous settings, we develop a quantitative…

We aim to fill a gap in the proof of an inequality relating two exponents of uniform Diophantine approximation stated in a paper by Bugeaud. We succeed to verify the inequality in several instances, in particular for small dimension.…

The L_2-discrepancy measures the irregularity of the distribution of a finite point set. In this note we prove lower bounds for the L_2 discrepancy of arbitrary N-point sets. Our main focus is on the two-dimensional case. Asymptotic upper…

Let $s(n)$ be the number of different remainders $n \bmod k$, where $1 \leq k \leq \lfloor n/2 \rfloor$. This rather natural sequence is sequence A283190 in the OEIS and while some basic facts are known, it seems that surprisingly it has…

We say that the set of $y$-smooth numbers $\mathcal{S}(N,y)$ up to $N$ is super smooth if $y=\log^KN$ for a large fixed constant $K$. We show that the Roth's theorem on arithmetic progressions is true in super smooth numbers case. This…

In this paper, we study the strong convergence of an algorithm to solve the variational inequality problem which extends(Thong et al, Numerical Algorithms. 78, 1045-1060 (2018)). We have reduced and refined some of their algorithm's…

I show that a trivial modification of a standard proof of the Roth's Theorem on triples in arithmetic progression would lead to the following Theorem: If A is a "large set" that is its elements are monotone increasing integers and the sum…

For a fixed digraph $\mathbb H$, the $\mathbb H$-coloring problem is the problem of deciding whether a given input digraph $\mathbb G$ admits a homomorphism to $\mathbb H$. The CSP dichotomy conjecture of Feder and Vardi is equivalent to…

We give an elementary proof of a somewhat curious result, namely, that deciding whether a convex function is self-concordant is in general an intractable problem.

In many combinatorial problems one may need to model the diversity or similarity of assignments in a solution. For example, one may wish to maximise or minimise the number of distinct values in a solution. To formulate problems of this…

Suppose $A\subset \mathbb{R}$ of size $k$ has distinct consecutive $r$--differences, that is for $1 \leq i \leq k -r$, the $r$--tuples $$(a_{i+1} - a_i , \ldots , a_{i+r} - a_{i + r -1})$$ are distinct. Then for any finite $B \subset…

The Discrepancy of a hypergraph is the minimum attainable value, over two-colorings of its vertices, of the maximum absolute imbalance of any hyperedge. The Hereditary Discrepancy of a hypergraph, defined as the maximum discrepancy of a…

In 1978, Schaefer proved his famous dichotomy theorem for generalized satisfiability problems. He defined an infinite number of propositional satisfiability problems (nowadays usually called Boolean constraint satisfaction problems) and…