Related papers: Transition mean values of real characters

Let $\chi=\chi_q$ be a primitive character mod $q$ and fix $\Delta>0$. In 1989 Graham and Ringrose gave strong bounds on character sums $\sum_{M<n\leq M+N} \chi(n)$ in intervals of length $N=q^\Delta$ whenever $q$ is squarefree and is…

Let $q\geqslant2$ be an integer, $\chi$ be any non-principal character mod $q$, and $H=H(q)\leqslant q.$ In this paper the authors prove some estimates for character sums of the form…

Many consensus string problems are based on Hamming distance. We replace Hamming distance by the more flexible (e.g., easily coping with different input string lengths) dynamic time warping distance, best known from applications in time…

Among the various procedures used to detect potential changes in a stochastic process the moving sum algorithms are very popular due to their intuitive appeal and good statistical performance. One of the important design parameters of a…

We use character theory and character estimates to show that the number of $T_2$-systems of $A_n$ is at least \begin{equation*} \frac{1}{8n\sqrt{3}}\exp\left(\frac{2\pi}{\sqrt{6}}n^{1/2}\right)(1+o(1)). \end{equation*} Applying this result,…

In this paper we consider transformation formulas for \[ B\left( z,s:\chi\right) =\sum\limits_{m=1}^{\infty}\sum\limits_{n=0} ^{\infty}\chi(m)\chi(2n+1)\left( 2n+1\right) ^{s-1}e^{\pi im(2n+1)z/k}. \] We derive reciprocity theorems for the…

We explore the algebraic properties of a generalized version of the iterated-sums signature, inspired by previous work of F.~Kir\'aly and H.~Oberhauser. In particular, we show how to recover the character property of the associated linear…

We study how well a real number can be approximated by sums of two or more rational numbers with denominators up to a certain size.

In this work we consider sums of primes that converging very slow. We set as a base, a reformulation of analytic prime number theorem and we use the values of Riemann Zeta function for the approximation. We also give the truncation error of…

Let $p$ be an odd prime. Using I. M. Vinogradov's bilinear estimate, we present an elementary approach to estimate nontrivially the character sum $$ \sum_{x\in H}\chi(x+a),\qquad a\in\Bbb F_p^*, $$ where $H<\Bbb F_p^*$ is a multiplicative…

Let $x_1,\ldots,x_n$ be a fixed sequence of real numbers. At each stage, pick two indices $I$ and $J$ uniformly at random and replace $x_I$, $x_J$ by $(x_I+x_J)/2$, $(x_I+x_J)/2$. Clearly all the coordinates converge to…

In this article, the complete moment convergence for the partial sum of moving average processes $\{X_n=\sum_{i=-\infty}^{\infty}a_iY_{i+n},n\ge 1\}$ is estabished under some proper conditions, where $\{Y_i,-\infty<i<\infty\}$ is a sequence…

Let phi(n) be Euler's totient function and let sigma(n) be the sum of the positive divisors of n. We show that most phi-values (integers in the range of phi) are not sigma-values and vice versa.

Binomial coefficients have been used for centuries in a variety of fields and have accumulated numerous definitions. In this paper, we introduce a new way of defining binomial coefficients as repeated sums of ones. A multitude of binomial…

We show that when projecting an edge-transitive N-dimensional polytope onto anM-dimensional subspace of R^N, the sums of the squares of the original and projected edges are in the ratio N=M.

In this paper we study the mean values of some multiplicative functions connected with the divisor function on the short interval of summation. The asymptocic values for such mean values are proved.

As a generalization of the sum of digits function and other digital sequences, sequences defined as the sum of the output of a transducer are asymptotically analyzed. The input of the transducer is a random integer in $[0, N)$. Analogues in…

In this paper we consider a variation of the classical Tur\'{a}n-type extremal problems. Let $S$ be an $n$-term graphical sequence, and $\sigma(S)$ be the sum of the terms in $S$. Let $H$ be a graph. The problem is to determine the smallest…

It is observed that in some money exchange operations, the applied $n$ -variable mean $M$ should be self reciprocally-conjugate, i.e. it should satisfy the equality \[ M\left( x_{1},\ldots,x_{n}\right) M\left(…

Knowing which strings in a massive text are significant -- that is, which strings are common and distinct from other strings -- is valuable for several applications, including text compression and tokenization. Frequency in itself is not…