Skip to search formSkip to main contentSkip to account menu

Shapiro polynomials

Known as: Golay-Shapiro polynomials, Rudin-Shapiro polynomials 
In mathematics, the Shapiro polynomials are a sequence of polynomials which were first studied by Harold S. Shapiro in 1951 when considering the… 
Wikipedia (opens in a new tab)

Related topics

Related topics

8 relations
AutocorrelationComplementary sequencesData compressionLittlewood polynomial

Broader (2)

Digital signal processingFourier analysis

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2009
2009
A Fast Björck-Pereyra-Type Algorithm for Solving Hessenberg-Quasiseparable-Vandermonde Systems
A fast $\mathcal{O}(n^2)$ algorithm is derived for solving linear systems where the coefficient matrix is a polynomial… 
2009
2009
Fourier Expansions and Integral Representations for Genocchi Polynomials
In this paper, by using the Lipschitz summation formula, we obtain Fourier expansions and integral representations for the… 
2001
2001
The Discrete Relativistic Toda Molecule Equation and a Padé Approximation Algorithm
The relativistic Toda molecule equation (RTM) describes a one-parameter deformation of coefficients of the recurrence relation of… 
2000
2000
Reasoning and Acting in Time
This dissertation investigates aspects of the design of an embodied cognitive agent that interleaves reasoning, acting, and… 
Highly Cited
1999
Highly Cited
1999
Zolotarev polynomials and optimal FIR filters
The algebraic form of Zolotarev polynomials refraining from their parametric representation is introduced. A recursive algorithm… 
1999
1999
Numerical Models of Binary Neutron Star System Mergers. I. Numerical Methods and Equilibrium Data for Newtonian Models
The numerical modeling of binary neutron star mergers has become a subject of much interest in recent years. While a full and… 
Highly Cited
1994
Highly Cited
1994
Automatic Landmark Generation for Point Distribution Models
Point Distribution Models (PDMs) are statistically derived flexible templates which are trained on sets of examples of the object… 
1993
1993
More zeros of krawtchouk polynomials
Three theorems are given for the integral zeros of Krawtchouk polynomials. First, five new infinite families of integral zeros… 
Highly Cited
1983
Highly Cited
1983
An Appraisal of a Decision Tree Approach to Image Classification
This paper investigates the applicability to a shape-recognition problem of a concept learning algorithm which generates decision… 
1955
1955
Least pth Power Polynomials on a Real Finite Point Set
where the ju& are given, but also use various broad generalizations of (1). The analogous problem for approximation on a finite… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)