Sciweavers

365 search results - page 22 / 73
» On the combinatorics of Galois numbers
Sort
View
COMBINATORICS
2000
81views more  COMBINATORICS 2000»
14 years 11 months ago
Interchangeability of Relevant Cycles in Graphs
The set R of relevant cycles of a graph G is the union of its minimum cycle bases. We introduce a partition of R such that each cycle in a class W can be expressed as a sum of oth...
Petra M. Gleiss, Josef Leydold, Peter F. Stadler
COMBINATORICS
2000
128views more  COMBINATORICS 2000»
14 years 11 months ago
Continued Fractions and Catalan Problems
We find a generating function expressed as a continued fraction that enumerates ordered trees by the number of vertices at different levels. Several Catalan problems are mapped to...
Mahendra Jani, Robert G. Rieper
COMBINATORICS
1998
88views more  COMBINATORICS 1998»
14 years 11 months ago
Multi-statistic enumeration of two-stack sortable permutations
Using Zeilberger’s factorization of two-stack-sortable permutations, we write a functional equation — of a strange sort — that defines their generating function according t...
Mireille Bousquet-Mélou
COMBINATORICS
1999
80views more  COMBINATORICS 1999»
14 years 11 months ago
On the Theory of Pfaffian Orientations. I. Perfect Matchings and Permanents
Kasteleyn stated that the generating function of the perfect matchings of a graph of genus g may be written as a linear combination of 4g Pfaffians. Here we prove this statement. ...
Anna Galluccio, Martin Loebl
COMBINATORICS
1999
70views more  COMBINATORICS 1999»
14 years 11 months ago
Derivative Polynomials, Euler Polynomials, and Associated Integer Sequences
Let Pn and Qn be the polynomials obtained by repeated differentiation of the tangent and secant functions respectively. From the exponential generating functions of these polynomia...
Michael E. Hoffman