DC Field | Value | Language |
---|---|---|
dc.contributor.author | Lin, Zhicong | ko |
dc.contributor.author | Kim, Dongsu | ko |
dc.date.accessioned | 2022-10-11T03:01:00Z | - |
dc.date.available | 2022-10-11T03:01:00Z | - |
dc.date.created | 2022-04-25 | - |
dc.date.created | 2022-04-25 | - |
dc.date.created | 2022-04-25 | - |
dc.date.issued | 2022-08 | - |
dc.identifier.citation | COMBINATORICA, v.42, no.4, pp.559 - 586 | - |
dc.identifier.issn | 0209-9683 | - |
dc.identifier.uri | http://hdl.handle.net/10203/298921 | - |
dc.description.abstract | For any integer k >= 2, we prove combinatorially the following Euler (binomial) transformation identity NCn+1(k) (t) = t Sigma(n)(i=0) (n(i)) NWi(k) (t), where NCm(k) (t) (resp. NWm(k) (t)) is the sum of weights, t(number) (of blocks), of partitions of {1, ..., m} without k-crossings (resp. enhanced k-crossings). The special k = 2 and t = 1 case, asserting the Euler transformation of Motzkin numbers are Catalan numbers, was discovered by Donaghey 1977. The result for k = 3 and t= 1, arising naturally in a recent study of pattern avoidance in ascent sequences and inversion sequences, was proved only analytically. | - |
dc.language | English | - |
dc.publisher | SPRINGER HEIDELBERG | - |
dc.title | A COMBINATORIAL BIJECTION ON k-NONCROSSING PARTITIONS | - |
dc.type | Article | - |
dc.identifier.wosid | 000780265300001 | - |
dc.identifier.scopusid | 2-s2.0-85126247533 | - |
dc.type.rims | ART | - |
dc.citation.volume | 42 | - |
dc.citation.issue | 4 | - |
dc.citation.beginningpage | 559 | - |
dc.citation.endingpage | 586 | - |
dc.citation.publicationname | COMBINATORICA | - |
dc.identifier.doi | 10.1007/s00493-021-4262-x | - |
dc.contributor.localauthor | Kim, Dongsu | - |
dc.contributor.nonIdAuthor | Lin, Zhicong | - |
dc.description.isOpenAccess | N | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordPlus | INVERSION SEQUENCES | - |
dc.subject.keywordPlus | ASCENT SEQUENCES | - |
dc.subject.keywordPlus | MOTZKIN | - |
dc.subject.keywordPlus | CATALAN | - |
dc.subject.keywordPlus | PATHS | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.