FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W4294571944> ?p ?o ?g. }

• W4294571944 endingPage "995" @default.
• W4294571944 startingPage "971" @default.
• W4294571944 abstract "Abstract A matching of the set $$[2n]={1,2,ldots ,2n}$$ <mml:math xmlns:mml=http://www.w3.org/1998/Math/MathML> <mml:mrow> <mml:mo>[</mml:mo> <mml:mn>2</mml:mn> <mml:mi>n</mml:mi> <mml:mo>]</mml:mo> <mml:mo>=</mml:mo> <mml:mo>{</mml:mo> <mml:mn>1</mml:mn> <mml:mo>,</mml:mo> <mml:mn>2</mml:mn> <mml:mo>,</mml:mo> <mml:mo>…</mml:mo> <mml:mo>,</mml:mo> <mml:mn>2</mml:mn> <mml:mi>n</mml:mi> <mml:mo>}</mml:mo> </mml:mrow> </mml:math> is a partition of [2 n ] into blocks with two elements, i.e. a graph on [2 n ], such that every vertex has degree one. Given two matchings $$sigma $$ <mml:math xmlns:mml=http://www.w3.org/1998/Math/MathML> <mml:mi>σ</mml:mi> </mml:math> and $$tau $$ <mml:math xmlns:mml=http://www.w3.org/1998/Math/MathML> <mml:mi>τ</mml:mi> </mml:math> , we say that $$sigma $$ <mml:math xmlns:mml=http://www.w3.org/1998/Math/MathML> <mml:mi>σ</mml:mi> </mml:math> is a $$pattern $$ <mml:math xmlns:mml=http://www.w3.org/1998/Math/MathML> <mml:mrow> <mml:mi>pattern</mml:mi> </mml:mrow> </mml:math> of $$tau $$ <mml:math xmlns:mml=http://www.w3.org/1998/Math/MathML> <mml:mi>τ</mml:mi> </mml:math> when $$sigma $$ <mml:math xmlns:mml=http://www.w3.org/1998/Math/MathML> <mml:mi>σ</mml:mi> </mml:math> can be obtained from $$tau $$ <mml:math xmlns:mml=http://www.w3.org/1998/Math/MathML> <mml:mi>τ</mml:mi> </mml:math> by deleting some of its edges and consistently relabelling the remaining vertices. This is a partial order relation turning the set of all matchings into a poset, which will be called the matching pattern poset . In this paper, we continue the study of classes of pattern avoiding matchings (see below for previous work on this subject). In particular, we work out explicit formulas to enumerate the class of matchings avoiding two new patterns, obtained by juxtaposition of smaller patterns, and we describe a recursive formula for the generating function of the class of matchings avoiding the lifting of a pattern and two additional patterns. Moreover, we introduce the notion of unlabeled pattern, as a combinatorial way to collect patterns, and we provide enumerative formulas for two classes of matchings avoiding an unlabeled pattern of order three. In one case, the enumeration follows from an interesting bijection between the matchings of the class and ternary trees. The last part of the paper initiates the study of the matching pattern poset, by providing some preliminary results about its Möbius functions and the structure of some simple intervals." @default.
• W4294571944 created "2022-09-05" @default.
• W4294571944 creator A5017390053 @default.
• W4294571944 creator A5082644099 @default.
• W4294571944 date "2022-09-04" @default.
• W4294571944 modified "2023-10-04" @default.
• W4294571944 title "Enumeration of Some Classes of Pattern Avoiding Matchings, with a Glimpse into the Matching Pattern Poset" @default.
• W4294571944 cites W1521045270 @default.
• W4294571944 cites W1562826952 @default.
• W4294571944 cites W186403072 @default.
• W4294571944 cites W1919302619 @default.
• W4294571944 cites W1973686887 @default.
• W4294571944 cites W1992104349 @default.
• W4294571944 cites W2020877453 @default.
• W4294571944 cites W2040661328 @default.
• W4294571944 cites W2042682183 @default.
• W4294571944 cites W2047947538 @default.
• W4294571944 cites W2051725919 @default.
• W4294571944 cites W2053601698 @default.
• W4294571944 cites W2068157134 @default.
• W4294571944 cites W2086582845 @default.
• W4294571944 cites W2111619805 @default.
• W4294571944 cites W2166578450 @default.
• W4294571944 cites W2549866415 @default.
• W4294571944 cites W2611531305 @default.
• W4294571944 cites W2963201523 @default.
• W4294571944 cites W2964104493 @default.
• W4294571944 cites W3142171453 @default.
• W4294571944 doi "https://doi.org/10.1007/s00026-022-00596-1" @default.
• W4294571944 hasPublicationYear "2022" @default.
• W4294571944 type Work @default.
• W4294571944 citedByCount "0" @default.
• W4294571944 crossrefType "journal-article" @default.
• W4294571944 hasAuthorship W4294571944A5017390053 @default.
• W4294571944 hasAuthorship W4294571944A5082644099 @default.
• W4294571944 hasBestOaLocation W42945719441 @default.
• W4294571944 hasConcept C11413529 @default.
• W4294571944 hasConcept C154945302 @default.
• W4294571944 hasConcept C41008148 @default.
• W4294571944 hasConceptScore W4294571944C11413529 @default.
• W4294571944 hasConceptScore W4294571944C154945302 @default.
• W4294571944 hasConceptScore W4294571944C41008148 @default.
• W4294571944 hasFunder F4320311030 @default.
• W4294571944 hasIssue "4" @default.
• W4294571944 hasLocation W42945719441 @default.
• W4294571944 hasLocation W42945719442 @default.
• W4294571944 hasOpenAccess W4294571944 @default.
• W4294571944 hasPrimaryLocation W42945719441 @default.
• W4294571944 hasRelatedWork W2051487156 @default.
• W4294571944 hasRelatedWork W2073681303 @default.
• W4294571944 hasRelatedWork W2317200988 @default.
• W4294571944 hasRelatedWork W2358668433 @default.
• W4294571944 hasRelatedWork W2376932109 @default.
• W4294571944 hasRelatedWork W2382290278 @default.
• W4294571944 hasRelatedWork W2386767533 @default.
• W4294571944 hasRelatedWork W2390279801 @default.
• W4294571944 hasRelatedWork W2748952813 @default.
• W4294571944 hasRelatedWork W2899084033 @default.
• W4294571944 hasVolume "26" @default.
• W4294571944 isParatext "false" @default.
• W4294571944 isRetracted "false" @default.
• W4294571944 workType "article" @default.