On the density maxima of a function
James Foran (1977)
Colloquium Mathematicae
Similarity:
James Foran (1977)
Colloquium Mathematicae
Similarity:
Rzepecka, Genowefa (2015-12-08T07:20:54Z)
Acta Universitatis Lodziensis. Folia Mathematica
Similarity:
Guillaume Bordes (2005)
Acta Arithmetica
Similarity:
David Lubell (1971)
Acta Arithmetica
Similarity:
Michał Lorens (1974)
Annales Polonici Mathematici
Similarity:
Tom Sanders (2011)
Acta Arithmetica
Similarity:
Václav Kijonka (2007)
Acta Mathematica Universitatis Ostraviensis
Similarity:
In this paper it is discus a relation between -density and -density. A generalization of Šalát’s result concerning this relation in the case of asymptotic density is proved.
K. Ciesielski, K. Ostaszewski (1990)
Forum mathematicum
Similarity:
Wilczyński, Władysław
Similarity:
Oto Strauch, Janos T. Toth (2002)
Acta Arithmetica
Similarity:
K. Ciesielski, L. Larson (1991)
Fundamenta Mathematicae
Similarity:
The ℑ-density topology on ℝ is a refinement of the natural topology. It is a category analogue of the density topology [9, 10]. This paper is concerned with ℑ-density continuous functions, i.e., the real functions that are continuous when the ℑ-densitytopology is used on the domain and the range. It is shown that the family of ordinary continuous functions f: [0,1]→ℝ which have at least one point of ℑ-density continuity is a first category subset of C([0,1])= f: [0,1]→ℝ: f is continuous...
Uri Andrews, Mingzhong Cai, David Diamondstone, Carl Jockusch, Steffen Lempp (2016)
Fundamenta Mathematicae
Similarity:
Let r ∈ [0,1]. A set A ⊆ ω is said to be coarsely computable at density r if there is a computable function f such that {n | f(n) = A(n)} has lower density at least r. Our main results are that A is coarsely computable at density 1/2 if A is computably traceable or truth-table reducible to a 1-random set. In the other direction, we show that if a degree a is hyperimmune or PA, then there is an a-computable set which is not coarsely computable at any positive density.
Krysicki, Włodzimierz (2015-10-31T10:04:12Z)
Acta Universitatis Lodziensis. Folia Mathematica
Similarity:
Rita Giuliano Antonini, Georges Grekos (2005)
Colloquium Mathematicae
Similarity:
We give an extension of Benford's law (first digit problem) by using the concept of conditional density, introduced by Fuchs and Letta. The main tool is the notion of regular subset of integers.