Related papers: On pattern avoidance in matchings and involutions
Convolutional neural networks revolutionized computer vision and natrual language processing. Their efficiency, as compared to fully connected neural networks, has its origin in the architecture, where convolutions reflect the translation…
In this paper we propose a notion of pattern avoidance in binary trees that generalizes the avoidance of contiguous tree patterns studied by Rowland and non-contiguous tree patterns studied by Dairyko, Pudwell, Tyner, and Wynn.…
The purpose of this article is to motivate the study of invariant, and especially conformally invariant, differential pairings. Since a general theory is lacking, this work merely presents some interesting examples of these pairings,…
We study the existence of families of periodic solutions in a neighbourhood of a symmetric equilibrium point in two classes of Hamiltonian systems with involutory symmetries. In both classes, involutions reverse the sign of the Hamiltonian…
Exactly solvable models are essential in physics. For many-body spin-1/2 systems, an important class of such models consists of those that can be mapped to free fermions hopping on a graph. We provide a complete characterization of models…
In a previous work, B\'ona and Pantone studied permutations that avoided all but one pattern of length $k$ that began with a length $k-1$ increasing subsequence. We draw the connection between that idea and distant patterns, first discussed…
We consider a random permutation drawn from the set of permutations of length $n$ that avoid some given set of patterns of length 3. We show that the number of occurrences of another pattern $\sigma$ has a limit distribution, after suitable…
Given a central simple algebra with involution over an arbitrary field, \'etale subalgebras contained in the space of symmetric elements are investigated. The method emphasizes the similarities between the various types of involutions and…
We present the poset of Borel congruence classes of anti-symmetric matrices ordered by containment of closures. We show that there exists a bijection between the set of these classes and the set of involutions of the symmetric group. We…
An important problem from invariant theory is to describe the subspace of a tensor power of a representation invariant under the action of the group. According to Weyl's classic, the first main (later: 'fundamental') theorem of invariant…
We extend the idea of interval pattern avoidance defined by Yong and the author for $S_n$ to arbitrary Weyl groups using the definition of pattern avoidance due to Billey and Braden, and Billey and Postnikov. We show that, as previously…
Many 2D lattice models of physical phenomena are conjectured to have conformally invariant scaling limits: percolation, Ising model, self-avoiding polymers, ... This has led to numerous exact (but non-rigorous) predictions of their scaling…
For each adjoint variety not of type $A$ or $C$, we study the irreducible component of the Hilbert scheme which parametrizes all smooth conics. We prove that its normalization is a spherical variety by using contact geometry, and then…
Any representation of data involves arbitrary investigator choices. Because those choices are external to the data-generating process, each choice leads to an exact symmetry, corresponding to the group of transformations that takes one…
We develop a comprehensive theory of the stable representation categories of several sequences of groups, including the classical and symmetric groups, and their relation to the unstable categories. An important component of this theory is…
We prove a convolution formula for the conjugacy classes in symmetric groups conjectured by the second author. A combinatorial interpretation of coefficients is provided. As a main tool we introduce new semigroup of partial permutations. We…
A systematic study of avoidance of mesh patterns of length 2 was conducted by Hilmarsson et al. in 2015. In a recent paper Kitaev and Zhang examined the distribution of the aforementioned patterns. The aim of this paper is to prove more…
The Linearization Theorem for proper Lie groupoids organizes and generalizes several results for classic geometries. Despite the various approaches and recent works on the subject, the problem of understanding invariant linearization…
A permutation is so-called two stack sortable if it (i) avoids the (scattered) pattern 2-3-4-1, and (ii) contains a 3-2-4-1 pattern only as part of a 3-5-2-4-1 pattern. Here we show that the permutations on [n] satisfying condition (ii)…
Defant, Engen, and Miller defined a permutation to be uniquely sorted if it has exactly one preimage under West's stack-sorting map. We enumerate classes of uniquely sorted permutations that avoid a pattern of length three and a pattern of…