Related papers: Discrepancy results for the Van der Corput sequenc…

Let \sigma(n) = \sum_{d \mid n}d be the usual sum-of-divisors function. In 1933, Davenport showed that that n/\sigma(n) possesses a continuous distribution function. In other words, the limit D(u):= \lim_{x\to\infty} \frac{1}{x}\sum_{n \leq…

We show that $n$ is almost perfect if and only if $I(n) - 1 < D(n) \leq I(n)$, where $I(n)$ is the abundancy index of $n$ and $D(n)$ is the deficiency of $n$. This criterion is then extended to the case of integers $m$ satisfying $D(m)>1$.

In 1930s Paul Erdos conjectured that for any positive integer $C$ in any infinite $\pm 1$ sequence $(x_n)$ there exists a subsequence $x_d, x_{2d}, x_{3d},\dots, x_{kd}$, for some positive integers $k$ and $d$, such that $\mid \sum_{i=1}^k…

In the present paper we prove several results concerning the existence of low-discrepancy point sets with respect to an arbitrary non-uniform measure $\mu$ on the $d$-dimensional unit cube. We improve a theorem of Beck, by showing that for…

Using the discrepancy metric, we analyze the rate of convergence of a random walk on the circle generated by d rotations, and establish sharp rates that show that badly approximable d-tuples in R^d give rise to walks with the fastest…

We study the extreme $L_p$ discrepancy of infinite sequences in the $d$-dimensional unit cube, which uses arbitrary sub-intervals of the unit cube as test sets. This is in contrast to the classical star $L_p$ discrepancy, which uses…

Let $D$ be an oriented graph. The inversion of a set $X$ of vertices in $D$ consists in reversing the direction of all arcs with both ends in $X$. The inversion number of $D$, denoted by ${\rm inv}(D)$, is the minimum number of inversions…

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…

We give a construction of an absolutely normal real number $x$ such that for every integer $b $ greater than or equal to $2$, the discrepancy of the first $N$ terms of the sequence $(b^n x \mod 1)_{n\geq 0}$ is of asymptotic order…

We prove an asymptotic formula for the sum $\sum_{n \leq N} d(n^2 - 1)$, where $d(n)$ denotes the number of divisors of $n$. During the course of our proof, we also furnish an asymptotic formula for the sum $\sum_{d \leq N} g(d)$, where…

Let $s_2$ be the sum-of-digits function in base $2$, which returns the number of non-zero binary digits of a nonnegative integer $n$. We study $s_2$ alon g arithmetic subsequences and show that --- up to a shift --- the set of $m$-tuples of…

We show that Nederlof's algorithm [Information Processing Letters, 118 (2017), 15-16] for constructing a proof that the number of subsets summing to a particular integer equals a claimed quantity is flawed because: 1) its consistence is not…

We consider the inexact Newton methods $$ x_{n+1}^\d=x_n^\d-g_{\a_n}(F'(x_n^\d)^* F'(x_n^\d)) F'(x_n^\d)^* (F(x_n^\d)-y^\d) $$ for solving nonlinear ill-posed inverse problems $F(x)=y$ using the only available noise data $y^\d$ satisfying…

Estimating the discrepancy of the hypergraph of all arithmetic progressions in the set $[N]=\{1,2,\hdots,N\}$ was one of the famous open problems in combinatorial discrepancy theory for a long time. An extension of this classical hypergraph…

We study integrals of the form $\int_{\Omega}f\left( d\omega_1 , \ldots , d\omega_m \right), $ where $m \geq 1$ is a given integer, $1 \leq k_{i} \leq n$ are integers and $\omega_{i}$ is a $(k_{i}-1)$-form for all $1 \leq i \leq m$ and $…

We prove that in all dimensions n at least 3, for every integer N there exists a distribution of points of cardinality $ N$, for which the associated discrepancy function D_N satisfies the estimate an estimate, of sharp growth rate in N, in…

We prove a deviation bound for the maximum of partial sums of functions of $\alpha$-dependent sequences as defined in Dedecker, Gou{\"e}zel and Merlev{\`e}de (2010). As a consequence, we extend the Rosenthal inequality of Rio (2000) for…

For any simple digraph $D$ we offer a new proof for the intersection number of its middle digraph, $M(D)$; while doing so we also solve for the intersection number when $D$ has loops. In addition, a new transformation, the union of $D$ and…

Let $C\subset\mathbb{R}^2$ be a convex body, and for a positive integer $N$, let $\mathcal{P}$ be a configuration of $N$ points in $[0,1)^2$. The discrepancy of $\mathcal{P}$ with respect to $C$ is defined by \begin{equation*}…

We give an extension of a criterion of van der Corput on uniform distribution of sequences. Namely, we prove that a sequence $x_n$ is uniformly distributed modulo 1 if it is weakly monotonic and satisfies the conditions $\Delta^2x_n\to…