Related papers: On pattern avoidance in matchings and involutions

Symmetry breaking for graphs and other combinatorial objects is notoriously hard. On the one hand, complete symmetry breaks are exponential in size. On the other hand, current, state-of-the-art, partial symmetry breaks are often considered…

We prove a conjecture of Crapo and Penne which characterizes isotopy classes of skew configurations with spindle-structure. We use this result in order to define an invariant, spindle-genus, for spindle-configurations. We also slightly…

Despite the fact that the field of pattern avoiding permutations has been skyrocketing over the last two decades, there are very few exhaustive generating algorithms for such classes of permutations. In this paper we introduce the notions…

We prove that any evolution equation admitting a potential symmetry can always be reduced to another evolution equation such that the potential symmetry in question maps into the group of its contact symmetries. Based on this fact is out…

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 deal with germs of diffeomorphisms that are reversible under an involution. We establish that this condition implies that, in general, both the family of reversing symmetries and the group of symmetries are not finite, in contrast with…

For $\mathrm{O}(\mathrm{q},k)$, the orthogonal group over a field $k$ of characteristic 2 with respect to a quadratic form $\mathrm{q}$, we discuss the isomorphism classes of fixed points of involutions. When the quadratic space is either…

Statistical models that possess symmetry arise in diverse settings such as random fields associated to geophysical phenomena, exchangeable processes in Bayesian statistics, and cyclostationary processes in engineering. We formalize the…

In this paper we study pattern-replacement equivalence relations on the set $S_n$ of permutations of length $n$. Each equivalence relation is determined by a set of patterns, and equivalent permutations are connected by pattern-replacements…

In 2019, B\'ona and Smith introduced the notion of strong pattern avoidance, saying that a permutation $\pi$ strongly avoids a pattern $\sigma$ if $\pi$ and $\pi^2$ both avoid $\sigma$. Recently, Archer and Geary generalized the idea of…

In this paper, we study the Wilf-type equivalence relations among multiset permutations. We identify all multiset equivalences among pairs of patterns consisting of a pattern of length three and another pattern of length at most four. To…

Comtet introduced the notion of indecomposable permutations in 1972. A permutation is indecomposable if and only if it has no proper prefix which is itself a permutation. Indecomposable permutations were studied in the literature in various…

We present a spectral study of the evolution matrix of the totally asymmetric exclusion process on a ring at half filling. The natural symmetries (translation, charge conjugation combined with reflection) predict only two fold degeneracies.…

We consider pairs (X,Y) where X is a compact, locally CAT(-1) space, and Y is a totally geodesic subspace. The inclusion induces an embedding of the boundaries at infinity of the universal covers; we focus on the case where these are…

Symmetric $k$-varieties generalize Riemannian sym\-me\-tric spaces to reductive groups defined over arbitrary fields. For most perfect fields, it is known that symmetric $k$-varieties are in one-to-one correspondence with isomorphy classes…

This paper presents a collection of experimental results regarding permutation pattern avoidance, focusing on cases where there are "many" patterns to be avoided.

We will exhibit several instances of the cyclic sieving phenomenon involving statistics and involutions on the following combinatorial families of objects: permutations, set partitions, perfect matchings, D-permutations (and its…

We develop the theory of linear evolution equations associated with the adjacency matrix of a graph, focusing in particular on infinite graphs of two kinds: uniformly locally finite graphs as well as locally finite line graphs. We discuss…

We exhibit two instances of the cyclic sieving phenomenon - one on dissections of a polygon of a fixed type and one on triangulations of a once-punctured polygon. We use these results to give refined enumerations of certain families of…

We propose a geometric and categorical approach to the Hodge Conjecture for all smooth projective complex varieties. By embedding any such variety into a flat family with general fibers smooth complete intersections, we prove the conjecture…