Related papers: Monotone triangles and 312 Pattern Avoidance
We present a simple bijection between permutation matrices and descending plane partitions without special parts. This bijection is already mentioned in work of P. Lalonde (without giving the details); it involves the inversion words of…
We introduce a general axiomatic framework for algebras with triangular decomposition, which allows for a systematic study of the Bernstein-Gelfand-Gelfand Category $\mathcal{O}$. The framework is stated via three relatively simple axioms;…
We construct a new bijection between the set of $n\times k$ $0$-$1$ matrices with no three $1$'s forming a $\Gamma$ configuration and the set of $(n,k)$-Callan sequences, a simple structure counted by poly-Bernoulli numbers. We give two…
We show that matchings avoiding certain partial patterns are counted by the 3-Catalan numbers. We give a characterization of 12312-avoiding matchings in terms of restrictions on the corresponding oscillating tableaux. We also find a…
A diagonally symmetric alternating sign matrix (DSASM) is a symmetric matrix with entries $-1$, $0$ and $1$, where the nonzero entries alternate in sign along each row and column, and the sum of the entries in each row and column equals…
Previous work has shown that the disarray (or displacement) of an (affine) (signed) permutation is bounded in terms of its Coxeter length. Here, we characterize the permutations for which the bound is sharp in two ways: in terms of a…
The orbifold construction $A\mapsto A^G$ for a finite group $G$ is fundamental in rational conformal field theory. The construction of $Rep(A^G)$ from $Rep(A)$ on the categorical level, often called gauging, is also prominent in the study…
The aim of this work is the study of the class of periodic parallelogram polyominoes, and two of its variantes. These objets are related to 321-avoiding affine permutations. We first provide a bijection with the set of triangles under Dyck…
We investigate pattern avoidance in permutations satisfying some additional restrictions. These are naturally considered in terms of avoiding patterns in linear extensions of certain forest-like partially ordered sets, which we call binary…
We perform a systematic analysis of soft supersymmetry breaking terms at the one loop level in a large class of string effective field theories. This includes the so-called anomaly mediated contributions. We illustrate our results for…
Classical pattern avoidance and occurrence are well studied in the symmetric group $\mathcal{S}_{n}$. In this paper, we provide explicit recurrence relations to the generating functions counting the number of classical pattern occurrence in…
Much of the power of probabilistic methods in modelling language comes from their ability to compare several derivations for the same string in the language. An important starting point for the study of such cross-derivational properties is…
The structure of three pattern classes Av(2143, 4321), Av(2143, 4312) and Av(1324, 4312) is determined using the machinery of monotone grid classes. This allows the permutations in these classes to be described in terms of simple diagrams…
Recently researchers working in the LFG framework have proposed algorithms for taking advantage of the implicit context-free components of a unification grammar [Maxwell 96]. This paper clarifies the mathematical foundations of these…
Fix a finite group $G$. We study the computational complexity of counting problems of the following flavor: given a group $\Gamma$, count the number of homomorphisms $\Gamma \to G$. Our first result establishes that this problem is…
We consider the mixed search game against an agile and visible fugitive. This is the variant of the classic fugitive search game on graphs where searchers may be placed to (or removed from) the vertices or slide along edges. Moreover, the…
Motivated by applications in the theory of numeration systems and recognizable sets of integers, this paper deals with morphic words when erasing morphisms are taken into account. Cobham showed that if an infinite word $w =g(f^\omega(a))$…
The conditions for the cancellation of all gauge, gravitational, and mixed anomalies of $N=1$ supersymmetric models in six dimensions are reviewed and illustrated by a number of examples. Of particular interest are models that cannot be…
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 construct a direct natural bijection between descending plane partitions without any special part and permutations. The directness is in the sense that the bijection avoids any reference to nonintersecting lattice paths. The advantage of…