Related papers: Flexible Schemes for Pattern-Avoiding Permutations
A deflatable permutation class is one in which the simple permutations are contained in a proper subclass. Deflatable permutation classes are often easier to describe and enumerate than non-deflatable ones. Some theorems which guarantee…
In this paper, a lemma in algebraic coding theory is established, which is frequently appeared in the encoding and decoding for algebraic codes such as Reed-Solomon codes and algebraic geometry codes. This lemma states that two vector…
For a set of permutation patterns $\Pi$, let $F^\text{st}_n(\Pi,q)$ be the st-polynomial of permutations avoiding all patterns in $\Pi$. Suppose $312\in\Pi$. For a class of permutation statistics which includes inversion and descent…
We further develop an algorithmic and diagrammatic computational framework for very general exact renormalization groups, where the embedded regularisation scheme, parametrised by a general cutoff function and infinitely many higher point…
In this paper, we revisit the application of generating trees to the pattern avoidance problem for permutations. In particular, we study this problem for certain general sets of patterns and propose a new procedure leveraging the FinLabel…
Given positive integers $r$ and $s$, we use inclusion-exclusion, weighted-counting of tilings, and dynamical programming, in order to enumerate, semi-efficiently, the classes of permutations mentioned in the title. In the process we revisit…
This addendum contains results about the inversion number and major index polynomials for permutations avoiding 321 which did not fit well into the original paper. In particular, we consider symmetry, unimodality, behavior modulo 2, and…
In this paper, we find an explicit formula for the generating function that counts the circular permutations of length n avoiding the pattern 23 4 1 whose enumeration was raised as an open problem by Rupert Li. This then completes in all…
We answer a question of R. J. Mathar and confirm that the counting sequence for $\bar{2}413\bar{5}$-avoiding permutations is the Invert transform of the Bell numbers. The proof relies on a simple decomposition of these permutations and the…
Coupled matrix and tensor factorizations (CMTF) are frequently used to jointly analyze data from multiple sources, also called data fusion. However, different characteristics of datasets stemming from multiple sources pose many challenges…
We introduce a notion of integration on the category of proper birational maps to a given variety $X$, with value in an associated Chow group. Applications include new birational invariants; comparison results for Chern classes and numbers…
Cancelable biometric techniques have been used to prevent the compromise of biometric data by generating and using their corresponding cancelable templates for user authentication. However, the non-invertible distance preserving…
We introduce the notion of 321-avoiding permutations in the affine Weyl group $W$ of type $A_{n-1}$ by considering the group as a George group (in the sense of Eriksson and Eriksson). This enables us to generalize a result of Billey,…
I adapt a recently introduced method for integrating over the unitary group (S. Aubert and C.S. Lam, J.Math.Phys. 44, 6112-6131 (2003)) to the orthogonal group. I derive explicit formulas for a number of one, two and three-vector integrals,…
Using techniques from Poisson approximation, we prove explicit error bounds on the number of permutations that avoid any pattern. Most generally, we bound the total variation distance between the joint distribution of pattern occurrences…
In this paper we introduce and study a class of tableaux which we call permutation tableaux; these tableaux are naturally in bijection with permutations, and they are a distinguished subset of the Le-diagrams of Alex Postnikov. The…
Extensible variants improve the modularity and expressiveness of programming languages: they allow program functionality to be decomposed into independent blocks, and allow seamless extension of existing code with both new cases of existing…
In this dissertation, we explore the structure of inversion graphs of permutations--a class of graphs that naturally arises by representing each permutation as a graph, where vertices correspond to entries and edges encode inversions.…
Pattern avoiding machines were introduced recently by Claesson, Cerbai and Ferrari as a particular case of the two-stacks in series sorting device. They consist of two restricted stacks in series, ruled by a right-greedy procedure and the…
Solving the first nonmonotonic, longer-than-three instance of a classic enumeration problem, we obtain the generating function $H(x)$ of all 1342-avoiding permutations of length $n$ as well as an {\em exact} formula for their number…