Related papers: Centrosymmetric Permutations and Involutions Avoid…
The discrete symmetries of the Lorentz group are on the one hand a `complex' interplay between linear and anti-linear operations on spinor fields and on the other hand simple linear reflections of the Minkowski space. We define operations…
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…
This is my PhD thesis supervised by Professor Jerzy Weyman. A symmetric quiver $(Q,\sigma)$ is a finite quiver without oriented cycles $Q=(Q_0,Q_1)$ equipped with a contravariant involution $\sigma$ on $Q_0\sqcup Q_1$. The involution allows…
This paper analyzes relations between pattern avoidance of certain permutations and graphs on staircase grids and boundary grids, and proves two conjectures posed by Bean, Tannock, and Ulfarsson (2015). More specifically, this paper…
We consider the distribution of ascents, descents, peaks, valleys, double ascents, and double descents over permutations avoiding a set of patterns. Many of these statistics have already been studied over sets of permutations avoiding a…
A permutation is said to be a square if it can be obtained by shuffling two order-isomorphic patterns. The definition is intended to be the natural counterpart to the ordinary shuffle of words and languages. In this paper, we tackle the…
We consider a random permutation drawn from the set of 321-avoiding permutations of length $n$ and show that the number of occurrences of another pattern $\sigma$ has a limit distribution, after scaling by $n^{m+\ell}$ where $m$ is the…
Modern convolutional networks are not shift-invariant, as small input shifts or translations can cause drastic changes in the output. Commonly used downsampling methods, such as max-pooling, strided-convolution, and average-pooling, ignore…
Permutations that avoid given patterns are among the most classical objects in combinatorics and have strong connections to many fields of mathematics, computer science and biology. In this paper we study fixed points of both 123- and…
There are several interesting filtrations on the Cartan subalgebra of a complex simple Lie algebra coming from very different contexts: one is the principal filtration coming from the Langlands dual, one is coming from the Clifford algebra…
Dokos et. al. studied the distribution of two statistics over permutations $\mathfrak{S}_n$ of $\{1,2,\dots, n\}$ that avoid one or more length three patterns. A permutation $\sigma\in\mathfrak{S}_n$ contains a pattern…
Symmetry invariants of a group specify the classes of quasiparticles, namely the classes of projective irreducible co-representations in systems having that symmetry. More symmetry invariants exist in discrete point groups than the full…
Some changes in a recent convolution formula are performed here in order to clean it up by using more conventional notations and by making use of more referrenced and documented components (namely Sierpi\'nski's polynomials, the Thue-Morse…
The number of 123-avoiding permutation on $\{1,2,\ldots,n\}$ with a fixed leading terms is counted by the ballot numbers. The same holds for $132$-avoiding permutations. These results were proved by Miner and Pak using the…
This paper investigates type isomorphism in a lambda-calculus with intersection and union types. It is known that in lambda-calculus, the isomorphism between two types is realised by a pair of terms inverse one each other. Notably,…
A 321-k-gon-avoiding permutation pi avoids 321 and the following four patterns: k(k+2)(k+3)...(2k-1)1(2k)23...(k+1), k(k+2)(k+3)...(2k-1)(2k)123...(k+1), (k+1)(k+2)(k+3)...(2k-1)1(2k)23...k, (k+1)(k+2)(k+3)...(2k-1)(2k)123...k. The…
We prove that the number of permutations which avoid 132-patterns and have exactly one 123-pattern equals (n-2)2^(n-3). We then give a bijection onto the set of permutations which avoid 123-patterns and have exactly one 132-pattern.…
Three complementation-like involutions are constructed on permutations to prove, and in some cases generalize, all remaining fourteen joint symmetric equidistribution conjectures of Lv and Zhang. Further enumerative results are obtained for…
Phylogenetic invariants are equations that vanish on algebraic varieties associated with Markov processes that model molecular substitutions on phylogenetic trees. For practical applications, it is essential to understand these equations…
In this paper we apply the previously derived formalism of permutation orbifold conformal field theories to N=2 supersymmetric minimal models. By interchanging extensions and permutations of the factors we find a very interesting structure…