Concept

Polynomial sequence

In mathematics, a polynomial sequence is a sequence of polynomials indexed by the nonnegative integers 0, 1, 2, 3, ..., in which each index is equal to the degree of the corresponding polynomial. Polynomial sequences are a topic of interest in enumerative combinatorics and algebraic combinatorics, as well as applied mathematics.

Official source

https://en.wikipedia.org/wiki/Polynomial_sequence

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related lectures (12)

Convergence Criteria: Polynomials Limits

Covers convergence criteria for polynomial limits and the theorem of the two gendarmes, emphasizing the importance of indeterminate forms.

Numerical Analysis: Introduction to Interpolation Techniques

Covers the basics of numerical analysis, focusing on interpolation methods and their applications in engineering.

Graph Construction: Martingales & Polynomials

Explores the construction of graphs through martingales and polynomials, offering insights into solving eigenvalue problems with low probabilities.

Related publications (2)

The Spectral Graph Wavelet Transform: Fundamental Theory and Fast Computation

Pierre Vandergheynst

The spectral graph wavelet transform (SGWT) defines wavelet transforms appropriate for data defined on the vertices of a weighted graph. Weighted graphs provide an extremely flexible way to model the data domain for a large number of important applications (such as data defined on vertices of social networks, transportation networks, brain connectivity networks, point clouds, or irregularly sampled grids). The SGWT is based on the spectral decomposition of the N×N graph Laplacian matrix L, where N is the nu

Springer2026

Chebyshev polynomial approximation for transductive learning on graphs

The goal of transductive learning is to find a way to recover the labels of lots of data with only a few known samples. In this work, we will work on graphs for two reasons. First, it’s possible to construct a graph from a given dataset with features. The main assumption we make is that if two vertices are close (connected with a small weight), they will have similiar labels. Thus, graph theory allows us to solve lots of problems. Second, graph problems can be solved distributively. Imagine you have a senso

2011

Related people (2)

Pascal Frossard

Teaching & PhD PhD Students Yiming Qin, Alba Carballo Castro, Elisa Messori, Ke Wang, Sevda Ögüt, Tuna Alikasifoglu, William Cappelletti, Manuel Madeira, Mahdi Amiri, Ortal Yona Senouf, Vasiliki Rizou, Cem Bilaloglu, Abdellah Rahmani, Amel Abdelraheem, Jérémy Jean Philippe Baffou, Adam Hazimeh, Vincent Jung, Yike Zhao Past EPFL PhD Students Dan Jurca, Jean-Paul Wagner, Ivana Radulovic, Ivana Tosic, Effrosyni Kokiopoulou, Zafer Arican, Vijayaraghavan Thirumalai, Tamara Tosic, Eirina Bourtsoulatze, Elif Vur

Pierre Vandergheynst

Pierre Vandergheynst received the M.S. degree in physics and the Ph.D. degree in mathematical physics from the Université catholique de Louvain, Louvain-la-Neuve, Belgium, in 1995 and 1998, respectively. From 1998 to 2001, he was a Postdoctoral Researcher with the Signal Processing Laboratory, Swiss Federal Institute of Technology (EPFL), Lausanne, Switzerland. He was Assistant Professor at EPFL (2002-2007), where he is now a Full Professor of Electrical Engineering and, by courtesy, of Computer and Communication Sciences. As of 2015, Prof. Vandergheynst serves as EPFL’s Vice-Provost for Education. His research focuses on harmonic analysis, sparse approximations and mathematical data processing in general with applications covering signal, image and high dimensional data processing, computer vision, machine learning, data science and graph-based data processing. He was co-Editor-in-Chief of Signal Processing (2002-2006), Associate Editor of the IEEE Transactions on Signal Processing (2007-2011), the flagship journal of the signal processing community and currently serves as Associate Editor of Computer Vision and Image Understanding and SIAM Imaging Sciences. He has been on the Technical Committee of various conferences, serves on the steering committee of the SPARS workshop and was co-General Chairman of the EUSIPCO 2008 conference. Pierre Vandergheynst is the author or co-author of more than 70 journal papers, one monograph and several book chapters. He has received two IEEE best paper awards. Professor Vandergheynst is a laureate of the Apple 2007 ARTS award and of the 2009-2010 De Boelpaepe prize of the Royal Academy of Sciences of Belgium.

Related notebooks (1)

Implementing a Fractional Resampler using Local Lagrange Interpolation

FIR Resampling[1]¶

                                      [2]Paolo Prandoni, [3]LCAV, EPFL

In this notebook we will implement a simple fractional resampler that uses local Lagrange interpolation. The resampler can be used to perform any rational sampling rate change (but beware of aliasing when downsampling!) In [1]: import numpy as np import IPython from scipy.io import wavfile Local Lagrange interpolation[4]¶ To perform resampling we will need to compute subsample values and, in

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Official source

https://en.wikipedia.org/wiki/Polynomial_sequence

About this result

Related lectures (12)

Convergence Criteria: Polynomials Limits

Covers convergence criteria for polynomial limits and the theorem of the two gendarmes, emphasizing the importance of indeterminate forms.

Numerical Analysis: Introduction to Interpolation Techniques

Covers the basics of numerical analysis, focusing on interpolation methods and their applications in engineering.

Graph Construction: Martingales & Polynomials

Explores the construction of graphs through martingales and polynomials, offering insights into solving eigenvalue problems with low probabilities.

Related publications (2)

The Spectral Graph Wavelet Transform: Fundamental Theory and Fast Computation

Pierre Vandergheynst

Springer2026

Chebyshev polynomial approximation for transductive learning on graphs

2011

Related people (2)

Pascal Frossard

Pierre Vandergheynst

Related concepts (12)

Binomial type

In mathematics, a polynomial sequence, i.e., a sequence of polynomials indexed by non-negative integers in which the index of each polynomial equals its degree, is said to be of binomial type if it satisfies the sequence of identities Many such sequences exist. The set of all such sequences forms a Lie group under the operation of umbral composition, explained below. Every sequence of binomial type may be expressed in terms of the Bell polynomials. Every sequence of binomial type is a Sheffer sequence (but most Sheffer sequences are not of binomial type).

Sheffer sequence

In mathematics, a Sheffer sequence or poweroid is a polynomial sequence, i.e., a sequence (pn(x) : n = 0, 1, 2, 3, ...) of polynomials in which the index of each polynomial equals its degree, satisfying conditions related to the umbral calculus in combinatorics. They are named for Isador M. Sheffer. Fix a polynomial sequence (pn). Define a linear operator Q on polynomials in x by This determines Q on all polynomials. The polynomial sequence pn is a Sheffer sequence if the linear operator Q just defined is shift-equivariant; such a Q is then a delta operator.

Umbral calculus

In mathematics before the 1970s, the term umbral calculus referred to the surprising similarity between seemingly unrelated polynomial equations and certain shadowy techniques used to "prove" them. These techniques were introduced by John Blissard and are sometimes called Blissard's symbolic method. They are often attributed to Édouard Lucas (or James Joseph Sylvester), who used the technique extensively. In the 1930s and 1940s, Eric Temple Bell attempted to set the umbral calculus on a rigorous footing.

Related notebooks (1)

Implementing a Fractional Resampler using Local Lagrange Interpolation

FIR Resampling[1]¶

                                      [2]Paolo Prandoni, [3]LCAV, EPFL