Related papers: Global patterns in signed permutations
A set of permutations is called sign-balanced if the set contains the same number of even permutations as odd permutations. Let $S_n(\sigma_1, \sigma_2, \ldots, \sigma_r)$ be the set of permutations in the symmetric group $S_n$ which avoids…
We consider the problem of packing fixed-length patterns into a permutation, and develop a connection between the number of large patterns and the number of bonds in a permutation. Improving upon a result of Kaplansky and Wolfowitz, we…
The simple permutations in two permutation classes --- the 321-avoiding permutations and the skew-merged permutations --- are enumerated using a uniform method. In both cases, these enumerations were known implicitly, by working backwards…
Let $G$ be a finite group. For all $a \in \Z$, such that $(a,|G|)=1$, the function $\rho_a: G \to G$ sending $g$ to $g^a$ defines a permutation of the elements of $G$. Motivated by a recent generalization of Zolotarev's proof of classic…
A normal variety $X$ is called $H$-spherical for the action of the complex reductive group $H$ if it contains a dense orbit of some Borel subgroup of $H$. We resolve a conjecture of Hodges--Yong by showing that their spherical permutations…
In the context of the genome rearrangement problem, we analyze two well known models, namely the reversal and the prefix reversal models, by exploiting the connection with the notion of permutation pattern. More specifically, for any $k$,…
In a Coxeter group $W$, an element is fully commutative if any two of its reduced expressions can be linked by a series of commutation of adjacent letters. These elements have particularly nice combinatorial properties, and also index a…
We explore the algebraic properties of a generalized version of the iterated-sums signature, inspired by previous work of F.~Kir\'aly and H.~Oberhauser. In particular, we show how to recover the character property of the associated linear…
We extend the short presentation due to [Borel '53] of the cohomology ring of a generalized flag manifold to a relatively short presentation of the cohomology of any of its Schubert varieties. Our result is stated in a root-system uniform…
The combinatorial theory for the set of parity alternating permutations is expounded. In view of the numbers of ascents and inversions, several enumerative aspects of the set are investigated. In particular, it is shown that signed Eulerian…
Previous work has shown that the disarray (or displacement) of an (affine) (signed) permutation is bounded in terms of its Coxeter length. Here, we characterize the permutations for which the bound is sharp in two ways: in terms of a…
Consider the number of permutations in the symmetric group on n letters that contain c copies of a given pattern. As c varies (with n held fixed) these numbers form a sequence whose properties we study for the monotone patterns and the…
We consider a generalization of the Ewens measure for the symmetric group, calculating moments of the characteristic polynomial and similar multiplicative statistics. In addition, we study the asymptotic behavior of linear statistics (such…
This dissertation presents a multifaceted look into the structural decomposition of permutation classes. The theory of permutation patterns is a rich and varied field, and is a prime example of how an accessible and intuitive definition…
Signed difference sets have interesting applications in communications and coding theory. A $(v,k,\lambda)$-difference set in a finite group $G$ of order $v$ is a subset $D$ of $G$ with $k$ distinct elements such that the expressions…
Springer numbers are an analog of Euler numbers for the group of signed permutations. Arnol'd showed that they count some objects called snakes, that generalize alternating permutations. Hoffman established a link between Springer numbers,…
We propose a generalized stochastic block model to explore the mesoscopic structures in signed networks by grouping vertices that exhibit similar positive and negative connection profiles into the same cluster. In this model, the group…
We consider avoidance of permutation patterns with designated gap sizes between pairs of consecutive letters. We call the patterns having such constraints distant patterns (DPs) and we show their relation to other pattern notions…
Recently, Babson and Steingrimsson (see \cite{BS}) introduced generalized permutations patterns that allow the requirement that two adjacent letters in a pattern must be adjacent in the permutation. In this paper we study the generating…
In the context of the genome rearrangement problem, we analyze two well known models, namely the block transposition and the prefix block transposition models, by exploiting the connection with the notion of permutation pattern. More…