Relative entropy and waiting times for continuous-time Markov processes.
Chazottes, Jean-René, Giardina, Cristian, Redig, Frank (2006)
Electronic Journal of Probability [electronic only]
Similarity:
Chazottes, Jean-René, Giardina, Cristian, Redig, Frank (2006)
Electronic Journal of Probability [electronic only]
Similarity:
Florian Luca, Paul Pollack (2011)
Journal de Théorie des Nombres de Bordeaux
Similarity:
Let denote Euler’s totient function. A century-old conjecture of Carmichael asserts that for every , the equation has a solution . This suggests defining as the number of solutions to the equation . (So Carmichael’s conjecture asserts that always.) Results on are scattered throughout the literature. For example, Sierpiński conjectured, and Ford proved, that the range of contains every natural number . Also, the maximal order of has been investigated by Erdős and Pomerance....
Florian Luca, Ravindranathan Thangadurai (2009)
Journal de Théorie des Nombres de Bordeaux
Similarity:
For every positive integer let be the largest prime number . Given a positive integer , we study the positive integer such that if we define recursively for , then is a prime or . We obtain upper bounds for as well as an estimate for the set of whose takes on a fixed value .
Zbigniew Błocki (1992)
Annales Polonici Mathematici
Similarity:
We compute the constant sup : P a polynomial in , where S denotes the euclidean unit sphere in and σ its unitary surface measure.
Robert Černý, Silvie Mašková (2010)
Czechoslovak Mathematical Journal
Similarity:
Let be a bounded open set in , . In a well-known paper , 20, 1077–1092 (1971) Moser found the smallest value of such that We extend this result to the situation in which the underlying space is replaced by the generalized Zygmund space , the corresponding space of exponential growth then being given by a Young function which behaves like for large . We also discuss the case of an embedding into triple and other multiple exponential cases.
Nicolas Gouillon (2006)
Journal de Théorie des Nombres de Bordeaux
Similarity:
We give an explicit lower bound for linear forms in two logarithms. For this we specialize the so-called Schneider method with multiplicity described in []. We substantially improve the numerical constants involved in existing statements for linear forms in two logarithms, obtained from Baker’s method or Schneider’s method with multiplicity. Our constant is around instead of .