Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Johannes F. Morgenbesser"'
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AQ,..., Iss Proceedings (2012)
In this paper infinite systems of functional equations in finitely or infinitely many random variables arising in combinatorial enumeration problems are studied. We prove sufficient conditions under which the combinatorial random variables encoded in
Externí odkaz:
https://doaj.org/article/1973a48f493c49dba472afc69714f60c
Autor:
Johannes F. Morgenbesser, Thomas Stoll
Publikováno v:
Proceedings of the American Mathematical Society
Proceedings of the American Mathematical Society, American Mathematical Society, 2013, 141 (7), pp.2289-2297. ⟨10.1090/S0002-9939-2013-11751-X⟩
Proceedings of the American Mathematical Society, American Mathematical Society, 2013, 141 (7), pp.2289-2297. ⟨10.1090/S0002-9939-2013-11751-X⟩
For a fixed prime $p$, let $e_p(n!)$ denote the order of $p$ in the prime factorization of $n!$. Chen and Liu (2007) asked whether for any fixed $m$, one has $\{e_p(n^2!) \bmod m:\; n\in\mathbb{Z}\}=\mathbb{Z}_m$ and $\{e_p(q!) \bmod m:\; q {prime}\}
Publikováno v:
Journal of Fourier Analysis and Applications
Journal of Fourier Analysis and Applications, Springer Verlag, 2013, 19 (2), pp.225-250. ⟨10.1007/s00041-012-9246-1⟩
Journal of Fourier Analysis and Applications, Springer Verlag, 2013, 19 (2), pp.225-250. ⟨10.1007/s00041-012-9246-1⟩
International audience; Number systems with a rational number $a/b > 1$ as base have gained interest in recent years. In particular, relations to Mahler's $3/2$-problem as well as the Josephus problem have been established. In the present paper we sh
Publikováno v:
Journal of Number Theory. 132:1837-1866
The main goal of this paper is to study the behavior of subsequences uc={u(⌊nc⌋):n∈N} of automatic sequences u that are indexed by ⌊nc⌋ for some c>1. In particular we show that the densities of the letters of uc are precisely the same as th
Publikováno v:
Israel Journal of Mathematics. 190:157-193
We consider compact group generalizations T(n) of the Thue-Morse sequence and prove that the subsequence T(n2) is uniformly distributed with respect to a measure gv that is absolutely continuous with respect to the Haar measure. The proof is based on
Autor:
Johannes F. Morgenbesser
Publikováno v:
The Ramanujan Journal. 27:43-70
Let q=−a±i and denote by s q the complex sum-of-digits function. We show that the sequence (αs q (p)) running over all Gaussian primes lying in a circular sector is uniformly distributed modulo 1 if and only if α is irrational. Moreover, we prov
Refining previously known estimates, we give large-strike asymptotics for the implied volatility of Merton's and Kou's jump diffusion models. They are deduced from call price approximations by transfer results of Gao and Lee. For the Merton model, we
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fb7966a6e7ded36515d95a1b162cedd9
http://arxiv.org/abs/1401.1954
http://arxiv.org/abs/1401.1954
Publikováno v:
Discrete Mathematics and Theoretical Computer Science
23rd International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'12)
23rd International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'12), 2012, Montreal, Canada. pp.453-478
23rd International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'12)
23rd International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'12), 2012, Montreal, Canada. pp.453-478
In this paper infinite systems of functional equations in finitely or infinitely many random variables arising in combinatorial enumeration problems are studied. We prove sufficient conditions under which the combinatorial random variables encoded in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b098b4d300ead15c126b28ecbe04ed1a
https://hal.inria.fr/hal-01197227
https://hal.inria.fr/hal-01197227
Autor:
Johannes F. Morgenbesser
Publikováno v:
Discrete Mathematics and Theoretical Computer Science
21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10)
21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10), 2010, Vienna, Austria. pp.513-526
21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10)
21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10), 2010, Vienna, Austria. pp.513-526
Infinite systems of equations appear naturally in combinatorial counting problems. Formally, we consider functional equations of the form $\mathbf{y} (x)=F(x,\mathbf{y} (x))$, where $F(x,\mathbf{y} ):\mathbb{C} \times \ell^p \to \ell^p$ is a positive
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ce255d92f7786ed25bdc99c227f43853
https://hal.inria.fr/hal-01185580/document
https://hal.inria.fr/hal-01185580/document
Autor:
Johannes F. Morgenbesser
Publikováno v:
Journal of Number Theory. (7):1433-1469
We consider the complex sum-of-digits function s q for squares with respect to special bases q of a canonical number system in the Gaussian integers Z [ i ] . In particular, we show that the sequence ( α s q ( z 2 ) ) z ∈ Z [ i ] is uniformly dist