arXiv subjects

T. Stoll

Publications and source records attributed to T. Stoll.

5 recordsLinked to original sources

arXiv2012

Real-time simulation of finite frequency noise from a single electron emitter

We study the real-time emission of single electrons from a quantum dot coupled to a one dimensional conductor, using exact diagonalization on a discrete tight-binding chain. We show that from the calculation of the time-evolution of the one electron states, we have a simple access to all the relevant physical quantities in the system. In particular, we are able to compute accurately the finite frequency current autocorrelation noise. The method which we use is general and versatile, allowing to study the impact of many different parameters like the dot transparency or level position. Our results can be directly compared with existing experiments, and can also serve as a basis for future calculations including electronic interactions using the time dependent density-matrix renormalisation group and other techniques based on tight-binding models.

cond-mat.mes-hall↗

arXiv2011

On a problem of Chen and Liu concerning the prime power factorization of $n!$

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}\}=\mathbb{Z}_m$. We answer these two questions and show asymptotic formulas for $# \{n<x: n \equiv a \bmod d,\; e_p(n^2!)\equiv r \bmod m\}$ and $# \{q<x: q {prime}, q \equiv a \bmod d,\; e_p(q!)\equiv r \bmod m\}$. Furthermore, we show that for each $h\geq 3$, we have $\{n<x: n \equiv a \bmod d,\; e_p(n^h!)\equiv r \bmod m\} \gg x^{4/(3h+1)}$.

math.NT↗

arXiv2010

Stolarsky's conjecture and the sum of digits of polynomial values

Let $s_q(n)$ denote the sum of the digits in the $q$-ary expansion of an integer $n$. In 1978, Stolarsky showed that $$ \liminf_{n\to\infty} \frac{s_2(n^2)}{s_2(n)} = 0. $$ He conjectured that, as for $n^2$, this limit infimum should be 0 for higher powers of $n$. We prove and generalize this conjecture showing that for any polynomial $p(x)=a_h x^h+a_{h-1} x^{h-1} + ... + a_0 \in \Z[x]$ with $h\geq 2$ and $a_h>0$ and any base $q$, \[ \liminf_{n\to\infty} \frac{s_q(p(n))}{s_q(n)}=0.\] For any $ε> 0$ we give a bound on the minimal $n$ such that the ratio $s_q(p(n))/s_q(n) < ε$. Further, we give lower bounds for the number of $n < N$ such that $s_q(p(n))/s_q(n) < ε$.

math.NT↗

arXiv2010

The sum of digits of $n$ and $n^2$

Let $s_q(n)$ denote the sum of the digits in the $q$-ary expansion of an integer $n$. In 2005, Melfi examined the structure of $n$ such that $s_2(n) = s_2(n^2)$. We extend this study to the more general case of generic $q$ and polynomials $p(n)$, and obtain, in particular, a refinement of Melfi's result. We also give a more detailed analysis of the special case $p(n) = n^2$, looking at the subsets of $n$ where $s_q(n) = s_q(n^2) = k$ for fixed $k$.

math.NT↗

arXiv2009

Bounds for the discrete correlation of infinite sequences on k symbols and generalized Rudin-Shapiro sequences

Motivated by the known autocorrelation properties of the Rudin-Shapiro sequence, we study the discrete correlation among infinite sequences over a finite alphabet, where we just take into account whether two symbols are identical. We show by combinatorial means that sequences cannot be "too" different, and by an explicit construction generalizing the Rudin-Shapiro sequence, we show that we can achieve the maximum possible difference.

math.CO↗