Involutions on Baxter Objects

نویسنده

  • Kevin Dilks
چکیده

Baxter numbers are known to count several families of combinatorial objects, all of which come equipped with natural involutions. In this paper, we add a combinatorial family to the list, and show that the known bijections between these objects respect these involutions. We also give a formula for the number of objects fixed under this involution, showing that it is an instance of Stembridge’s “q = −1 phenomenon”. Résumé. Les nombres Baxter comptent plusieurs familles d’objets combinatoires, qui sont tous équipées avec des involutions naturels. Dans ce papier, nous ajoutons une famille combinatoire à la liste, et nous montrons que les bijections connus entre ces objets respectent ces involutions. En plus, nous donnons une formule pour le nombre d’objets fixés par cette involution et nous montrons qu’elle est une instance du “phénomène q = −1” de Stembridge.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Four Classes of Pattern-Avoiding Permutations Under One Roof: Generating Trees with Two Labels

Many families of pattern-avoiding permutations can be described by a generating tree in which each node carries one integer label, computed recursively via a rewriting rule. A typical example is that of 123-avoiding permutations. The rewriting rule automatically gives a functional equation satisfied by the bivariate generating function that counts the permutations by their length and the label ...

متن کامل

Dickson Polynomials that are Involutions

Dickson polynomials which are permutations are interesting combinatorial objects and well studied. In this paper, we describe Dickson polynomials of the first kind in F2[x] that are involutions over finite fields of characteristic 2. Such description is obtained using modular arithmetic’s tools. We give results related to the cardinality and the number of fixed points (in the context of cryptog...

متن کامل

Combinatorics of Arc Diagrams, Ferrers Fillings, Young Tableaux and Lattice Paths

Several recent works have explored the deep structure between arc diagrams, their nestings and crossings, and several other combinatorial objects including permutations, graphs, lattice paths, and walks in the Cartesian plane. This thesis inspects a range of related combinatorial objects that can be represented by arc diagrams, relationships between them, and their connection to nestings and cr...

متن کامل

Profiles of Large Combinatorial Structures

We derive limit laws for random combinatorial structures using singularity analysis of generating functions. We begin with a study of the Boltzmann samplers of Flajolet and collaborators, a useful method for generating large discrete structures at random which is useful both for providing intuition and conjecture and as a possible proof technique. We then apply generating functions and Boltzman...

متن کامل

Bruhat Order on Fixed-point-free Involutions in the Symmetric Group

We provide a structural description of Bruhat order on the set F2n of fixed-pointfree involutions in the symmetric group S2n which yields a combinatorial proof of a combinatorial identity that is an expansion of its rank-generating function. The decomposition is accomplished via a natural poset congruence, which yields a new interpretation and proof of a combinatorial identity that counts the n...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012