Majorization in Lattice Path Enumeration And Creating Order (ResearchIndex)

See this document in CiteSeerX!

Majorization in Lattice Path Enumeration And Creating Order (Make Corrections)
Ulrich Tamm

View or download:
mathematik.unibielefeld...tamm_latt.ps
Cached: PDF PS.gz PS Image Update Help

From: mathematik.unibie...publications (more)
(Enter author homepages)

Rate this article:

(best)
Comment on this article

(Enter summary)
Abstract: . Lattice paths are enumerated which first touch a periodic boundary at time n. Following a probabilistic method introduced by Gessel, for period length 2 formulae are obtained for a wide class of boundaries. This allows to give the generating function for paths not crossing or touching the diagonal cx = 2y for odd c and to obtain a closed formula similar to the ballot numbers for the sum of the entries of two two-dimensionanal arrays related to these boundaries. Via the theory of majorization ... (Update)

Similar documents based on text: More All
0.5: Lattice Paths Not Touching a Given Boundary - Ulrich Tamm Address (2000) (Correct)
0.4: Some Aspects of Hankel Matrices in Coding Theory and Combinatorics - Tamm (2001) (Correct)
0.3: A Linear Algebraic Reconstruction of Majorization - Parker, Ram (1997) (Correct)

BibTeX entry: (Update)

@misc{ tamm-majorization,
  author = "Ulrich Tamm",
  title = "Majorization in Lattice Path Enumeration And Creating Order",
  url = "citeseer.ist.psu.edu/408041.html" }

Citations (may not include all citations):
1749 An Introduction to Probability Theory and its Applications (context) - Feller - 1950
442 Concrete Mathematics (context) - Graham, Knuth et al. - 1988
306 Inequalities: theory of majorization and its applications (context) - Marshall, Olkin - 1979
267 Enumerative Combinatorics (context) - Stanley - 1999
182 Algebraic Coding Theory (context) - Berlekamp - 1968
124 The Art of Computer Programming Vol (context) - Knuth - 1973
108 An Introduction to the Analysis of Algorithms (context) - Sedgewick, Flajolet - 1996
95 Principles of Random Walks (context) - Spitzer - 1976
91 The context tree weighting method: basic properties - Willems, Shtarkov et al. - 1995
80 An Introduction to Combinatorial Analysis (context) - Riordan - 1958
65 Combinatorial Identities (context) - Riordan - 1968
62 Regular Polytopes (context) - Coxeter - 1973
61 Combinatorial aspects of continued fractions (context) - Flajolet - 1980
53 The Chebyshev Polynomials (context) - Rivlin - 1974
42 Die Lehre von den Kettenbruchen (context) - Perron - 1929
37 Lattice path counting and applications (context) - Mohanty - 1979
27 A Treatise on the Theory of Determinants (context) - Muir - 1960
26 Combinatory Analysis (context) - MacMahon - 1915
19 The Theory of Stochastic Processes (context) - Gilman, Skorohod - 1974
19 Tree compression and optimization with applications (context) - Katajainen, Makinen - 1990
16 A proof of Julian West's conjecture that the number of two-s.. (context) - Zeilberger - 1992
16 Enumeration of trees and forests related to branching proces.. - Pitman - 1998
15 On some new sequences generalizing the Catalan and Motzkin n.. (context) - Stein, Waterman - 1979
15 Motzkin numbers (context) - Donaghey, Shapiro - 1977
14 Functional composition patterns and power series reversion (context) - Raney - 1960
13 First passage and recurrence distributions (context) - Harris - 1952
13 The complete intersection theorem for systems of finite sets (context) - Ahlswede, Khachatrian - 1997
11 A problem of arrangements (context) - Dvoretzky, Motzkin - 1947
11 Random walk and the theory of Brownian motion (context) - Kac - 1947
11 A factorization of formal Laurent series and lattice path en.. (context) - Gessel - 1980
10 A probabilistic method for lattice path enumeration (context) - Gessel - 1986
10 Algebraic enumeration - Gessel, Stanley - 1996
10 Two element lattice permutation numbers and their q-generali.. (context) - Carlitz, Riordan - 1964
10 A survey on binary tree coding (context) - Makinen - 1991
9 Matrix Theory (context) - Franklin - 1968
9 Combinatorial Methods in the Theory of Stochastic Processes (context) - Takacs - 1967
9 Aufgaben und Lehrsatze aus der Analysis (context) - Polya, Szego - 1964
9 A recurrence restricted by a diagonal condition: generalized.. (context) - Sulanke - 1989
9 Interleaving schemes for multidimensional cluster errors - Blaum, Bruck et al. - 1998
9 Sorting twice through a stack (context) - West - 1993
8 Motzkin numbers (context) - Aigner - 1998
8 Level number sequences for trees (context) - Flajolet, Prodinger - 1987
8 On codes with the identifiable parent property - Hollmann, van Lint et al. - 1998
7 A Catalan triangle (context) - Shapiro - 1976
7 Correspondences between plane trees and binary sequences (context) - Klarner - 1970
6 Choice and Chance (context) - Whitworth
6 Multi--statistic enumeration of two--stack sortable permutat.. - Bousquet--Melou - 1998
6 Lattice Path Combinatorics (context) - Narayana - 1979
6 Catalan numbers, their generalization, and their uses (context) - Hilton, Pedersen - 1991
6 Combinatorial Algorithms (context) - Kreher, Stinson - 1999
5 Creating order in sequence spaces with simple machines (context) - Ahlswede, Ye et al. - 1990
5 Catalan-like numbers and determinants (context) - Aigner - 1999
5 Trees associated with the Motzkin numbers - Kuznetsov, Pak et al. - 1996
5 The cycle lemma and some applications (context) - Dershovitz, Zaks - 1990
5 Penrose Tiles to Trapdoor Ciphers (context) - Gardner - 1989
5 Binomial determinants, paths and hook length formulae (context) - Gessel, Viennot - 1985
4 Encyclopaedia of Mathematics and its Applications (context) - Andrews, of - 1976
4 Al Capone and the death ray (context) - Lyness - 1941
4 Oliver and Boyd (context) - Aitken, Matrices - 1964
3 Sequences of zeros and ones generated by special production .. (context) - de Bruijn - 1981
3 Pascal, Catalan, and general convolution arrays in a matrix (context) - Hoggatt, Bicknell - 1976
3 Catalan and related sequences arising from inverses of Pasca.. (context) - Hoggatt, Bicknell - 1976
3 Contributions to a theory of ordering for sequence spaces (context) - Ahlswede, Zhang - 1989
3 The isomorphism problem for Catalan families - Hungerbuhler - 1995
3 Enumeration of two--line arrays (context) - Carlitz - 1973
3 Some remarks on ballot -- type sequences (context) - Carlitz, Rosselle et al. - 1971
3 Relations between hypersurface cross ratios, and a combinato.. (context) - Motzkin - 1948
3 Combinatorial structure and capacity of the permuting relay .. (context) - Kobayashi - 1987
3 Solution of certain recurrences (context) - Carlitz - 1969
3 Optimal coding strategies for certain permuting channels (context) - Ahlswede, Kaspi - 1987
3 Enumerative coding for k--ary trees (context) - Kobayashi, Morita et al. - 1996
3 A class of convolutional codes (context) - Berlekamp - 1963
2 Generalisation du probleme resolu par M. J. Bertrand (context) - Barbier
2 Entropy reduction, ordering in sequence spaces, and semigrou.. - Hollmann, Vanroose - 1995
2 The Riordan group (context) - Shapiro, Getu et al. - 1991
2 The complete nontrivial--intersection theorem for systems of.. - Ahlswede, Khachatrian - 1996
2 Catalan numbers and total information numbers (context) - Shapiro - 1975
2 Ballot sequences in creating order (context) - Tamm - 1998
2 Chebyshev polynomials and regular polygons (context) - Savio, Suryanarayan - 1993
2 a Sturm sequence of polynomials for unitary Hessenberg matri.. - Bunse-Gerstner, He - 1995
2 Solution of certain recurrences II (context) - Carlitz - 1978
2 Pascal triangles, Catalan numbers and renewal arrays (context) - Rogers - 1978
2 Two results on the permuting mailbox channel (context) - Piret - 1989
2 Sur une classe de problemes de denombrement lies au treillis.. (context) - Kreweras - 1965
2 Binomial--Determinanten und Gitterwege (context) - Aigner - 1996
2 Solution d'un probleme (context) - Bertrand
2 Generalized convolution arrays (context) - Hoggatt, Bergum - 1975
2 Pitman Monographs and Surveys in Pure and Applied Mathematic.. (context) - Erdos, Gruber et al. - 1989
1 Beatty sequences, continued fractions, and certain shift ope.. (context) - Stolarsky - 1976
1 the pre-order coding for complete k-ary trees (context) - Kobayashi, Han - 1996
1 A propos de l' interpretation geometrique du probleme de scr.. (context) - Aeppli - 1923
1 Vector majorization via Hessenberg matrices (context) - Brualdi, Hwang - 1996
1 Ordering in sequence spaces: an overview (context) - Vanroose - 2000
1 Pascal--like triangles in the enumeration of trees and seque.. - Tamm - 1997
1 Solution directe du probleme resolu par M. Bertrand (context) - Andre
1 Arrangements of m things of one sort and n things of another.. (context) - Whitworth
1 Derivation of a new formula for the number of minimal lattic.. (context) - Bizley - 1954
1 Updown generation of Beatty sequences (context) - de Bruijn - 1989
1 a property of lattice paths (context) - Handa, Mohanty - 1986
1 Old and new results for the weighted t-intersection problem .. - Bey, Engel - 2000
1 Wytho# pairs as semigroup invariants (context) - Porta, Stolarsky - 1991
1 Beatty sequences and Langford sequences (context) - Eggleton, Fraenkel et al. - 1993
1 Beatty sequences and multiplicative number theory (context) - Abercombie - 1995
1 Sequences of plus and minus (context) - Erdos, Kaplansky - 1946

Documents on the same site (http://www.mathematik.uni-bielefeld.de/~tamm/publications.html): More
Communication Complexity Of Functions On Direct Sums - Tamm (Correct)
Communication Complexity and Orthogonal Polynomials - Tamm (Correct)
Pascal -- Like Triangles in the Enumeration of Trees and.. - Ulrich Tamm Fakultat (1997) (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