Related papers: Equivalence classes of permutations avoiding a pat…

Recently, B\'ona and Smith defined strong pattern avoidance, saying that a permutation $\pi$ strongly avoids a pattern $\tau$ if $\pi$ and $\pi^2$ both avoid $\tau$. They conjectured that for every positive integer $k$, there is a…

We discuss a new notion of pattern avoidance motivated by the operad theory: pattern avoidance in planar labelled trees. It is a generalisation of various types of consecutive pattern avoidance studied before: consecutive patterns in words,…

We construct a concrete isomorphism from the permutohedral variety to the regular semisimple Hessenberg variety associated to the Hessenberg function $h_+(i)=i+1$, $1\le i\le n-1$. In the process of defining the isomorphism, we introduce a…

It is well known that descents and excedances are equidistributed in the symmetric group. We show that the descent and excedance enumerators, summed over permutations with a fixed first letter are identical when we perform a simple change…

We define and discuss the utility of two equivalence graph classes over which a spectral projector-based graph Fourier transform is equivalent: isomorphic equivalence classes and Jordan equivalence classes. Isomorphic equivalence classes…

We consider the enumeration of pattern-avoiding involutions, focusing in particular on sets defined by avoiding a single pattern of length 4. As we demonstrate, the numerical data for these problems demonstrates some surprising behavior.…

We study graph products of groups from the viewpoint of measured group theory. We first establish a full measure equivalence classification of graph products of countably infinite groups over finite simple graphs with no transvection and no…

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…

Convolution is a ubiquitous operation in mathematics and computing. The Kripke semantics for substructural and interval logics motivates its study for quantale-valued functions relative to ternary relations. The resulting notion of…

In this article, we study the invariant differential forms which a correspondence of curves admits. We also try to classify the correspondences of $\mathbb{P}^1$ that admits such invariant differential forms.

We establish the hierarchy among twelve equivalence relations (similarities) on the class of relational structures: the equality, the isomorphism, the equimorphism, the full relation, four similarities of structures induced by similarities…

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…

A rectangulation is a decomposition of a rectangle into finitely many rectangles. Via natural equivalence relations, rectangulations can be seen as combinatorial objects with a rich structure, with links to lattice congruences, flip graphs,…

We present a new approach to the problem of enumerating permutations of length n that avoid a fixed consecutive pattern of length m. We use this idea to give explicit upper and lower bounds on the number of permutations avoiding a pattern…

Andr\'e proved that the number of alternating permutations on $\{1, 2, \dots, n\}$ is equal to the Euler number $E_n$. A refinement of Andr\'e's result was given by Entringer, who proved that counting alternating permutations according to…

In [BabStein] Babson and Steingr\'{\i}msson introduced generalized permutation patterns that allow the requirement that two adjacent letters in a pattern must be adjacent in the permutation. In [Kit1] Kitaev considered simultaneous…

In the present article we investigate the possibility of combining the usual Grassmann algebras with their ternary Z_3-graded counterpart, thus creating a more general algebra with coexisting quadratic and cubic constitutive relations. We…

We prove that the excedance relation on permutations defined by N. Bergeron and L. Gagnon actually extends to a congruence of the lattice on alternating sign matrices. Motivated by this example, we study all lattice congruences of the…

This thesis deals with three different aspects of the combinatorics of permutations. In the first two papers, two flavours of pattern avoiding permutations are examined; and in the third paper Young tableaux, which are closely related to…

In this note, we establish an equivalence of categories between the category of all eight-dimensional composition algebras with any given quadratic form $n$ over a field $k$ of characteristic not two, and a category arising from an action…