Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userThe Stern diatomic sequence via generalized Chebyshev polynomials
112
0
0.0
(
0
)
Authors
Valerio De Angelis
Ask ChatGPT about the research
No Arabic abstract
Let a(n) be the Sterns diatomic sequence, and let x1,...,xr be the distances between successive 1s in the binary expansion of the (odd) positive integer n. We show that a(n) is obtained by evaluating generalized Chebyshev polynomials when the variables are given the values x1+1, ..., xr+1, and we derive a formula expressing the same polynomials in terms of sets of increasing integers of alternating parity. We also show that a(n) = Det(Ir + Mr), where Ir is the rxr identity matrix, and Mr is the rxr matrix that has x1,...,xr along the main diagonal, then all 1s just above and below the main diagonal, and all the other entries are 0.
rate research
Read More
Sterns diatomic sequence with its intrinsic repetition and refinement structure between consecutive powers of $2$ gives rise to a rather natural probability measure on the unit interval. We construct this measure and show that it is purely singular continuous, with a strictly increasing, Holder continuous distribution function. Moreover, we relate this function with the solution of the dilation equation for Sterns diatomic sequence.
We study higher-dimensional interlacing Fibonacci sequences, generated via both Chebyshev type functions and $m$-dimensional recurrence relations. For each integer $m$, there exist both rational and integ
Given $n$ polynomials $p_1, dots, p_n$ of degree at most $n$ with $|p_i|_infty le 1$ for $i in [n]$, we show there exist signs $x_1, dots, x_n in {-1,1}$ so that [Big|sum_{i=1}^n x_i p_iBig|_infty < 30sqrt{n}, ] where $|p|_infty := sup_{|x| le 1} |p(x)|$. This result extends the Rudin-Shapiro sequence, which gives an upper bound of $O(sqrt{n})$ for the Chebyshev polynomials $T_1, dots, T_n$, and can be seen as a polynomial analogue of Spencers six standard deviations theorem.
A word $sigma=sigma_1...sigma_n$ over the alphabet $[k]={1,2,...,k}$ is said to be {em smooth} if there are no two adjacent letters with difference greater than 1. A word $sigma$ is said to be {em smooth cyclic} if it is a smooth word and in addition satisfies $|sigma_n-sigma_1|le 1$. We find the explicit generating functions for the number of smooth words and cyclic smooth words in $[k]^n$, in terms of {it Chebyshev polynomials of the second kind}. Additionally, we find explicit formula for the numbers themselves, as trigonometric sums. These lead to immediate asymptotic corollaries. We also enumerate smooth necklaces, which are cyclic smooth words that are not equivalent up to rotation.
Trace estimators allow to approximate thermodynamic equilibrium observables with astonishing accuracy. A prominent representative is the finite-temperature Lanczos method (FTLM) which relies on a Krylov space expansion of the exponential describing the Boltzmann weights. Here we report investigations of an alternative approach which employs Chebyshev polynomials. This method turns out to be also very accurate in general, but shows systematic inaccuracies at low temperatures that can be traced back to an improper behavior of the approximated density of states with and without smoothing kernel. Applications to archetypical quantum spin systems are discussed as examples.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
