Related papers: Wilf-collapse in permutation classes having two ba…
In this paper, we enumerate Dumont permutations of the fourth kind avoiding or containing certain permutations of length 4. We also conjecture a Wilf-equivalence of two 4-letter patterns on Dumont permutations of the first kind.
The effect of replacing a basis element on the way the basis spans other elements is studied. This leads to a new characterization of binary matroids.
A permutation is (1-23-4)-avoiding if it contains no four entries, increasing left to right, with the middle two adjacent in the permutation. Here we give a 2-variable recurrence for the number of such permutations, improving on the…
We consider the three new crossing probabilities for percolation recently found via conformal field theory by Simmons, Kleban and Ziff. We prove that all three of them (i) may be simply expressed in terms of Cardy's and Watts' crossing…
We denote by Conc(L) the semilattice of all finitely generated congruences of a lattice L. For varieties (i.e., equational classes) V and W of lattices such that V is contained neither in W nor its dual, and such that every simple member of…
Important objects of study in $\tau$-tilting theory include the $\tau$-tilting pairs over an algebra on the form $kQ/I$, with $kQ$ being a path algebra and $I$ an admissible ideal. In this paper, we study aspects of the combinatorics of…
We overcome the barrier of constructing N=4 superconformal models in one space dimension for more than three particles. The D(2,1;alpha) superalgebra of our systems is realized on the coordinates and momenta of the particles, their…
We investigate the following surprisingly widespread phenomenon which we call The Rule of Three: in order for a particular kind of commutation relation to hold for subsequences of elements of a ring labeled by any subset of indices, it is…
Given a permutation w, we look at the range of how often a simple reflection s_k appears in reduced decompositions of w. We compute the minimum and give a sharp upper bound on the maximum. That bound is in terms of 321- and 3412-patterns in…
We show that the Weil representation associated with any discriminant form admits a basis in which the action of the representation involves algebraic integers. The action of a general element of $\operatorname{SL}_{2}(\mathbb{Z})$ on many…
We study the structure and enumeration of the final two 2x4 permutation classes, completing a research program that has spanned almost two decades. For both classes, careful structural analysis produces a complicated functional equation.…
Permutons are probability measures on the unit square with uniform marginals that provide a natural way to describe limits of permutations. We are interested in the permuton limits for permutations sampled uniformly from certain…
The notion of a mesh pattern was introduced recently, but it has already proved to be a useful tool for description purposes related to sets of permutations. In this paper we study eight mesh patterns of small lengths. In particular, we…
We have made a systematic numerical study of the 16 Wilf classes of length-5 classical pattern-avoiding permutations from their generating function coefficients. We have extended the number of known coefficients in fourteen of the sixteen…
It is known that recursive training from generative models can lead to the so called `collapse' of the simulated probability distribution. This note shows that one in fact gets two different asymptotic behaviours depending on whether an…
We characterise those permutation classes whose simple permutations are monotone griddable. This characterisation is obtained by identifying a set of nine substructures, at least one of which must occur in any simple permutation containing…
Machines whose main purpose is to permute and sort data are studied. The sets of permutations that can arise are analysed by means of finite automata and avoided pattern techniques. Conditions are given for these sets being enumerated by…
We prove that there are permutation classes (hereditary properties of permutations) of every growth rate (Stanley-Wilf limit) at least \lambda \approx 2.48187, the unique real root of x^5-2x^4-2x^2-2x-1, thereby establishing a conjecture of…
The boolean elements of a Coxeter group have been characterized and shown to possess many interesting properties and applications. Here we introduce "prism permutations," a generalization of those elements, characterizing the prism…
It is known that the set of permutations, under the pattern containment ordering, is not a partial well-order. Characterizing the partially well-ordered closed sets (equivalently: down sets or ideals) in this poset remains a wide-open…