scholarly journals Inversion Generating Functions for Signed Pattern Avoiding Permutations

10.37236/6545 ◽  
2017 ◽  
Vol 24 (1) ◽  
Author(s):  
Naiomi T. Cameron ◽  
Kendra Killpatrick
Keyword(s):  
Generating Functions ◽  
Combinatorial Proof ◽  
Hyperoctahedral Group ◽  
Major Index ◽  
Signed Permutations ◽  
Mahonian Statistics ◽  
Almost All ◽  
Open Question ◽  
Pattern Avoiding Permutations

We consider the classical Mahonian statistics on the set $B_n(\Sigma)$ of signed permutations in the hyperoctahedral group $B_n$ which avoid all patterns in $\Sigma$, where $\Sigma$ is a set of patterns of length two.  In 2000, Simion gave the cardinality of $B_n(\Sigma)$ in the cases where $\Sigma$ contains either one or two patterns of length two and showed that $\left|B_n(\Sigma)\right|$ is constant whenever $\left|\Sigma\right|=1$, whereas in most but not all instances where $\left|\Sigma\right|=2$, $\left|B_n(\Sigma)\right|=(n+1)!$.  We answer an open question of Simion by providing bijections from $B_n(\Sigma)$ to $S_{n+1}$ in these cases where $\left|B_n(\Sigma)\right|=(n+1)!$.  In addition, we extend Simion's work by providing a combinatorial proof in the language of signed permutations for the major index on $B_n(21, \bar{2}\bar{1})$ and by giving the major index on $D_n(\Sigma)$ for $\Sigma =\{21, \bar{2}\bar{1}\}$ and $\Sigma=\{12,21\}$.  The main result of this paper is to give the inversion generating functions for $B_n(\Sigma)$ for almost all sets $\Sigma$ with $\left|\Sigma\right|\leq2.$

scholarly journals MacMahon-type Identities for Signed Even Permutations

10.37236/1836 ◽  
2004 ◽  
Vol 11 (1) ◽  
Author(s):  
Dan Bernstein
Keyword(s):  
Symmetric Group ◽  
Alternating Group ◽  
Hyperoctahedral Group ◽  
Major Index ◽  
Signed Permutations ◽  
Natural Analogues ◽  
Classic Theorem

MacMahon's classic theorem states that the length and major index statistics are equidistributed on the symmetric group $S_n$. By defining natural analogues or generalizations of those statistics, similar equidistribution results have been obtained for the alternating group $A_n$ by Regev and Roichman, for the hyperoctahedral group $B_n$ by Adin, Brenti and Roichman, and for the group of even-signed permutations $D_n$ by Biagioli. We prove analogues of MacMahon's equidistribution theorem for the group of signed even permutations and for its subgroup of even-signed even permutations.

scholarly journals Signed Words and Permutations II; The Euler-Mahonian Polynomials

10.37236/1879 ◽  
2005 ◽  
Vol 11 (2) ◽  
Author(s):  
Dominique Foata ◽  
Guo-Niu Han
Keyword(s):  
Symmetric Group ◽  
Generating Functions ◽  
Statistical Study ◽  
Record Values ◽  
The Other ◽  
Length Function ◽  
Major Index ◽  
Signed Permutations ◽  
Inversion Number ◽  
The One

As for the symmetric group of ordinary permutations there is also a statistical study of the group of signed permutations, that consists of calculating multivariable generating functions for this group by statistics involving record values and the length function. Two approaches are here systematically explored, using the flag-major index on the one hand, and the flag-inversion number on the other hand. The MacMahon Verfahren appears as a powerful tool throughout.

scholarly journals A New Bijective Proof of Babson and Steingrímsson's Conjecture

10.37236/6411 ◽  
2017 ◽  
Vol 24 (2) ◽  
Author(s):  
Joanna N. Chen ◽  
Shouxiao Li
Keyword(s):  
Generating Functions ◽  
Permutation Patterns ◽  
Bijective Proof ◽  
Major Index ◽  
Mahonian Statistics ◽  
Pattern Functions

Babson and Steingrímsson introduced generalized permutation patterns and showed that most of the Mahonian statistics in the literature can be expressed by the combination of generalized pattern functions. Particularly, they defined a new Mahonian statistic in terms of generalized pattern functions, which is denoted $stat$. Given a permutation $\pi$, let $des(\pi)$ denote the descent number of $\pi$ and $maj(\pi)$ denote the major index of $\pi$. Babson and Steingrímsson conjectured that $(des,stat)$ and $(des,maj)$ are equidistributed on $S_n$. Foata and Zeilberger settled this conjecture using q-enumeration, generating functions and Maple packages ROTA and PERCY. Later, Burstein provided a bijective proof of a refinement of this conjecture. In this paper, we give a new bijective proof of this conjecture.

scholarly journals Equidistributions of Mahonian Statistics over Pattern Avoiding Permutations

10.37236/7137 ◽  
2018 ◽  
Vol 25 (1) ◽  
Author(s):  
Nima Amini
Keyword(s):  
Linear Combination ◽  
Generating Functions ◽  
Block Decomposition ◽  
Dyck Paths ◽  
Mahonian Statistics ◽  
Pattern Avoiding Permutations

A Mahonian $d$-function is a Mahonian statistic that can be expressed as a linear combination of vincular pattern statistics of length at most $d$. Babson and Steingrímsson classified all Mahonian 3-functions up to trivial bijections and identified many of them with well-known Mahonian statistics in the literature. We prove a host of Mahonian 3-function equidistributions over pattern avoiding sets of permutations. Tools used include block decomposition, Dyck paths and generating functions.

scholarly journals The Diverse Calpain Family in Trypanosomatidae: Functional Proteins Devoid of Proteolytic Activity?

Cells ◽  
2021 ◽  
Vol 10 (2) ◽  
pp. 299
Author(s):  
Vítor Ennes-Vidal ◽  
Marta Helena Branquinha ◽  
André Luis Souza dos Santos ◽  
Claudia Masini d’Avila-Levy
Keyword(s):  
Proteolytic Activity ◽  
Current Knowledge ◽  
Current Therapy ◽  
Calcium Dependent ◽  
Administration Routes ◽  
Life Threatening ◽  
Living Organisms ◽  
Almost All ◽  
Open Question ◽  
Calpain Inhibitors

Calpains are calcium-dependent cysteine peptidases that were originally described in mammals and, thereafter, their homologues were identified in almost all known living organisms. The deregulated activity of these peptidases is associated with several pathologies and, consequently, huge efforts have been made to identify selective inhibitors. Trypanosomatids, responsible for life-threatening human diseases, possess a large and diverse family of calpain sequences in their genomes. Considering that the current therapy to treat trypanosomatid diseases is limited to a handful of drugs that suffer from unacceptable toxicity, tough administration routes, like parenteral, and increasing treatment failures, a repurposed approach with calpain inhibitors could be a shortcut to successful chemotherapy. However, there is a general lack of knowledge about calpain functions in these parasites and, currently, the proteolytic activity of these proteins is still an open question. Here, we highlight the current research and perspectives on trypanosomatid calpains, overview calpain description in these organisms, and explore the potential of targeting the calpain system as a therapeutic strategy. This review gathers the current knowledge about this fascinating family of peptidases as well as insights into the puzzle: are we unable to measure calpain activity in trypanosomatids, or are the functions of these proteins devoid of proteolytic activity in these parasites?

scholarly journals Odd and Even Major Indices and One-Dimensional Characters for Classical Weyl Groups

2020 ◽  
Vol 24 (4) ◽  
pp. 809-835
Author(s):  
Francesco Brenti ◽  
Paolo Sentinelli
Keyword(s):  
Generating Functions ◽  
Weyl Groups ◽  
One Dimensional ◽  
Major Index ◽  
The One

Abstract We define and study odd and even analogues of the major index statistics for the classical Weyl groups. More precisely, we show that the generating functions of these statistics, twisted by the one-dimensional characters of the corresponding groups, always factor in an explicit way. In particular, we obtain odd and even analogues of Carlitz’s identity, of the Gessel–Simion Theorem, and a parabolic extension, and refinement, of a result of Wachs.

scholarly journals Eulerian Numbers Associated with Arithmetical Progressions

10.37236/7182 ◽  
2018 ◽  
Vol 25 (1) ◽  
Author(s):  
José L. Ramírez ◽  
Sergio N. Villamarin ◽  
Diego Villamizar
Keyword(s):  
Generating Functions ◽  
Combinatorial Identities ◽  
Combinatorial Interpretation ◽  
Eulerian Numbers ◽  
Signed Permutations ◽  
Whitney Numbers

In this paper, we give a combinatorial interpretation of the $r$-Whitney-Eulerian numbers by means of coloured signed permutations. This sequence is a generalization of the well-known Eulerian numbers and it is connected to $r$-Whitney numbers of the second kind. Using generating functions, we provide some combinatorial identities and the log-concavity property. Finally, we show some basic congruences involving the $r$-Whitney-Eulerian numbers.

scholarly journals 0-Hecke algebra actions on coinvariants and flags

2011 ◽  
Vol DMTCS Proceedings vol. AO,... (Proceedings) ◽  
Author(s):  
Jia Huang
Keyword(s):  
Generating Functions ◽  
Hecke Algebra ◽  
Flag Variety ◽  
Major Index ◽  
Inversion Number ◽  
International Audience ◽  
Descent Set ◽  
Complete Flag ◽  
Coinvariant Algebra

International audience By investigating the action of the 0-Hecke algebra on the coinvariant algebra and the complete flag variety, we interpret generating functions counting the permutations with fixed inverse descent set by their inversion number and major index. En étudiant l'action de l'algèbre de 0-Hecke sur l'algèbre coinvariante et la variété de drapeaux complète, nous interprétons les fonctions génératrices qui comptent les permutations avec un ensemble inverse de descentes fixé, selon leur nombre d'inversions et leur "major index''.

scholarly journals A Basis for the Diagonally Signed-Symmetric Polynomials

10.37236/3224 ◽  
2013 ◽  
Vol 20 (4) ◽  
Author(s):  
José Manuel Gómez
Keyword(s):  
Polynomial Ring ◽  
Symmetric Polynomials ◽  
Hyperoctahedral Group ◽  
Free Basis ◽  
Signed Permutations ◽  
Invariant Ring

Let $n\ge 1$ be an integer and let $B_{n}$ denote the hyperoctahedral group of rank $n$. The group $B_{n}$ acts on the polynomial ring $Q[x_{1},\dots,x_{n},y_{1},\dots,y_{n}]$ by signed permutations simultaneously on both of the sets of variables $x_{1},\dots,x_{n}$ and $y_{1},\dots,y_{n}.$ The invariant ring $M^{B_{n}}:=Q[x_{1},\dots,x_{n},y_{1},\dots,y_{n}]^{B_{n}}$  is the ring of diagonally signed-symmetric polynomials. In this article, we provide an explicit free basis of $M^{B_{n}}$ as a module over the ring of symmetric polynomials on both of the sets of variables $x_{1}^{2},\dots, x^{2}_{n}$ and  $y_{1}^{2},\dots, y^{2}_{n}$ using signed descent monomials.

scholarly journals Cyclic sieving for longest reduced words in the hyperoctahedral group

2010 ◽  
Vol DMTCS Proceedings vol. AN,... (Proceedings) ◽  
Author(s):  
T. K. Petersen ◽  
L. Serrano
Keyword(s):  
Generating Function ◽  
Hyperoctahedral Group ◽  
Cyclic Action ◽  
Orbit Structure ◽  
Cyclic Sieving Phenomenon ◽  
Major Index ◽  
Nous Montrons ◽  
International Audience ◽  
Cyclic Sieving ◽  
Cette Action

International audience We show that the set $R(w_0)$ of reduced expressions for the longest element in the hyperoctahedral group exhibits the cyclic sieving phenomenon. More specifically, $R(w_0)$ possesses a natural cyclic action given by moving the first letter of a word to the end, and we show that the orbit structure of this action is encoded by the generating function for the major index on $R(w_0)$. Nous montrons que l'ensemble $R(w_0)$ des expressions réduites pour l'élément le plus long du groupe hyperoctaédral présente le phénomène cyclique de tamisage. Plus précisément, $R(w_0)$ possède une action naturelle cyclique donnée par le déplacement de la première lettre d'un mot vers la fin, et nous montrons que la structure d'orbite de cette action est codée par la fonction génératrice pour l'indice majeur sur $R(w_0)$.

Sign in / Sign up

Export Citation Format

Share Document