arXiv subjects
Publications and source records attributed to Jan-Christoph Schlage-Puchta.
We give a generalized and effective version of Bekehermes' improvement of Newman's Tauberian theorem. To do so we prove an effective version of the Riemann-Lebesgue Lemma for functions of bounded $p$-variation. We apply our Tauberian theorem to abstract analytic semigroups and prove a version of the prime number theorem as well as an estimate for Mertens' function with explicit error term.
Let $\mathcal{L}$ be the closure of the set of all real numbers $α$, such that there exist infinitely many integers $n$, such that $α=\log\frac{d(n+1)}{d(n)}$, where $d$ is the number of divisors of $n$. We give improved lower bounds for the density of $\mathcal{L}$.
Put $R=\F[[t_1, \ldots, t_d]])$. We estimate the number of normal subgroups of $\mathrm{SL}_2^1(\F[[t_1, \ldots, t_d]])$ for $p>2$, the number of ideals in the Lie algebra $\Lie(R)$, and the number of ideals in the associative algebra $R$.
We construct an algebra of dimension $2^{\aleph_0}$ consisting only of functions which in no point possess a finite one-sided derivative. We further show that some well known nowhere differentiable functions generate algebras, which contain functions which are differentiable at some points, but where for all functions in the algebra the set of points of differentiability is quite small.
We show that the set of prime numbers has exponential alternating complexity, proving a conjecture by Fijalkow. We further show that the set of squarefree integers has essentially maximal possible alternating complexity.
Hilberdink showed that there exists a constant $c_0>2$, such that there exists a continuous prim system satisfying $N(x)=c(x-1)+1$ if and only if $c\leq c_0$. Here we determine $c_0$ numerically to be $1.25479\cdot 10^{19}\pm2\cdot 10^{14}$. To do so we compute a representation for a twisted exponential function as a sum over the roots of the Riemann zeta function. We then give explicit bounds for the error obtained when restricting the occurring sum to a finite number of zeros.
Consider the differential equation $y'=F(x,y)$. We determine the weakest possible upper bound on $|F(x,y)-F(x,z)|$ which guarantees that this equation has for all initial values a unique solution, which exists globally.
Let $n, s, t$ be integers satisfying $(n,s,t)=1$. We classify all cases such that there is no integer $a$ with $n/2<as\bmod n+at\bmod n<3n/2$. This closes a gap in previous work of the author (Comment Math. Helv. 76, 501--505).
We determine the asymptotic behaviour of certain incomplete Betafunctions.
We consider the integral $\int_0^\infty\left(\frac{\sin x}{x}\right)^n\;dx$ as a function of the positive integer $n$. We show that there exists an asymptotic series in $\frac{1}{n}$ and compute the first terms of this series together with an explicit error bound.
We give a new proof of a theorem by P. Mihailescu which states that the equation $x^p-y^q=1$ is unsolvable with $x, y$ integral and $p, q$ odd primes, unless the congruences $p^q \equiv p\pmod{q^2}$ and $q^p\equiv q \pmod{p^2}$ hold.
We show that the number of isomorphism classes of quasiplatonic Riemann surfaces of genus $\,\le g\,$ has a growth of type $\,g^{\log g}\,$. The number of non--isomorphic regular dessins of genus $\,\le g\,$ has the same growth type.
Let $σ+iγ$ be a zero of the Riemann zeta function to the right of the line $\frac{1}{2}+it$. We show that this zero causes large oscillations of the error term of the prime number theorem. Our result is close to optimal both in terms of the magnitude and in the localization of large values for the error term.
We show that universal elliptic Carmichael numbers do not exist, answering a question of Silverman. Moreover, we show that the probability that an integer $n$, which is not a prime power, is an elliptic Carmichael number for a random curve $E$ with good reduction modulo $n$, is bounded above by $\mathcal{O}(\log^{-1} n)$. If we choose both $n$ and $E$ at random, the probability that $n$ is $E$-carmichael is bounded above by $\mathcal{O}(n^{-1/8+ε})$.
We show that an arithmetic function which satisfies some weak multiplicativity properties and in addition has a non-decreasing or $\log$-uniformly continuous normal order is close to a function of the form $n\mapsto n^c$. As an application we show that a finitely generated, residually finite, infinite group, whose normal growth has a non-decreasing or a $\log$-uniformly continuous normal order is isomorphic to $(\mathbb{Z}, +)$.
The maximal normal subgroup growth type of a finitely generated group is $n^{\log n}$. Very little is known about groups with this type of growth. In particular, the following is a long standing problem: Let $Γ$ be a group and $Δ$ a subgroup of finite index. Suppose $Δ$ has normal subgroup growth of type $n^{\log n}$, does $Γ$ has normal subgroup growth of type $n^{\log n}$? We give a positive answer in some cases, generalizing a result of Müller and the second author and a result of Gerdau. For instance, suppose $G$ is a profinite group and $H$ an open subgroup of $G$. We show that if $H$ is a generalized Golod-Shafarevich group, then $G$ has normal subgroup growth of type of $n^{\log n}$. We also use our methods to show that one can find a group with characteristic subgroup growth of type $n^{\log n}$.
The set of integers which can be written as the sum of four prime cubes has lower density at least $0.009664$. This improves earlier bounds of $0.003125$ by Ren and $0.005776$ by Liu.
We first show that a class of pro-$p$ branch groups including the Grigorchuk group and the Gupta-Sidki groups all have subgroup growth type $n^{\log n}$. We then introduce the notion of orbit growth and use it to construct extensions of the Grigorchuk group and the Gupta-Sidki groups. We compute the subgroup growth type of these extensions and deduce that all functions between $n^{(\log n)^2}$ and $e^n$ occur as the subgroup growth type of a pro-$p$ group, thus, giving almost complete answer to a question raised by Lubotzky and Segal.