Lattice path matroids: enumerative aspects and Tutte polynomials

被引:52
作者
Bonin, J [1 ]
de Mier, A
Noy, M
机构
[1] George Washington Univ, Dept Math, Washington, DC 20052 USA
[2] Univ Politecn Catalunya, Dept Matemat Aplicada II, E-08028 Barcelona, Spain
关键词
transversal matroid; tutte polynomial; beta invariant; broken circuit complex; lattice path; Catalan number;
D O I
10.1016/S0097-3165(03)00122-5
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Fix two lattice paths P and Q from (0, 0) to (m,r) that use East and North steps with P never going above Q. We show that the lattice paths that go from (0,0) to and that remain in the region bounded by P and Q can be identified with the bases of a particular type of transversal matroid, which we call a lattice path matroid. We consider a variety of enumerative aspects of these matroids and we study three important matroid invariants, namely the Tutte polynomial and, for special types of lattice path matroids, the characteristic polynomial and the beta invariant. In particular, we show that the Tutte polynomial is the generating function for two basic lattice path statistics and we show that certain sequences of lattice path matroids give rise to sequences of Tutte polynomials for which there are relatively simple generating functions. We show that Tutte polynomials of lattice path matroids can be computed in polynomial time. Also, we obtain a new result about lattice paths from an analysis of the beta invariant of certain lattice path matroids. (C) 2003 Elsevier Inc. All rights reserved.
引用
收藏
页码:63 / 94
页数:32
相关论文
共 20 条
  • [1] [Anonymous], ENUMERATIVE COMBINAT
  • [2] ARDILA F, 2002, ARXIVMATHCO0209354, V1
  • [3] BJORNER A, 1992, MATROID APPL, P226
  • [4] BONIN JE, UNPUB LATTICE PATH M
  • [5] BONINJ, UNPUB MULTIPATH MATR
  • [6] Brylawski T., 1982, MATROID THEORY ITS A, P125
  • [7] BRYLAWSKI TH, 1975, STUD APPL MATH, V54, P143
  • [8] Brylawski Thomas, 1992, MATROID APPL, V40, P123
  • [9] THE COMPLEXITY OF COMPUTING THE TUTTE POLYNOMIAL ON TRANSVERSAL MATROIDS
    COLBOURN, CJ
    PROVAN, JS
    VERTIGAN, D
    [J]. COMBINATORICA, 1995, 15 (01) : 1 - 10
  • [10] ALGEBRAIC LANGUAGES AND POLYOMINOES ENUMERATION
    DELEST, MP
    VIENNOT, G
    [J]. THEORETICAL COMPUTER SCIENCE, 1984, 34 (1-2) : 169 - 206