Classifying descents according to equivalence mod k

Kitaev, Sergey and Remmel, Jeffrey (2006) Classifying descents according to equivalence mod k. In: Permutation Patterns Conference, 2006-06-12 - 2006-06-16, Reykjavik University.

Abstract

In [5] the authors re¯ne the well-known permutation statistic \descent" by ¯xing parity of one of the descent's numbers. In this paper, we generalize the results of [5] by studying descents according to whether the ¯rst or the second element in a descent pair is equivalent to k mod k ¸ 2. We provide either an explicit or an inclusion-exclusion type formula for the distribution of the new statistics. Based on our results we obtain combinatorial proofs of a number of remarkable identities. We also provide bijective proofs of some of our results.

ORCID iDs

Kitaev, Sergey ORCID: https://orcid.org/0000-0003-3324-1647

• Share and Export
  

  RDF+XMLBibTeXRIOXX2 XMLRDF+N-TriplesJSONDublin CoreAtomSimple MetadataReferMETSHTML CitationASCII CitationOpenURL ContextObjectEndNoteOpenURL ContextObject in SpanMODSMPEG-21 DIDLEP3 XMLData Cite XMLRIS (EndNote Online, Zotero, Ref manager, etc)RDF+N3Multiline CSV
• Item metadata

  Item type:	Conference or Workshop Item(Other)
  ID code:	49992
  Dates:	Date Event 12 June 2006 Published
  Subjects:	Science > Mathematics > Electronic computers. Computer science
  Department:	Faculty of Science > Computer and Information Sciences
  Depositing user:	Pure Administrator
  Date deposited:	23 Oct 2014 13:28
  Last modified:	11 Nov 2024 16:42
  Related URLs:	Event
  URI:	https://strathprints.strath.ac.uk/id/eprint/49992