Results 1 
5 of
5
Automorphisms of the lattice of Π 0 1 classes: perfect thin classes and anc degrees
 Trans. Amer. Math. Soc
"... Abstract. Π0 1 classes are important to the logical analysis of many parts of mathematics. The Π0 1 classes form a lattice. As with the lattice of computably enumerable sets, it is natural to explore the relationship between this lattice and the Turing degrees. We focus on an analog of maximality, o ..."
Abstract

Cited by 17 (6 self)
 Add to MetaCart
(Show Context)
Abstract. Π0 1 classes are important to the logical analysis of many parts of mathematics. The Π0 1 classes form a lattice. As with the lattice of computably enumerable sets, it is natural to explore the relationship between this lattice and the Turing degrees. We focus on an analog of maximality, or more precisely, hyperhypersimplicity, namely the notion of a thin class. We prove a number of results relating automorphisms, invariance, and thin classes. Our main results are an analog of Martin’s work on hyperhypersimple sets and high degrees, using thin classes and anc degrees, and an analog of Soare’s work demonstrating that maximal sets form an orbit. In particular, we show that the collection of perfect thin classes (a notion which is definable in the lattice of Π0 1 classes) forms an orbit in the lattice of Π01 classes; and a degree is anc iff it contains a perfect thin class. Hence the class of anc degrees is an invariant class for the lattice of Π0 1 classes. We remark that the automorphism result is proven via a ∆0 3 automorphism, and demonstrate that this complexity is necessary. 1.
A Schröder generalization of Haglund’s statistic on Catalan paths
 ELECTRON J. COMBIN
, 2003
"... Garsia and Haiman (J. Algebraic. Combin. 5 (1996), 191 − 244) conjectured that a certain sum Cn(q,t) of rational functions in q,t reduces to a polynomial in q,t with nonnegative integral coefficients. Haglund later discovered (Adv. Math., in press), and with Garsia proved (Proc. Nat. Acad. Sci. 98 ( ..."
Abstract

Cited by 17 (4 self)
 Add to MetaCart
(Show Context)
Garsia and Haiman (J. Algebraic. Combin. 5 (1996), 191 − 244) conjectured that a certain sum Cn(q,t) of rational functions in q,t reduces to a polynomial in q,t with nonnegative integral coefficients. Haglund later discovered (Adv. Math., in press), and with Garsia proved (Proc. Nat. Acad. Sci. 98 (2001), 4313 − 4316) the refined conjecture Cn(q,t) = ∑ q area t bounce. Here the sum is over all Catalan lattice paths and area and bounce have simple descriptions in terms of the path. In this article we give an extension of (area, bounce) to Schröder lattice paths, and introduce polynomials defined by summing q area t bounce over certain sets of Schröder paths. We derive recurrences and special values for these polynomials, and conjecture they are symmetric in q,t. We also describe a much stronger conjecture involving rational functions in q,t and the ∇ operator from the theory of Macdonald symmetric functions.
Generalized Rook Polynomials
 J. COMBIN. THEORY SER. A
, 2000
"... Generalizing the notion of placing rooks on a Ferrers board leads to a new class of combinatorial models and a new class of rook polynomials. Connections are established with absolute Stirling numbers and permutations, Bessel polynomials, matchings, multiset permutations, hypergeometric functions, A ..."
Abstract

Cited by 10 (1 self)
 Add to MetaCart
(Show Context)
Generalizing the notion of placing rooks on a Ferrers board leads to a new class of combinatorial models and a new class of rook polynomials. Connections are established with absolute Stirling numbers and permutations, Bessel polynomials, matchings, multiset permutations, hypergeometric functions, Abel polynomials and forests, and polynomial sequences of binomial type. Factorization and reciprocity theorems are proved and a qanalogue is given.
Consecutive patterns in permutations: clusters and generating functions
"... Abstract. We use the cluster method in order to enumerate permutations avoiding consecutive patterns. We reprove and generalize in a unified way several known results and obtain new ones, including some patterns of length 4 and 5, as well as some infinite families of patterns of a given shape. Our m ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. We use the cluster method in order to enumerate permutations avoiding consecutive patterns. We reprove and generalize in a unified way several known results and obtain new ones, including some patterns of length 4 and 5, as well as some infinite families of patterns of a given shape. Our main tool is the cluster method of Goulden and Jackson. We also prove some that, for a large class of patterns, the inverse of the exponential generating function counting occurrences is an entire function, but we conjecture that it is not Dfinite in general. Résumé. On utilise la méthode des clusters pour énumérer permutations qui évitent motifs consécutifs. On redémontre et on généralise d’une manière unifiée plusieurs résultats et on obtient de nouveaux résultats pour certains motifs de longueur 4 et 5, ainsi que pour certaines familles infinies de motifs. L’outil principal c’est la méthode des clusters de Goulden et Jackson. On démontre aussi que, pour une grande classe de motifs, l’inverse de la série génératrice exponentielle qui compte occurrences est une fonction entière, mais on conjecture qu’elle n’est pas Dfinie en général.