Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userThe asymptotic value of the Mahler measure of the Rudin-Shapiro polynomials
77
0
0.0
(
0
)
Authors
Tamas Erdelyi
Ask ChatGPT about the research
No Arabic abstract
In signal processing the Rudin-Shapiro polynomials have good autocorrelation properties and their values on the unit circle are small. Binary sequences with low autocorrelation coefficients are of interest in radar, sonar, and communication systems. In this paper we show that the Mahler measure of the Rudin-Shapiro polynomials of degree $n=2^k-1$ is asymptotically $(2n/e)^{1/2}$, as it was conjectured by B. Saffari in 1985. Our approach is based heavily on the Saffari and Montgomery conjectures proved recently by B. Rodgers.
rate research
Read More
Let either $R_k(t) := |P_k(e^{it})|^2$ or $R_k(t) := |Q_k(e^{it})|^2$, where $P_k$ and $Q_k$ are the usual Rudin-Shapiro polynomials of degree $n-1$ with $n=2^k$. In a recent paper we combined close to sharp upper bounds for the modulus of the autocorrelation coefficients of the Rudin-Shapiro polynomials with a deep theorem of Littlewood to prove that there is an absolute constant $A>0$ such that the equation $R_k(t) = (1+eta )n$ has at least $An^{0.5394282}$ distinct zeros in $[0,2pi)$ whenever $eta$ is real and $|eta| < 2^{-11}$. In this paper we show that the equation $R_k(t)=(1+eta)n$ has at least $(1/2-|eta|-varepsilon)n/2$ distinct zeros in $[0,2pi)$ for every $eta in (-1/2,1/2)$, $varepsilon > 0$, and sufficiently large $k geq k_{eta,varepsilon}$.
We consider the class of Rudin-Shapiro-like polynomials, whose $L^4$ norms on the complex unit circle were studied by Borwein and Mossinghoff. The polynomial $f(z)=f_0+f_1 z + cdots + f_d z^d$ is identified with the sequence $(f_0,f_1,ldots,f_d)$ of its coefficients. From the $L^4$ norm of a polynomial, one can easily calculate the autocorrelation merit factor of its associated sequence, and conversely. In this paper, we study the crosscorrelation properties of pairs of sequences associated to Rudin-Shapiro-like polynomials. We find an explicit formula for the crosscorrelation merit factor. A computer search is then used to find pairs of Rudin-Shapiro-like polynomials whose autocorrelation and crosscorrelation merit factors are simultaneously high. Pursley and Sarwate proved a bound that limits how good this combined autocorrelation and crosscorrelation performance can be. We find infinite families of polynomials whose performance approaches quite close to this fundamental limit.
Borwein and Mossinghoff investigated the Rudin-Shapiro-like sequences, which are infinite families of binary sequences, usually represented as polynomials. Each family of Rudin-Shapiro-like sequences is obtained from a starting sequence (which we call the seed) by a recursive construction that doubles the length of the sequence at each step, and many sequences produced in this manner have exceptionally low aperiodic autocorrelation. Borwein and Mossinghoff showed that the asymptotic autocorrelation merit factor for any such family is at most $3$, and found the seeds of length $40$ or less that produce the maximum asymptotic merit factor of $3$. The definition of Rudin-Shapiro-like sequences was generalized by Katz, Lee, and Trunov to include sequences with arbitrary complex coefficients, among which are families of low autocorrelation polyphase sequences. Katz, Lee, and Trunov proved that the maximum asymptotic merit factor is also $3$ for this larger class. Here we show that a family of such Rudin-Shapiro-like sequences achieves asymptotic merit factor $3$ if and only if the seed is either of length $1$ or is the interleaving of a pair of Golay complementary sequences. For small seed lengths where this is not possible, the optimal seeds are interleavings of pairs that are as close as possible to being complementary pairs, and the idea of an almost-complementary pair makes sense of remarkable patterns in previously unexplained data on optimal seeds for binary Rudin-Shapiro-like sequences.
In this paper, we present explicit and computable error bounds for the asymptotic expansions of Hermite polynomials with Plancherel-Rotach scale. Three cases, depending on whether the scaled variable lies in the outer or oscillatory interval, or it is the turning point, are considered respectively. We introduce the branch cut technique to express the error term as an integral on the contour taking as the one-sided limit of curves approaching the branch cut. This new technique enables us to derive simple formulas for the error bounds in terms of elementary functions.
The main aim of this article is a careful investigation of the asymptotic behavior of zeros of Bernoulli polynomials of the second kind. It is shown that the zeros are all real and simple. The asymptotic expansions for the small, large, and the middle zeros are computed in more detail. The analysis is based on the asymptotic expansions of the Bernoulli polynomials of the second kind in various regimes.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
