Osculating lattice paths are sets of directed lattice paths which are not allowed to cross or have common edges, but are allowed common vertices. We derive a constant term formula for the number of such lattice paths. The formula is obtained by solving a set of simultaneous recurrence relations. Alternating sign matrices are in simple bijection with a subset of osculating lattice paths. This leads to a constant term formula for the number of alternating sign matrices. Resume Par "chemins de contact" on entend des ensembles de chemins orientes dans un reseau qui ne se traversent pas et qui n'ont pas d'aretes communes, mais qui peuvent avoir des noeuds communs. Nous etablissons une formule de type "terme constant&quo...
Define the average path length in a connected graph G as the sum of the lengths of the shortest path...
ABSTRACT. We count the number of lattice paths lying under a cyclically shifting piece-wise linear b...
We introduce a family of planar regions, called Aztec diamonds, and study the ways in which...
Osculating paths are sets of directed lattice paths which are not allowed to cross each other or hav...
In this talk, the combinatorics of osculating lattice paths will be considered, and it will be shown...
The combinatorics of certain tuples of osculating lattice paths is studied, and a relationship with...
© 2012 Dr. Paul W. T. FijnThis thesis primarily examines several problems in enumerative combinatori...
We firstly review the constant term method (CTM), illustrating its combinatorial connections and sho...
We firstly review the constant term method (CTM), illustrating its combinatorial connections and sho...
This paper is about counting lattice paths. Examples are the paths counted by Catalan, Motzkin or Sc...
AbstractWe define a bijection that transforms an alternating sign matrix A with one −1 into a pair (...
Abstract. We define a bijection that transforms an alternating sign matrix A with one −1 into a pair...
AbstractThere is a strikingly simple classical formula for the number of lattice paths avoiding the ...
AbstractWe count the number of lattice paths lying under a cyclically shifting piecewise linear boun...
We initiate a study of the zero-nonzero patterns of n × n alternating sign matrices. We characterize...
Define the average path length in a connected graph G as the sum of the lengths of the shortest path...
ABSTRACT. We count the number of lattice paths lying under a cyclically shifting piece-wise linear b...
We introduce a family of planar regions, called Aztec diamonds, and study the ways in which...
Osculating paths are sets of directed lattice paths which are not allowed to cross each other or hav...
In this talk, the combinatorics of osculating lattice paths will be considered, and it will be shown...
The combinatorics of certain tuples of osculating lattice paths is studied, and a relationship with...
© 2012 Dr. Paul W. T. FijnThis thesis primarily examines several problems in enumerative combinatori...
We firstly review the constant term method (CTM), illustrating its combinatorial connections and sho...
We firstly review the constant term method (CTM), illustrating its combinatorial connections and sho...
This paper is about counting lattice paths. Examples are the paths counted by Catalan, Motzkin or Sc...
AbstractWe define a bijection that transforms an alternating sign matrix A with one −1 into a pair (...
Abstract. We define a bijection that transforms an alternating sign matrix A with one −1 into a pair...
AbstractThere is a strikingly simple classical formula for the number of lattice paths avoiding the ...
AbstractWe count the number of lattice paths lying under a cyclically shifting piecewise linear boun...
We initiate a study of the zero-nonzero patterns of n × n alternating sign matrices. We characterize...
Define the average path length in a connected graph G as the sum of the lengths of the shortest path...
ABSTRACT. We count the number of lattice paths lying under a cyclically shifting piece-wise linear b...
We introduce a family of planar regions, called Aztec diamonds, and study the ways in which...