(Enter summary)
Abstract: A Hankel matrix (or persymmetric matrix) is a matrix (a ij ) in which for every r the entries on the diagonal i + j = r are the same, i.e., a i,r-i = c r for some c r . For a sequence c 0 , c 1 , c 2 , . . . of real numbers we consider the collection of Hankel matrices n , k = 0, 1, . . ., n = 1, 2, . . ., where # # # # # . . . . . . . . . . . . # # # # # . (1) So the parameter n denotes the size of the matrix and the 2n 1 successive elements c k , c k+1 , . . . , c k+2n-2 occur in the... (Update)
Cited by: More
Some Aspects of Hankel Matrices in Coding Theory and Combinatorics - Tamm (2001)
(Correct)
Active bibliography (related documents): More All
1.3: Majorization in Lattice Path Enumeration And Creating Order - Tamm
(Correct)
0.3: Advanced Determinant Calculus - Krattenthaler (1999)
(Correct)
0.2: Counting Points on Varieties over Finite Fields Related to a.. - Stembridge (1998)
(Correct)
Similar documents based on text: More All
0.2: Fast Triangular Factorization of the Sum of.. - Sayed, Lev-Ari, Kailath (1993)
(Correct)
0.2: Note on Products of Bezoutians and Hankel Matrices - Chen, Zhang
(Correct)
0.2: On Fischer-Frobenius transformations and the structure.. - Manthey, Hinrichsen..
(Correct)
Related documents from co-citation: More All
2: Continued fractions and Berlekamp's algorithm (context) - Welch, Scholtz - 1979
2: Rational representation of codes and (L,g) codes (context) - Goppa - 1971
2: An Introduction to Combinatorial Analysis (context) - Riordan - 1958
BibTeX entry: (Update)
U. Tamm, "Hankel matrices in coding theory and combinatorics", Preprint 00-055, SFB 343 "Diskrete Strukturen in der Mathematik", Univ. of Bielefeld, July 2000. http://citeseer.ist.psu.edu/tamm00hankel.html More
@techreport{ tamm00hankel,
author = "U. Tamm",
title = "{H}ankel matrices in coding theory and combinatorics",
number = "00-055",
institution = "SFB 343 Diskrete Strukturen in der Mathematik, Univ. of Bielefeld",
month = jul,
year = "2000",
url = "citeseer.ist.psu.edu/tamm00hankel.html" }
Citations (may not include all citations):
267
Enumerative Combinatorics (context) - Stanley - 1999
223
Theory and Practice of Error Control Codes (context) - Blahut - 1984
182
Algebraic Coding Theory (context) - Berlekamp - 1968
114
Shift register synthesis and BCH decoding (context) - Massey - 1969
80
An Introduction to Combinatorial Analysis (context) - Riordan - 1958
65
Combinatorial Identities (context) - Riordan - 1968
61
Combinatorial aspects of continued fractions (context) - Flajolet - 1980
53
The Chebyshev Polynomials (context) - Rivlin - 1974
18
Proof of the alternating sign matrix conjecture
- Zeilberger - 1996
14
A baker's dozen of conjectures concerning plane partitions (context) - Stanley
12
Alice's Adventures in Wonderland (context) - Carroll
11
Multivariable and Multidimensional Systems: Analysis and Des.. (context) - Kung - 1977
11
Condensation of determinants (context) - Dodgson
11
Theory of Determinants (context) - Muir - 1960
10
Essai experimental et analytique sur les lois de la dilatabi.. (context) - Prony
9
Aufgaben und Lehrsatze aus der Analysis (context) - Polya, Szego - 1964
9
The triangular decomposition of Hankel matrices (context) - Phillips - 1971
8
Proof of the refined alternating sign matrix conjecture
- Zeilberger - 1996
8
Motzkin numbers (context) - Aigner - 1998
7
A Catalan triangle (context) - Shapiro - 1976
7
A simple derivation of the Berlekamp -- Massey algorithm and.. (context) - Imamura, Yoshida - 1987
7
Continued fractions and Berlekamp's algorithm (context) - Welch, Scholtz - 1979
6
A simple Hankel interpretation of the Berlekamp -- Massey al.. (context) - Jonckheere, Ma - 1989
6
Sur l'interpolation par la methode des moindres carres (context) - Chebyshev
5
Catalan-like numbers and determinants (context) - Aigner - 1999
5
A class of error--correcting codes in p symbols (context) - Gorenstein, Zierler - 1961
5
Dodgson's determinant--evaluation rule proved by TWO--TIMING..
- Zeilberger - 1997
5
Binomial determinants, paths and hook length formulae (context) - Gessel, Viennot - 1985
4
A fast method to diagonalize a Hankel matrix (context) - Boley, Luk et al. - 1998
4
Proofs and Confirmations (context) - Bressoud - 1999
4
Two--error correcting Bose-- Chaudhuri codes are quasi--perf.. (context) - Gorenstein, Peterson et al. - 1960
4
A determinant property of Catalan numbers (context) - Mays, Wojciechowski - 2000
4
Solution of linear equation with Hankel and Toeplitz matrice.. (context) - Rissanen - 1974
4
A characterization of the Bell numbers (context) - Aigner - 1999
2
The Lanczos algorithm and Hankel matrix factoriztion (context) - Boley, Lee et al. - 1992
2
Encoding and error--corection procedures for the Bose--Chaud.. (context) - Peterson - 1960
2
Binomial--Determinanten und Gitterwege (context) - Aigner - 1996
2
Enumeration of certain Young tableaux with bounded height (context) - Desainte-Catherine, Viennot
1
Chemins sous -- diagonaux et tableaux de Young (context) - Gouyou-Beauchamps
1
Path systems in acyclic directed graphs (context) - Gronau, Just et al. - 1987
Documents on the same site (http://www.mathe2.uni-bayreuth.de/axel/papers/): More
On the Descending Loewy Series of Solomon's Descent Algebra - Blessenohl, Laue
(Correct)
Group Actions on Arrangements of Linear Subspaces and.. - Sundaram, Welker
(Correct)
Some Applications Of Incidence Hopf Algebras To Formal Group.. - Lenart, Ray (1995)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC