搜索结果: 1-9 共查到“理学 k-noncrossing”相关记录9条 . 查询时间(0.421 秒)
Noncrossing Linked Partitions and Large (3, 2)-Motzkin Paths
Noncrossing linked partition Schroder path large (3 2)-Motzkin path (3 2)-Motzkin path Schrö der number
<
2014/6/3
Noncrossing linked partitions arise in the study of certain transforms in free probability theory. We explore the connection between noncrossing linked partitions and (3, 2)-Motzkin paths, where a (3,...
Hom-configurations and noncrossing partitions
Cluster combinatorics derived category exceptional sequences Homconfigurations
<
2011/1/18
We study maximal Hom-free sets in the [2]-orbit category C(Q) of the bounded derived category for the path algebra associated to a Dynkin quiver Q, where denotes the Auslander-Reiten translation an...
Noncrossing Linked Partitions and Large (3,2)-Motzkin Paths
Noncrossing linked partition Schr¨oder path large (3, 2)-Motzkin path
<
2010/11/26
Noncrossing linked partitions arise in the study of certain transforms in free probability theory. We explore the connection between noncrossing linked partitions and colored Motzkin paths.
Identities Derived from Noncrossing Partitions of Type B
noncrossing partition of type B Narayana polynomial of type B bijection
<
2014/6/3
Based on weighted noncrossing partitions of type B, we obtain type B analogues of Coker’s identities on the Narayana polynomials. A parity reversing involution is given for the alternating sum of Nara...
In this paper we introduce a combinatorial framework which provides an interpretation of RNA pseudoknot structures as sampling paths of a Markov process. Our results give insight into the cross-serial...
Pairs of Noncrossing Free Dyck Paths and Noncrossing Partitions
Dyck path free Dyck path plane partition noncrossing partition vacillating tableau
<
2014/6/3
Using the bijection between partitions and vacillating tableaux, we establish a correspondence between pairs of noncrossing free Dyck paths of length 2n and noncrossing partitions of [2n + 1] with n +...
Efficient Counting and Asymptotics of k-Noncrossing Tangled Diagrams
Efficient Counting Asymptotics k-Noncrossing Tangled Diagrams
<
2014/6/3
In this paper, we enumerate k-noncrossing tangled-diagrams. A tangled-diagram is a labeled graph with vertices 1,..., n, having degree ≤ 2, which are arranged in increasing order in a horizontal line....
We give a parity reversing involution on noncrossing trees that leads to a combinatorial interpretation of a formula on noncrossing trees and symmetric ternary trees in answer to a problem proposed by...
Reduction of m-Regular Noncrossing Partitions
Partition noncrossing partition m-regular partition RNA secondary structure Davenport-Schinzel sequence Narayana number Catalan number
<
2014/6/3
In this paper, we present a reduction algorithm which trans-forms m-regular partitions of [n] = {1,2,. . . , n} to (m-1)-regular partitions of [n-1]. We show that this algorithm preserves the noncross...