Pattern avoidance in forests of binary shrubs
We investigate pattern avoidance in permutations satisfying some additional restrictions. These are naturally considered in terms of avoiding patterns in linear extensions of certain forest-like partially ordered sets, which we call binary shrub forests. In this context, we enumerate forests avoidin...
Saved in:
Published in | Discrete Mathematics and Theoretical Computer Science Vol. 18; no. 2; p. F1 |
---|---|
Main Authors | , , , , , , |
Format | Journal Article |
Language | English |
Published |
Nancy
DMTCS
01.06.2016
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Abstract | We investigate pattern avoidance in permutations satisfying some additional restrictions. These are naturally considered in terms of avoiding patterns in linear extensions of certain forest-like partially ordered sets, which we call binary shrub forests. In this context, we enumerate forests avoiding patterns of length three. In four of the five non-equivalent cases, we present explicit enumerations by exhibiting bijections with certain lattice paths bounded above by the line y=ℓxy=ℓx, for some ℓ∈Q+ℓ∈Q+, one of these being the celebrated Duchon's club paths with ℓ=2/3ℓ=2/3. In the remaining case, we use the machinery of analytic combinatorics to determine the minimal polynomial of its generating function, and deduce its growth rate. |
---|---|
AbstractList | We investigate pattern avoidance in permutations satisfying some additional restrictions. These are naturally considered in terms of avoiding patterns in linear extensions of certain forest-like partially ordered sets, which we call binary shrub forests. In this context, we enumerate forests avoiding patterns of length three. In four of the five non-equivalent cases, we present explicit enumerations by exhibiting bijections with certain lattice paths bounded above by the line y=ℓxy=ℓx, for some ℓ∈Q+ℓ∈Q+, one of these being the celebrated Duchon's club paths with ℓ=2/3ℓ=2/3. In the remaining case, we use the machinery of analytic combinatorics to determine the minimal polynomial of its generating function, and deduce its growth rate. |
Audience | Academic |
Author | Pudwell, Lara Nugent, Peter Riehl, Manda Bevan, David Tlachac, ML Levin, Derek Pantone, Jay |
Author_xml | – sequence: 1 fullname: Bevan, David – sequence: 2 fullname: Levin, Derek – sequence: 3 fullname: Nugent, Peter – sequence: 4 fullname: Pantone, Jay – sequence: 5 fullname: Pudwell, Lara – sequence: 6 fullname: Riehl, Manda – sequence: 7 fullname: Tlachac, ML |
BookMark | eNptkEtLAzEUhYNUsNb-hwHXI3neZJal-IKCLnQ93MkkNdImmswI_nsDuuhC7uJcDt99cC7JIqbozsiSCVCtoYouai-Bt5qDvCDrUsJApdRCQqeWpH3GaXI5NviVwojRuibExqfsylSa5JshRMzfTXnL81CuyLnHQ3HrP12R17vbl-1Du3u6f9xudu2eKzq1oK3m1ghrPOpRMofd4KgYAD0z2jkvmXKKjYKPfGRuQAXGdNQoiUgBuViR69-9Hzl9zvWV_j3NOdaTPetAU8konFB7PLg-RJ-mjPYYiu03igKwTgFU6uYfqtbojsHWsHyo_snAD3tyXVQ |
ContentType | Journal Article |
Copyright | COPYRIGHT 2016 DMTCS Copyright DMTCS 2016 |
Copyright_xml | – notice: COPYRIGHT 2016 DMTCS – notice: Copyright DMTCS 2016 |
DBID | 8FE 8FG ABJCF ABUWG AFKRA AZQEC BENPR BFMQW BGLVJ CCPQU DWQXO HCIFZ L6V M7S PIMPY PQEST PQQKQ PQUKI PRINS PTHSS |
DatabaseName | ProQuest SciTech Collection ProQuest Technology Collection Materials Science & Engineering Collection ProQuest Central (Alumni) ProQuest Central UK/Ireland ProQuest Central Essentials ProQuest Central ProQuest Continental Europe Database Technology Collection ProQuest One Community College ProQuest Central SciTech Premium Collection ProQuest Engineering Collection ProQuest Engineering Database Publicly Available Content Database ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Academic ProQuest One Academic UKI Edition ProQuest Central China Engineering Collection |
DatabaseTitle | Publicly Available Content Database Engineering Database Technology Collection ProQuest Central Essentials ProQuest One Academic Eastern Edition ProQuest Central (Alumni Edition) SciTech Premium Collection ProQuest One Community College ProQuest Technology Collection Continental Europe Database ProQuest SciTech Collection ProQuest Central China ProQuest Central ProQuest Engineering Collection ProQuest One Academic UKI Edition ProQuest Central Korea Materials Science & Engineering Collection ProQuest One Academic Engineering Collection |
DatabaseTitleList | Publicly Available Content Database |
Database_xml | – sequence: 1 dbid: 8FG name: ProQuest Technology Collection url: https://search.proquest.com/technologycollection1 sourceTypes: Aggregation Database |
DeliveryMethod | fulltext_linktorsrc |
Discipline | Mathematics Computer Science |
EISSN | 1365-8050 |
ExternalDocumentID | A506619566 |
GroupedDBID | ALMA_UNASSIGNED_HOLDINGS M~E -~9 .4S .DC 29G 2WC 3V. 5GY 5VS 8FE 8FG AAFWJ ABDBF ABJCF ABUWG ACGFO ACIWK ADBBV ADOJU AENEX AFKRA AFPKN AIAGR ARCSS AZQEC B0M BCNDV BENPR BFMQW BGLVJ BPHCQ CCPQU DWQXO EAP EBS ECS EDO EJD EMK EPL EST ESX GROUPED_DOAJ HCIFZ I-F IAO IBB ICD ITC J9A KQ8 KWQ L6V M7S MK~ ML~ OK1 P2P PIMPY PQEST PQQKQ PQUKI PRINS PROAC PTHSS PV9 REM RNS RSU RZL TR2 TUS XSB ~8M |
ID | FETCH-LOGICAL-g250t-67c72c83c8fa7d41ea9be03b6af187eef415e51d32d2d1eba568890854aa06a23 |
IEDL.DBID | BENPR |
ISSN | 1462-7264 |
IngestDate | Thu Oct 10 18:50:46 EDT 2024 Wed Aug 14 18:52:45 EDT 2024 Tue Aug 13 05:22:12 EDT 2024 |
IsOpenAccess | true |
IsPeerReviewed | true |
IsScholarly | true |
Issue | 2 |
Language | English |
LinkModel | DirectLink |
MergedId | FETCHMERGED-LOGICAL-g250t-67c72c83c8fa7d41ea9be03b6af187eef415e51d32d2d1eba568890854aa06a23 |
OpenAccessLink | https://www.proquest.com/docview/1967041062?pq-origsite=%requestingapplication% |
PQID | 1967041062 |
PQPubID | 946337 |
ParticipantIDs | proquest_journals_1967041062 gale_infotracmisc_A506619566 gale_infotracacademiconefile_A506619566 |
PublicationCentury | 2000 |
PublicationDate | 20160601 |
PublicationDateYYYYMMDD | 2016-06-01 |
PublicationDate_xml | – month: 06 year: 2016 text: 20160601 day: 01 |
PublicationDecade | 2010 |
PublicationPlace | Nancy |
PublicationPlace_xml | – name: Nancy |
PublicationTitle | Discrete Mathematics and Theoretical Computer Science |
PublicationYear | 2016 |
Publisher | DMTCS |
Publisher_xml | – name: DMTCS |
SSID | ssib044734695 ssj0012947 |
Score | 2.1083746 |
Snippet | We investigate pattern avoidance in permutations satisfying some additional restrictions. These are naturally considered in terms of avoiding patterns in... |
SourceID | proquest gale |
SourceType | Aggregation Database |
StartPage | F1 |
SubjectTerms | Avoidance Combinatorial analysis Forests Machinery Mathematical research Permutations |
Title | Pattern avoidance in forests of binary shrubs |
URI | https://www.proquest.com/docview/1967041062 |
Volume | 18 |
hasFullText | 1 |
inHoldings | 1 |
isFullTextHit | |
isPrint | |
link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwfV1LSwMxEB60vejBR1Ws1pKD4GlxN5vs4yRVWovQUsRCbyVP7WWr3erR3-5km1YK4jEkIZCZzHxJZuYDuE5ZHlvGFZ7vRAZMRlGAI3kgI67jSFj0mC4beTBM-mP2NOET_-BW-rDKtU2sDLWeK_dGfouakoYMLzD07v0jcKxR7nfVU2jsQp3iTYHWoH7fHY6eN_8INK94U_40tpUH6R3BgYd-pLOS1THsmKIBh2taBeJPWQP2B5tSquUJBKOqAmZBxNd8pp2MyKwgCDVxhZLMLZFVRi0p3xZoA05h3Ou-PPQDz3EQvCL4WAZJqlKqslhlVqSaRUbk0oSxTISNstQYiw7W8EjHVFMdGSl4kmU54iQmRJgIGp9BrZgX5hyIpSZXJkyVDTOWhzbXUnIb85xpNz9uwo3bh6nT3OVCKOED8HG2qwE17XCEHy59MGlCa2skapza7l7v5NRrfDn9lc_F_92XsIegI1mFW7Wgtlx8mit07EvZht2s99j2MsTW4Lv7A5nrqJk |
link.rule.ids | 315,783,787,12779,21402,33387,33758,43614,43819 |
linkProvider | ProQuest |
linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwfV07T8MwELagDMDAo4AoFPCAxBQRx3YeE6oQpUBbMbRSt8hP6JJAU_j9nFO3qBJitq1IvvN9X-y7-xC6TlhGLeMKzncsAyYJCWAmDyThmhJhATFdNfJgGPfG7HnCJ_7CrfJplcuYWAdqXSp3R34LnpKEDH5goruPz8CpRrnXVS-hsYm2GAWgcZXi3cfVK0KU1aopf4baGj-6B2jPEz_cWVjqEG2Yoon2l6IK2J-xJtodrBqpVkcoeK37XxZYfJdT7SyEpwUGoglfqHBpsazraXH1PoMIcIzG3YfRfS_wCgfBG1CPeRAnKolUSlVqRaIZMSKTJqQyFpakiTEW4NVwommkI02MFDxO0wxYEhMijEVET1CjKAtzirCNTKZMmCgbpiwLbaal5JbyjGm3nrbQjduH3PntfCaU8On3sNp1gMo7HMiHKx6MW6i9NhP8Ta0PL3cy9_5e5b_WOft_-Apt90aDft5_Gr6cox2gH_Ei8aqNGvPZl7kAiJ_Ly9qOP-NvqA0 |
openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Pattern+avoidance+in+forests+of+binary+shrubs&rft.jtitle=Discrete+Mathematics+and+Theoretical+Computer+Science&rft.au=Bevan%2C+David&rft.au=Levin%2C+Derek&rft.au=Nugent%2C+Peter&rft.au=Pantone%2C+Jay&rft.date=2016-06-01&rft.pub=DMTCS&rft.issn=1462-7264&rft.volume=18&rft.issue=2&rft.spage=F1&rft.externalDocID=A506619566 |
thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1462-7264&client=summon |
thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1462-7264&client=summon |
thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1462-7264&client=summon |