We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure no-reply@cambridge.org
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
Using the special value at $u=1$ of Artin–Ihara L-functions, we associate to every $\mathbb {Z}$-cover of a finite connected graph a polynomial, which we call the Ihara polynomial. We show that the number of spanning trees for the finite intermediate graphs of such a cover can be expressed in terms of the Pierce–Lehmer sequence associated to a factor of the Ihara polynomial. This allows us to express the asymptotic growth of the number of spanning trees in terms of the Mahler measure of this polynomial. Specialising to the situation where the base graph is a bouquet or the dumbbell graph gives us back previous results in the literature for circulant and I-graphs (including the generalised Petersen graphs). We also express the p-adic valuation of the number of spanning trees of the finite intermediate graphs in terms of the p-adic Mahler measure of the Ihara polynomial. When applied to a particular $\mathbb {Z}$-cover, our result gives us back Lengyel’s calculation of the p-adic valuations of Fibonacci numbers.
We present a new version of a generalisation to elliptic nets of a theorem of Ward [‘Memoir on elliptic divisibility sequences’, Amer. J. Math.70 (1948), 31–74] on symmetry of elliptic divisibility sequences. Our results cover all that is known today.
The sequence $a( 1) ,a( 2) ,a( 3) ,\ldots, $ labelled A088431 in the Online Encyclopedia of Integer Sequences, is defined by: $a( n) $ is half of the $( n+1) $th component, that is, the $( n+2) $th term, of the continued fraction expansion of
Dimitri Hendriks has suggested that it is the sequence of run lengths of the paperfolding sequence, A014577. This paper proves several results for this summed paperfolding sequence and confirms Hendriks’s conjecture.
We show that $||q_n||_4/\sqrt {n}\rightarrow \sqrt [4]{2}$ almost surely as $n\to \infty $. This improves a result of Borwein and Lockhart (2001, Proceedings of the American Mathematical Society 129, 1463–1472), who proved the corresponding convergence in probability. Computer-generated numerical evidence for the a.s. convergence has been provided by Robinson (1997, Polynomials with plus or minus one coefficients: growth properties on the unit circle, M.Sc. thesis, Simon Fraser University). We indeed present two proofs of the main result. The second proof extends to cases where we only need to assume a fourth moment condition.
A set of integers greater than 1 is primitive if no member in the set divides another. Erdős proved in 1935 that the series
$f(A) = \sum _{a\in A}1/(a \log a)$
is uniformly bounded over all choices of primitive sets A. In 1986, he asked if this bound is attained for the set of prime numbers. In this article, we answer in the affirmative.
As further applications of the method, we make progress towards a question of Erdős, Sárközy and Szemerédi from 1968. We also refine the classical Davenport–Erdős theorem on infinite divisibility chains, and extend a result of Erdős, Sárközy and Szemerédi from 1966.
We consider sums involving the divisor function over nonhomogeneous (
$\beta \neq 0$
) Beatty sequences
$ \mathcal {B}_{\alpha ,\beta }:=\{[\alpha n+\beta ]\}_{n=1}^{\infty } $
and show that
where N is a sufficiently large integer,
$\alpha $
is of finite type
$\tau $
and
$\beta \neq 0$
. Previously, such estimates were only obtained for homogeneous Beatty sequences or for almost all
$\alpha $
.
In 1946, Erdős and Niven proved that no two partial sums of the harmonic series can be equal. We present a generalisation of the Erdős–Niven theorem by showing that no two partial sums of the series
$\sum _{k=0}^\infty {1}/{(a+bk)}$
can be equal, where a and b are positive integers. The proof of our result uses analytic and p-adic methods.
Let
$\pi $
be an automorphic irreducible cuspidal representation of
$\mathrm{GL}_{m}$
over
$\mathbb {Q}$
. Denoted by
$\lambda _{\pi }(n)$
the nth coefficient in the Dirichlet series expansion of
$L(s,\pi )$
associated with
$\pi $
. Let
$\pi _{1}$
be an automorphic irreducible cuspidal representation of
$\mathrm{SL}(2,\mathbb {Z})$
. Denoted by
$\lambda _{\pi _{1}\times \pi _{1}}(n)$
the nth coefficient in the Dirichlet series expansion of
$L(s,\pi _{1}\times \pi _{1})$
associated with
$\pi _{1}\times \pi _{1}$
. In this paper, we study the cancellations of
$\lambda _{\pi }(n)$
and
$\lambda _{\pi _{1}\times \pi _{1}}(n)$
over Beatty sequences.
The level of distribution of a complex-valued sequence $b$ measures the quality of distribution of $b$ along sparse arithmetic progressions $nd+a$. We prove that the Thue–Morse sequence has level of distribution $1$, which is essentially best possible. More precisely, this sequence gives one of the first nontrivial examples of a sequence satisfying a Bombieri–Vinogradov-type theorem for each exponent $\theta <1$. This result improves on the level of distribution $2/3$ obtained by Müllner and the author. As an application of our method, we show that the subsequence of the Thue–Morse sequence indexed by $\lfloor n^c\rfloor$, where $1 < c < 2$, is simply normal. This result improves on the range $1 < c < 3/2$ obtained by Müllner and the author and closes the gap that appeared when Mauduit and Rivat proved (in particular) that the Thue–Morse sequence along the squares is simply normal.
We prove irregularities in the distribution of prime numbers in any Beatty sequence ${\mathcal{B}}(\unicode[STIX]{x1D6FC},\unicode[STIX]{x1D6FD})$, where $\unicode[STIX]{x1D6FC}$ is a positive real irrational number of finite type.
Such a sequence is eventually periodic and we denote by $P(n)$ the maximal period of such sequences for given odd $n$. We prove a lower bound for $P(n)$ by counting certain partitions. We then estimate the size of these partitions via the multiplicative order of two modulo $n$.
Suppose $a^{2}(a^{2}+1)$ divides $b^{2}(b^{2}+1)$ with $b>a$. We improve a previous result and prove a gap principle, without any additional assumptions, namely $b\gg a(\log a)^{1/8}/(\log \log a)^{12}$. We also obtain $b\gg _{\unicode[STIX]{x1D716}}a^{15/14-\unicode[STIX]{x1D716}}$ under the abc conjecture.
Given a prime $p\geqslant 5$ and an integer $s\geqslant 1$, we show that there exists an integer $M$ such that for any quadratic polynomial $f$ with coefficients in the ring of integers modulo $p^{s}$, such that $f$ is not a square, if a sequence $(f(1),\ldots ,f(N))$ is a sequence of squares, then $N$ is at most $M$. We also provide some explicit formulas for the optimal $M$.
for $n\ges 0$. In this paper, we obtain the relation between the Jacobi continued fraction of the ordinary generating function of yn(q) and that of xn(q). We also prove that the transformation preserves q-TPr+1 (q-TP) property of the Hankel matrix $[x_{i+j}(q)]_{i,j \ges 0}$, in particular for r = 2,3, implying the r-q-log-convexity of the sequence $\{y_n(q)\}_{n\ges 0}$. As applications, we can give the continued fraction expressions of Eulerian polynomials of types A and B, derangement polynomials types A and B, general Eulerian polynomials, Dowling polynomials and Tanny-geometric polynomials. In addition, we also prove the strong q-log-convexity of derangement polynomials type B, Dowling polynomials and Tanny-geometric polynomials and 3-q-log-convexity of general Eulerian polynomials, Dowling polynomials and Tanny-geometric polynomials. We also present a new proof of the result of Pólya and Szegö about the binomial convolution preserving the Stieltjes moment property and a new proof of the result of Zhu and Sun on the binomial transformation preserving strong q-log-convexity.
We prove that for every sufficiently large integer $n$, the polynomial $1+x+x^{2}/11+x^{3}/111+\cdots +x^{n}/111\ldots 1$ is irreducible over the rationals, where the coefficient of $x^{k}$ for $1\leqslant k\leqslant n$ is the reciprocal of the decimal number consisting of $k$ digits which are each $1$. Similar results following from the same techniques are discussed.
Let [An,k]n,k⩾0 be an infinite lower triangular array satisfying the recurrence
for n ⩾ 1 and k ⩾ 0, where A0,0 = 1, A0,k = Ak,–1 = 0 for k > 0. We present some criteria for the log-concavity of rows and strong q-log-convexity of generating functions of rows. Our results can be applied to many well-known triangular arrays, such as the Pascal triangle, the Stirling triangle of the second kind, the Bell triangle, the large Schröder triangle, the Motzkin triangle, and the Catalan triangles of Aigner and Shapiro, in a unified approach. In addition, we prove that the binomial transformation not only preserves the strong q-log-convexity property, but also preserves the strong q-log-concavity property. Finally, we demonstrate that the strong q-log-convexity property is preserved by the Stirling transformation and Whitney transformation of the second kind, which extends some known results for the strong q-log-convexity property.
A Littlewood polynomial is a polynomial in $\mathbb{C}\left[ z \right]$ having all of its coefficients in $\{-1,1\}$. There are various old unsolved problems, mostly due to Littlewood and Erdős, that ask for Littlewood polynomials that provide a good approximation to a function that is constant on the complex unit circle, and in particular have small ${{L}^{q}}$ normon the complex unit circle. We consider the Fekete polynomials
where $p$ is an odd prime and $(.|p)$ is the Legendre symbol (so that ${{z}^{-1}}{{f}_{p}}(z)$ is a Littlewood polynomial). We give explicit and recursive formulas for the limit of the ratio of ${{L}^{q}}$ and ${{L}^{2}}$ norm of ${{f}_{p}}$ when $q$ is an even positive integer and $p\to \infty $. To our knowledge, these are the first results that give these limiting values for specific sequences of nontrivial Littlewood polynomials and infinitely many $q$. Similar results are given for polynomials obtained by cyclically permuting the coefficients of Fekete polynomials and for Littlewood polynomials whose coefficients are obtained from additive characters of finite fields. These results vastly generalise earlier results on the ${{L}^{4}}$ norm of these polynomials.
We present an elementary method for studying the problem of getting an asymptotic formula that is better than Hooley's and Heath-Brown's results for certain cases.
A set A of positive integers is a Bh-set if all the sums of the form a1 + . . . + ah, with a1,. . .,ah ∈ A and a1 ⩽ . . . ⩽ ah, are distinct. We provide asymptotic bounds for the number of Bh-sets of a given cardinality contained in the interval [n] = {1,. . .,n}. As a consequence of our results, we address a problem of Cameron and Erdős (1990) in the context of Bh-sets. We also use these results to estimate the maximum size of a Bh-sets contained in a typical (random) subset of [n] with a given cardinality.