DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kim, Dongsu | ko |
dc.contributor.author | Kim, JS | ko |
dc.date.accessioned | 2008-06-05T01:21:19Z | - |
dc.date.available | 2008-06-05T01:21:19Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 2007-01 | - |
dc.identifier.citation | ELECTRONIC JOURNAL OF COMBINATORICS, v.14, no.1, pp.S13 - S22 | - |
dc.identifier.issn | 1077-8926 | - |
dc.identifier.uri | http://hdl.handle.net/10203/4903 | - |
dc.description | http://www.combinatorics.org/Volume_14/Abstracts/v14i1r2.html | en |
dc.description.abstract | For a permutation pi = pi(1)pi(2)... pi(n) is an element of S-n and a positive integer i <= n, we can view pi(1)pi(2)... pi(i) as an element of S-i by order-preserving relabeling. The j-set of pi is the set of i's such that pi(1)pi(2)... pi(i) is an involution in S-i. We prove a characterization theorem for j-sets, give a generating function for the number of different j-sets of permutations in S-n. We also compute the numbers of permutations in S-n with a given j-set and prove some properties of them. | - |
dc.language | English | - |
dc.language.iso | en_US | en |
dc.publisher | ELECTRONIC JOURNAL OF COMBINATORICS | - |
dc.title | The initial involution patterns of permutations | - |
dc.type | Article | - |
dc.identifier.wosid | 000243201600004 | - |
dc.identifier.scopusid | 2-s2.0-33846060338 | - |
dc.type.rims | ART | - |
dc.citation.volume | 14 | - |
dc.citation.issue | 1 | - |
dc.citation.beginningpage | S13 | - |
dc.citation.endingpage | S22 | - |
dc.citation.publicationname | ELECTRONIC JOURNAL OF COMBINATORICS | - |
dc.contributor.localauthor | Kim, Dongsu | - |
dc.contributor.nonIdAuthor | Kim, JS | - |
dc.type.journalArticle | Article | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.