English
Related papers

Related papers: Crosscorrelation of Rudin-Shapiro-Like Polynomials

200 papers

Let $f(Z)=Z^n-a_{1}Z^{n-1}+\cdots+(-1)^{n-1}a_{n-1}Z+(-1)^na_n$ be a monic polynomial with coefficients in a ring~$R$ with identity, not necessarily commutative. We study the ideal $I_f$ of $R[X_1,\dots,X_n]$ generated by…

Rings and Algebras · Mathematics 2015-10-19 Fernando Szechtman

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…

Classical Analysis and ODEs · Mathematics 2018-09-24 Tamás Erdélyi

In this paper we study arithmetic computations in the nonassociative, and noncommutative free polynomial ring $\mathbb{F}\{x_1,x_2,\ldots,x_n\}$. Prior to this work, nonassociative arithmetic computation was considered by Hrubes, Wigderson,…

Computational Complexity · Computer Science 2017-07-07 V. Arvind , Rajit Datta , Partha Mukhopadhyay , S. Raja

We introduce a sequence P_d of monic reciprocal polynomials with integer coefficients having the central coefficients fixed as well as the peripheral coefficients. We prove that the ratio between number of nonunimodular roots of P_d and its…

Number Theory · Mathematics 2022-03-16 Dragan Stankov

We characterize the limiting distribution of Rudin-Shapiro polynomials, showing that, normalized, their values become uniformly distributed in the disc. This resolves conjectures of Saffari and Montgomery. Our proof proceeds by relating the…

Classical Analysis and ODEs · Mathematics 2019-08-26 Brad Rodgers

In 2009, Grant, Shallit, and Stoll constructed a large family of pseudorandom sequences, called generalized Rudin--Shapiro sequences, for which they established some results about the average of discrete correlation coefficients of order 2…

Number Theory · Mathematics 2020-02-28 Pierre-Adrien Tahay

This article characterizes the rank-one factorization of auto-correlation matrix polynomials. We establish a sufficient and necessary uniqueness condition for uniqueness of the factorization based on the greatest common divisor (GCD) of…

Numerical Analysis · Mathematics 2023-08-30 Konstantin Usevich , Julien Flamant , Marianne Clausel , David Brie

We characterize compatible families of real-rooted polynomials, allowing both positive and negative leading coefficients. Our characterization naturally generalizes the same-sign characterization used by Chudnovsky and Seymour in their…

Combinatorics · Mathematics 2024-08-06 Jonathan Leake , Nick Ryder

We introduce a family of rings of symmetric functions depending on an infinite sequence of parameters. A distinguished basis of such a ring is comprised by analogues of the Schur functions. The corresponding structure coefficients are…

Algebraic Geometry · Mathematics 2009-06-03 A. I. Molev

Polynomials whose coefficients, roots, and critical points lie in the ring of rational integers are called nice polynomials. In this paper, we present a general method for investigating such polynomials. We extend our results from the ring…

Number Theory · Mathematics 2007-05-23 Jean-Claude Evard

Fix an integer $d\geq 2$. The parameters $c_0\in \bar{\mathbb{Q}}$ for which the unicritical polynomial $f_{d,c}(z)=z^d+c\in \mathbb{C}[z]$ has finite postcritical orbit, also known as Misiurewicz parameters, play a significant role in…

Number Theory · Mathematics 2022-05-24 Robert L. Benedetto , Vefa Goksel

We introduce a construction for perfect periodic autocorrelation sequences over roots of unity. The sequences share similarities to the perfect periodic sequence constructions of Liu, Frank, and Milewski.

Information Theory · Computer Science 2012-12-04 Samuel T. Blake , Andrew Z. Tirkel

We calculate the autocorrelation function for the characteristic polynomial of a random matrix in the microscopic scaling regime. While results fitting this description have be proved before, we will cover all values of inverse temperature…

Probability · Mathematics 2010-04-12 Rowan Killip , Eric Ryckman

The Pursley-Sarwate criterion of a pair of finite complex-valued sequences measures the collective smallness of the aperiodic autocorrelations and the aperiodic crosscorrelations of the two sequences. It is known that this quantity is…

Information Theory · Computer Science 2019-05-30 Christian Günther , Kai-Uwe Schmidt

The (generalised) Mellin transforms of certain Chebyshev and Gegenbauer functions based upon the Chebyshev and Gegenbauer polynomials, have polynomial factors $p_n(s)$, whose zeros lie all on the `critical line' $\Re\,s=1/2$ or on the real…

Number Theory · Mathematics 2020-01-20 Mark W. Coffey , Matthew C. Lettington

We show that, like in the case of algebras over fields, the study of multilinear polynomial identities of unitary rings can be reduced to the study of proper polynomial identities. In particular, the factors of series of $\mathbb…

Rings and Algebras · Mathematics 2020-03-26 Alexey Gordienko , Geoffrey Janssens

The well-known mathematical instrument for detection common roots for pairs of polynomials and multiple roots of polynomials are resultants and discriminants. For a pair of polynomials $f$ and $g$ their resultant $R(f,g)$ is a function of…

Classical Analysis and ODEs · Mathematics 2024-04-15 Mikhail Chernyavsky , Andrei Lebedev , Yurii Trubnikov

In recent work with J.Mostovoy and T.Stanford,the author found that for every natural number n, a certain polynomial in the coefficients of the Conway polynomial is a primitive integer-valued degree n Vassiliev invariant, but that modulo 2,…

Geometric Topology · Mathematics 2012-02-23 James Conant

We obtain an estimate on the average cardinality of the value set of any family of monic polynomials of Fq[T] of degree d for which s consecutive coefficients a_{d-1},..., a_{d-s} are fixed. Our estimate holds without restrictions on the…

Number Theory · Mathematics 2013-10-15 Eda Cesaratto , Guillermo Matera , Mariana Pérez , Melina Privitelli

Each degree $n$ polynomial in one variable of the form $(x+1)(x^{n-1}+c_1x^{n-2}+\cdots +c_{n-1})$ is representable in a unique way as a Schur-Szeg\H{o} composition of $n-1$ polynomials of the form $(x+1)^{n-1}(x+a_i)$, see \cite{Ko1},…

Classical Analysis and ODEs · Mathematics 2015-04-10 Vladimir Petrov Kostov