相关论文: Pattern avoiding permutations are context-sensitiv…

We construct a bijection between 231-avoiding permutations and Dyck paths that sends the sum of the major index and the inverse major index of a 231-avoiding permutation to the major index of the corresponding Dyck path. Furthermore, we…

Motivated by the recent proof of the Stanley-Wilf conjecture, we study the asymptotic behavior of the number of permutations avoiding a generalized pattern. Generalized patterns allow the requirement that some pairs of letters must be…

We present bijections between four classes of combinatorial objects. Two of them, the class of unlabeled (2+2)-free posets and a certain class of involutions (or chord diagrams), already appeared in the literature, but were apparently not…

Circular permutations on {1,2,...,n} that avoid a given pattern correspond to ordinary (linear) permutations that end with n and avoid all cyclic rotations of the pattern. Three letter patterns are all but unavoidable in circular…

Every word has a shape determined by its image under the Robinson-Schensted-Knuth correspondence. We show that when a word w contains a separable (i.e., 3142- and 2413-avoiding) permutation \sigma\ as a pattern, the shape of w contains the…

An occurrence of a classical pattern p in a permutation \pi is a subsequence of \pi whose letters are in the same relative order (of size) as those in p. In an occurrence of a generalized pattern, some letters of that subsequence may be…

In this paper we study pattern avoidance for affine permutations. In particular, we show that for a given pattern p, there are only finitely many affine permutations in $\widetilde{S}_n$ that avoid p if and only if p avoids the pattern 321.…

The study of pattern containment and avoidance for linear permutations is a well-established area of enumerative combinatorics. A cyclic permutation is the set of all rotations of a linear permutation. Callan initiated the study of…

Neural conversational models tend to produce generic or safe responses in different contexts, e.g., reply \textit{"Of course"} to narrative statements or \textit{"I don't know"} to questions. In this paper, we propose an end-to-end approach…

Natural languages are believed to be (mildly) context-sensitive. Despite underpinning remarkably capable large language models, transformers are unable to model many context-free language tasks. In an attempt to address this limitation in…

Numerical evidence suggests that certain permutation patterns of length k are easier to avoid than any other patterns of that same length. We prove that these patterns are avoided by no more than (2.25k^2)^n permutations of length n. In…

Language models can learn sophisticated language understanding skills from fitting raw text. They also unselectively learn useless corpus statistics and biases, especially during finetuning on domain-specific corpora. In this paper, we…

An infinte word w avoids a pattern p with the involution t if there is no substitution for the variables in p and no involution t such that the resulting word is a factor of w. We investigate the avoidance of patterns with respect to the…

We characterize bijections on matrix spaces (operator algebras) preserving full rank (invertibility) of differences of matrix (operator) pairs in both directions.

We present Backpacks: a new neural architecture that marries strong modeling performance with an interface for interpretability and control. Backpacks learn multiple non-contextual sense vectors for each word in a vocabulary, and represent…

This paper considers the enumeration of trees avoiding a contiguous pattern. We provide an algorithm for computing the generating function that counts n-leaf binary trees avoiding a given binary tree pattern t. Equipped with this counting…

This dissertation presents a multifaceted look into the structural decomposition of permutation classes. The theory of permutation patterns is a rich and varied field, and is a prime example of how an accessible and intuitive definition…

Language technologies that accurately model the dynamics of events must perform commonsense reasoning. Existing work evaluating commonsense reasoning focuses on making inferences about common, everyday situations. To instead investigate the…

We show that cyclic permutations avoiding $321$ are precisely those permutations whose image under the fundamental bijection avoid a set of vincular patterns. We do this by using pattern functions and arrow patterns, in combination with the…

We enumerate and characterize some classes of alternating and reverse alternating involutions avoiding a single pattern of length three or four. If on one hand the case of patterns of length three is trivial, on the other hand, the length…