Bicoloured Ordered Trees and Restricted Permutations

来源 :第五届全国组合数学与图论大会 | 被引量 : 0次 | 上传用户：yeyennn

【摘要】

：

　　Let σ ∈ Sk and T ∈ Sn be permutations.We say τ avoids σ if there do not exist 1 ≤ x1 ≤ x2 ≤ … ≤ xk ≤ n such that τ(xi) < τ(xj) if and only if

【出处】

：

第五届全国组合数学与图论大会

【发表日期】

：

2012年7期

下载到本地 , 更方便阅读

下载此文赞助VIP

声明 : 本文档内容版权归属内容提供方 , 如果您对本文有版权争议 , 可与客服联系进行内容授权或下架

论文部分内容阅读

　　Let σ ∈ Sk and T ∈ Sn be permutations.We say τ avoids σ if there do not exist 1 ≤ x1 ≤ x2 ≤ … ≤ xk ≤ n such that τ(xi) < τ(xj) if and only if σ(xi) < σ(xj).This paper aims to establish new one-to-one correspondences between bicoloured ordered trees and permutations avoiding some patterns.

其他文献

无符号拉普拉斯谱半径的新上界

　　如果一个图存在定向满足其最大出度△+不超过最大度△的一半，则通过估计图的半边路径(semi-edge walk)的个数，得到了该图的无符号拉普拉斯谱半径的一个新上界.进而根据D.Go

会议

Oscillating Rim Hook Tableaux and Colored Matchings

　　Based on the generalized Schensted algorithm due to White (Adv.Math.(1983)), in this report we present a one-to-one correspondence between oscillating m-rim

会议

Adjacent vertex distinguishing total coloring of planar graphs

　　An adjacent vertex distinguishing total coloring of a graph G , or avd-total coloring in short, is a proper total coloring of G such that any pair of adjace

会议

Nowhere-zero 3-flows in Cayley graphs on generalized dihedral group and generalized quaternion group

　　Tutte conjectured that every 4-edge-connected graph admits a nowhere-zero 3-flow.In this paper, we show that this conjecture is true for Cayley graphs on ge

会议

Approximation Algorithms for Two Variants of Multiple Knapsack Problem with Restricted Bipartite Gra

　　Given n items with different sizes si and profits pi, m knapsacks with different capacities cj and a restricted bipartite graph G =(S ∪ T, E), where each v

会议

multiple knapsack problemrestricted bipartite graphinapproximabilityapproxima

The minimal Laplacian spectral radius of trees with given matching number

　　Let Jn,β denote the set of trees on n vertices with fixed matching number β, where n =kβ + l(k ≥ 2).In this paper, the tree with minimal Laplacian radiu

会议

Milnor-Witt K-theory and Tensor Powers of the Augmentation Ideal of (Z)[F×]

　　Let F be a field of characteristic not equal to 2.We describe the relation between the non-negative dimensional Milnor-Witt K-theory of F and the tensor alg

会议

K-theoryGrothendieck-Witt ringGroup ring

Star arboricity and k-star arboricity of graphs

　　A star forest is a forest whose components are stars.The star arboricity of a graph G, denoted by sa(G), is the minimum number of edge-disjoint star forests

会议

Star arboricityk-star arboricityLinear k-arboricityCubic graphsSubcubic grap

The least eigenvalue of signless Laplacian of non-bipartite unicyclic graphs with given pendant vert

　　Let G =(V, E) be a simple graph with vertex set V ={v1, v2,..., vn} and edge set E =E(G).The adjacency matrix of G is defined to be a matrix A(G) =(aij), wh

会议

4-ordered Hamiltonicity of the Complete Expansion graph of some Cayley graph

　　It will be proved that the Complete Expansion graph of And(k)(k6) is 4-ordered Hamiltonian graph by method of classification discuss.

会议

Andrasfai graphComplete expansion graphk-ordered hamiltonian graph

Bicoloured Ordered Trees and Restricted Permutations

与本文相关的学术论文