Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · math/0604511

On The Discrepancy of Quasi-progressions

Sujith Vijay
View original source ↗Read source document ↗Export metadata ↓

Abstract

The 2-colouring discrepancy of arithmetic progressions is a well-known problem in combinatorial discrepancy theory. In 1964, Roth proved that if each integer from 0 to N is coloured red or blue, there is some arithmetic progression in which the number of reds and the number of blues differ by at least (1/20) N^{1/4}. In 1996, Matousek and Spencer showed that this estimate is sharp up to a constant. The analogous question for homogeneous arithmetic progressions (i.e., the ones containing 0) was raised by Erdos in the 1930s, and it is still not known whether the discrepancy is unbounded. However, it is easy to construct partial colourings with density arbitrarily close to 1 such that all homogeneous arithmetic progressions have bounded discrepancy. A related problem concerns the discrepancy of quasi-progressions. A quasi-progression consists of successive multiples of a real number, with each multiple rounded down to the nearest integer. In 1986, Beck showed that given any 2-colouring, the quasi-progressions corresponding to almost all real numbers in (1, \infty) have discrepancy at least log* N, the inverse of the tower function. We improve the lower bound to (log N)^{1/4 - o(1)}, and also show that there is some quasi-progression with discrepancy at least (1/50) N^{1/6}. Our results remain valid even if the 2-colouring is replaced by a partial colouring of positive density.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sujith Vijay. 2006-04-24. On The Discrepancy of Quasi-progressions. https://arxiv.org/abs/math/0604511

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗