English
Related papers

Related papers: Number of permutations with same peak set for sign…

200 papers

An occurrence of a classical pattern p in a permutation \pi is a subsequence of \pi whose letters are in the same relative order (of size) as those in p. In an occurrence of a generalized pattern, some letters of that subsequence may be…

Combinatorics · Mathematics 2008-05-31 Einar Steingrimsson

In this paper, we show that a $D$-type map $\Phi_D:M_n\rightarrow M_n$ with $D=(n-2)I_n+P_{\pi_1}+P_{\pi_2}$ induced by a pair $\{\pi_1,\pi_2\}$ of permutations of $(1,2,..., n)$ is positive if $\{\pi_1,\pi_2\}$ has property (C). The…

Quantum Physics · Physics 2013-04-16 Haili Zhao , Jinchuan Hou

A real representation $\pi$ of a finite group may be regarded as a homomorphism to an orthogonal group $\Or(V)$. For symmetric groups $S_n$, alternating groups $A_n$, and products $S_n \times S_{n'}$ of symmetric groups, we give criteria…

Representation Theory · Mathematics 2019-06-19 Jyotirmoy Ganguly , Steven Spallone

We investigate dynamical properties of the set of permutations of $\mathbb{Z}^d$ with restricted movement, i.e., permutations $\pi $ of $\mathbb{Z}^d$ such that $\pi (\mathbf{n})-\mathbf{n}$ lies, for every $\mathbf{n}\in \mathbb{Z}^d$, in…

Dynamical Systems · Mathematics 2017-06-26 Klaus Schmidt , Gabriel Strasser

The linear span P_n of the sums of all permutations in the symmetric group S_n with a given set of peaks is a sub-algebra of the symmetric group algebra, due to Nyman. This peak algebra is a left ideal of the descent algebra D_n; and the…

Rings and Algebras · Mathematics 2007-05-23 Manfred Schocker

Let $\Omega=\{1,2,...,n\}$ where $n \ge 2$. The {\em shape} of an ordered set partition $P=(P_1,..., P_k)$ of $\Omega$ is the integer partition $\lambda=(\lambda_1,...,\lambda_k)$ defined by $\lambda_i = |P_i|$. Let G be a group of…

Group Theory · Mathematics 2007-05-23 William J. Martin , Bruce E. Sagan

The signed enhanced principal rank characteristic sequence (sepr-sequence) of a given $n \times n$ Hermitian matrix $B$ is the sequence $t_1t_2 \cdots t_n$, where $t_k$ is $\tt A^*$, $\tt A^+$, $\tt A^-$, $\tt N$, $\tt S^*$, $\tt S^+$, or…

Rings and Algebras · Mathematics 2024-01-03 Xavier Martínez-Rivera , Kamonchanok Saejeam

Let $\alpha(n)$ denote the number of perfect square permutations in the symmetric group $S_n$. The conjecture $\alpha(2n+1) = (2n+1) \alpha(2n)$, provided by Stanley[4], was proved by Blum[1] using a generating function. This paper presents…

Combinatorics · Mathematics 2024-07-11 Yuewen Luo

Let $\mathfrak{S}_n$ and $\mathfrak{B}_n$ denote the respective sets of ordinary and bigrassmannian (BG) permutations of order $n$, and let $(\mathfrak{S}_n,\leq)$ denote the Bruhat ordering permutation poset. We study the restricted poset…

Combinatorics · Mathematics 2018-03-02 John Engbers , Adam Hammett

For the elements of a Coxeter group, we present a statistic called depth, defined in terms of factorizations of the elements into products of reflections. Depth is bounded above by length and below by the average of length and reflection…

Combinatorics · Mathematics 2014-08-21 T. Kyle Petersen , Bridget Eileen Tenner

Let $\pi$ be a cycle permutation that can be expressed as one-line $\pi = \pi_1\pi_2 \cdot\cdot\cdot \pi_n$ and a cycle form $\pi = (c_1,c_2, ..., c_n)$. Archer et al. introduced the notion of pattern avoidance of one-line and all cycle…

Combinatorics · Mathematics 2024-09-27 Junyao Pan

We study Ramsey-type problems on sets avoiding sequences whose consecutive differences have a fixed relative order. For a given permutation $\pi \in S_k$, a $\pi$-wave is a sequence $x_1 < \cdots < x_{k+1}$ such that $x_{i+1} - x_i >…

Combinatorics · Mathematics 2023-08-31 Kevin Cong

We study several aspects of the M\"{o}bius function, $\mu[\sigma,\pi]$, on the poset of permutations under the pattern containment order. First, we consider cases where the lower bound of the poset is indecomposable. We show that…

Combinatorics · Mathematics 2020-12-29 David Marchant

For a given permutation $\pi_n$ in $S_n$, a random permutation graph is formed by including an edge between two vertices $i$ and $j$ if and only if $(i - j) (\pi_n(i) - \pi_n (j)) < 0$. In this paper, we study various statistics of random…

Combinatorics · Mathematics 2021-08-02 Oğuz Gürerk , Ümit Işlak , Mehmet Akif Yıldız

Let $S_n$ denote the symmetric group. We consider \begin{equation*} N_{\ell}(n) := \frac{\left\vert Hom\left( \mathbb{Z}^{\ell},S_n\right) \right\vert}{n!} \end{equation*} which also counts the number of $\ell$-tuples $\pi=\left( \pi_1,…

Combinatorics · Mathematics 2024-09-10 Abdelmalek Abdesselam , Bernhard Heim , Markus Neuhauser

We study the orbits under the natural action of a permutation group $G \subseteq S_n$ on the powerset $\mathscr{P}(\{1, \dots , n\})$. The permutation groups having exactly $n+1$ orbits on the powerset can be characterized as set-transitive…

Group Theory · Mathematics 2021-08-03 Alexander Betz , Max Chao-Haft , Ting Gong , Thomas Michael Keller , Anthony Ter-Saakov , Yong Yang

In this paper we present a topological framework for studying signed permutations and their reversal distance. As a result we can give an alternative approach and interpretation of the Hannenhalli-Pevzner formula for the reversal distance…

Combinatorics · Mathematics 2014-10-20 Fenix W. D. Huang , Christian M. Reidys

We derive some new signed Mahonian polynomials over the complex reflection group $G(r,1,n)=C_r\wr\mathfrak{S}_n$, where the "sign" is taken to be any of the $2r$ $1$-dim characters and the "Mahonian" statistics are the $\mathsf{lmaj}$…

Combinatorics · Mathematics 2019-02-26 Huilan Chang , Sen-Peng Eu , Shishuo Fu , Zhicong Lin , Yuan-Hsun Lo

Two permutations $s$ and $t$ are $k$-similar if they can be decomposed into subpermutations $s^1, \ldots, s^k$ and $t^1, \ldots, t^k$ such that $s^i$ is order-isomorphic to $t^i$ for all $i$. Recently, Dudek, Grytczuk and Ruci\'nski posed…

Combinatorics · Mathematics 2023-01-24 Carla Groenland , Tom Johnston , Dániel Korándi , Alexander Roberts , Alex Scott , Jane Tan

It is known when we call a poset P, a $\mathcal{P}$-chain permutational poset, given a subset of permutations $\mathcal{P}$ of the symmetric group $S_{n}$. In this work, we use the same idea to study subsets of words of length $n$, that are…

Combinatorics · Mathematics 2025-12-16 Amrita Acharyya
‹ Prev 1 8 9 10 Next ›