论文信息 - Unsplittable Classes of Separable Permutations - 字舞流文

Unsplittable Classes of Separable Permutations

A permutation class is splittable if it is contained in the merge of two of its proper subclasses. We characterise the unsplittable subclasses of the class of separable permutations both structurally and in terms of their bases.

Vít Jelínek | Michael Albert | M. Albert | Vít Jelínek

[1] Michael H. Albert,et al. On the length of the longest subsequence avoiding an arbitrary pattern in a random permutation , 2005, Random Struct. Algorithms.

[2] Graham Higman,et al. Ordering by Divisibility in Abstract Algebras , 1952 .

[3] Pavel Valtr,et al. Splittings and Ramsey Properties of Permutation Classes , 2015, Adv. Appl. Math..

[4] Chi Wang,et al. Partitioning Permutations into Increasing and Decreasing Subsequences , 1996, J. Comb. Theory, Ser. A.

[5] Nikola Ruskuc,et al. Partially Well-Ordered Closed Sets of Permutations , 2002, Order.

[6] Miklos Bona. On the Best Upper Bound for Permutations Avoiding A Pattern of a Given Length , 2012 .

[7] Vincent Vatter. An Erdős-Hajnal analogue for permutation classes , 2016, Discret. Math. Theor. Comput. Sci..

[8] Vincent Vatter,et al. Permutation classes , 2014, 1409.5159.

[9] Vít Jelínek,et al. Upper bounds for the Stanley-Wilf limit of 1324 and other layered patterns , 2011, J. Comb. Theory A.

[10] Prosenjit Bose,et al. Pattern Matching for Permutations , 1993, WADS.

[11] Nikola Ruskuc,et al. Growth Rates for Subclasses of Av(321) , 2010, Electron. J. Comb..

[12] Miklós Bóna. A New Upper Bound for 1324-Avoiding Permutations , 2014, Comb. Probab. Comput..

[13] Roland Fraïssé. Theory of relations , 1986 .