Network coding via skew polynomials
Abstract
- Network coding via skew polynomials
Recommendations
The skew Schubert polynomials
Special issue: In honour of Alain Lascoux on the occasion of his 60th birthdayWe obtain a tableau definition of the skew Schubert polynomials named by Lascoux, which are defined as flagged double skew Schur functions. These polynomials are in fact Schubert polynomials in two sets of variables indexed by 321-avoiding permutations. ...
Stretched skew Schur polynomials are recurrent
We show that sequences of skew Schur polynomials obtained from stretched semi-standard Young tableaux satisfy a linear recurrence, which we give explicitly. We apply this to find certain asymptotic behavior of these Schur polynomials and present ...
Generalized Humbert polynomials via generalized Fibonacci polynomials
In this paper, we define the generalized (p, q)-Fibonacci polynomials un, m(x) and generalized (p, q)-Lucas polynomials vn, m(x), and further introduce the generalized Humbert polynomials un,m(r)(x) as the convolutions of un, m(x). We give many ...
Comments
Information & Contributors
Information
Published In

Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0