Divisor

About: Divisor is a research topic. Over the lifetime, 2462 publications have been published within this topic receiving 21394 citations. The topic is also known as: factor & submultiple.

On the divisor problem with congruence conditions

Abstract: Let $d(n; r_1, q_1, r_2, q_2)$ be the number of factorization $n=n_1n_2$ satisfying $n_i\equiv r_i\pmod{q_i}$ ($i=1,2$) and $\Delta(x; r_1, q_1, r_2, q_2)$ be the error term of the summatory function of $d(n; r_1, q_1, r_2, q_2)$ with $x\geq (q_1q_2)^{1+\varepsilon}, 1\leq r_i\leq q_i$, and $(r_i, q_i)=1$ ($i=1, 2$). We study the power moments and sign changes of $\Delta(x; r_1, q_1, r_2, q_2)$, and prove that for a sufficiently large constant $C$, $\Delta(q_1q_2x; r_1, q_1, r_2, q_2)$ changes sign in the interval $[T,T+C\sqrt{T}]$ for any large $T$. Meanwhile, we show that for a small constant $c'$, there exist infinitely many subintervals of length $c'\sqrt{T}\log^{-7}T$ in $[T,2T]$ where $\pm \Delta(q_1q_2x; r_1, q_1, r_2, q_2)> c_5x^\frac{1}{4}$ always holds.

Limits and power of the simplest uniform and self-stabilizing phase clock algorithm

Abstract: In this paper, the phase clock algorithm which stabilizes on general graphs is studied on anonymous rings. The authors showed that this K-clock algorithm works with K/spl ges/2D, where D is the diameter of the graph. We prove that this algorithm works on unidirectional (bidirectional) rings iff K satisfies K>K'K/K'+n(2K>2K'-K/K'+n, respectively) where K' is the greatest divisor of K (K'/spl ne/K) and n is the size of the ring. From this characterization, we show that any ring stabilizes with some K<2D if K is odd. We also prove that, if K is prime, unidirectional and bidirectional rings stabilize with K<2[n/2]/spl sime/D and K<2[n/3]/spl sime/4D/3, respectively. Finally, we generalize the algorithm to synchronize any ring with any clock value.

On Ranges of Variants of the Divisor Functions that are Dense

Abstract: For a real number $t$, let $s_t$ be the multiplicative arithmetic function defined by $\displaystyle{s_t(p^{\alpha})=\sum_{j=0}^{\alpha}(-p^t)^j}$ for all primes $p$ and positive integers $\alpha$. We show that the range of a function $s_{-r}$ is dense in the interval $(0,1]$ whenever $r\in(0,1]$. We then find a constant $\eta_A\approx1.9011618$ and show that if $r>1$, then the range of the function $s_{-r}$ is a dense subset of the interval $\displaystyle{\left(\frac{1}{\zeta(r)},1\right]}$ if and only if $r\leq \eta_A$. We end with an open problem.

A Class of Random Sequences for Key Generation.

Abstract: This paper investigates randomness properties of sequences derived from Fibonacci and Gopala-Hemachandra sequences modulo m for use in key distribution applications. We show that for sequences modulo a prime a binary random sequence B(n) is obtained based on whether the period is p-1 (or a divisor) or 2p+2 (or a divisor). For the more general case of arbitrary m, we use the property if the period is a multiple of 8 or not. The sequences for prime modulo have much better autocorrelation properties. These are good candidates for key distribution since the generation process is not computationally complex.

Reduction of divisors for classical superintegrable $GL(3)$ magnetic chain

Abstract: Variables of separation for classical $GL(3)$ magnetic chain obtained by Sklyanin form a generic positive divisor $D$ of degree $n$ on a genus $g$ non-hyperelliptic algebraic curve. Because $n>g$ this divisor $D$ has unique representative $\rho(D)$ in the Jacobian which can be constructed by using dim$|D|=n-g$ steps of Abel's algorithm. We study properties of the corresponding chain of divisors and prove that the classical $GL(3)$ magnetic chain is a superintegrable system with dim$|D|=2$ superintegrable Hamiltonians.