On Certain Divisor Functions in Short Intervals
Aleksandar Ivić (1994)
Publications de l'Institut Mathématique
Similarity:
Displaying similar documents to “On the symmetry of the divisor function in almost all short intervals”
On Certain Divisor Functions in Short Intervals
On the divisor problem: Moments of Δ(x) over short intervals
Werner Georg Nowak (2003)
Acta Arithmetica
Similarity:
A short account of the history of mathematics
Walter William Rouse Ball
Similarity:
On the Distribution of Prime Divisors on n. (Short Communication).
P. Erdös (1968)
Aequationes mathematicae
Similarity:
Division - a systematic search for true digits
Milosav M. Marjanović (2005)
The Teaching of Mathematics
Similarity:
Awareness, belief, and communication reaching consensus.
Fukuda, Emiko, Matsuhisa, Takashi, Sasanuma, Hisato (2004)
Journal of Applied Mathematics and Decision Sciences
Similarity:
The future or graphical communication education in the new South Africa.
Pretorius, Johann (1999)
Journal for Geometry and Graphics
Similarity:
Cesàro means related to the square of the divisor function
Gintautas Bareikis, Algirdas Mačiulis (2012)
Acta Arithmetica
Similarity:
On fluctuations in the mean of a sum-of-divisors function
Y.-F. S. Pétermann (2004)
Acta Arithmetica
Similarity:
Note on almost additive functions. (Short Communication).
Roman Ger (1977)
Aequationes mathematicae
Similarity:
On the symmetry of divisor sums functions in almost all short intervals.
Coppola, G. (2004)
Integers
Similarity:
On Single-Product Functions with Rotational Symmetry (Short Communication)
R.L. HALL (1971)
Aequationes mathematicae
Similarity:
Communication Complexity And Linearly Ordered Sets
Mieczysław Kula, Małgorzata Serwecińska (2015)
Annales Mathematicae Silesianae
Similarity:
The paper is devoted to the communication complexity of lattice operations in linearly ordered finite sets. All well known techniques ([4, Chapter 1]) to determine the communication complexity of the infimum function in linear lattices disappoint, because a gap between the lower and upper bound is equal to O(log2 n), where n is the cardinality of the lattice. Therefore our aim will be to investigate the communication complexity of the function more carefully. We consider a family of...