Avoiding 2-letter signed patterns
T. Mansour, J. West
Abstract
Let Bn be the hyperoctahedral group; that is, the set of all signed permutations on n letters, and let Bn(T) be the set of all signed permutations in Bn which avoids a set T of signed patterns. In this paper, we find all the cardinalities of the sets Bn(T) where T ⊂eq B2. This allow us to express these cardinalities via inverse of binomial coefficients, binomial coefficients, Catalan numbers, and Fibonacci numbers.
Create a lesson
Related papers
Combinatorics of hyperplane arrangements and Witten zeta function at the origin
Kam Cheong Au, Kazuhiro Onodera
Proof of the Pach-Tardos conjecture
Lior Gishboliner, Xiangyu Li
Longest cycles intersect linearly in highly connected graphs
Jie Ma, Bo Ning, Ziyuan Zhao
Cutting a convex body into fat parts and approximating Euclidean distance by graph distances
János Pach, Gábor Tardos
A counterexample to the quantum Hedetniemi conjecture
Julius A. Zeiss
Schrijver-Delsarte rigidity in association schemes and undecidability of quantum graph homomorphism
Lorenzo Ciardo, Iris Hebbeker, Gideo Joubert et al.