scholarly journals The colored symmetric and exterior algebras

2020 ◽  
Vol DMTCS Proceedings, 28th... ◽  
Author(s):  
Rafael S. Gonzalez D'Leon

International audience In this extended abstract we present colored generalizations of the symmetric algebra and its Koszul dual, the exterior algebra. The symmetric group Sn acts on the multilinear components of these algebras. While Sn acts trivially on the multilinear components of the colored symmetric algebra, we use poset topology techniques to describe the representation on its Koszul dual. We introduce an Sn-poset of weighted subsets that we call the weighted boolean algebra and we prove that the multilinear components of the colored exterior algebra are Sn- isomorphic to the top cohomology modules of its maximal intervals. We show that the two colored Koszul dual algebras are Koszul in the sense of Priddy et al.

Author(s):  
JINKUI WAN ◽  
WEIQIANG WANG

AbstractWe determine the invariants, with arbitrary determinant twists, of the parabolic subgroups of the finite general linear group GLn(q) acting on the tensor product of the symmetric algebra S•(V) and the exterior algebra ∧•(V) of the natural GLn(q)-module V. In addition, we obtain the graded multiplicity of the Steinberg module of GLn(q) in S•(V) ⊗ ∧•(V), twisted by an arbitrary determinant power.


2015 ◽  
Vol 62 (1) ◽  
pp. 31-35
Author(s):  
Khondokar M Ahmed ◽  
Saraban Tahora

In the present paper some aspects of tensor algebra, tensor product, exterior algebra, symmetric algebra, module of section, graded algebra, vector subbundle are studied. A Theorem 1.32. is established by using sections and fibrewise orthogonal sections of an application of Gran-Schmidt. DOI: http://dx.doi.org/10.3329/dujs.v62i1.21957 Dhaka Univ. J. Sci. 62(1): 31-35, 2014 (January)


2020 ◽  
Vol DMTCS Proceedings, 28th... ◽  
Author(s):  
Philippe Biane ◽  
Matthieu Josuat-Vergès

International audience It is known that the number of minimal factorizations of the long cycle in the symmetric group into a product of k cycles of given lengths has a very simple formula: it is nk−1 where n is the rank of the underlying symmetric group and k is the number of factors. In particular, this is nn−2 for transposition factorizations. The goal of this work is to prove a multivariate generalization of this result. As a byproduct, we get a multivariate analog of Postnikov's hook length formula for trees, and a refined enumeration of final chains of noncrossing partitions.


2015 ◽  
Vol Vol. 17 no. 1 (Combinatorics) ◽  
Author(s):  
Bridget Eileen Tenner

Combinatorics International audience In this paper we study those generic intervals in the Bruhat order of the symmetric group that are isomorphic to the principal order ideal of a permutation w, and consider when the minimum and maximum elements of those intervals are related by a certain property of their reduced words. We show that the property does not hold when w is a decomposable permutation, and that the property always holds when w is the longest permutation.


2007 ◽  
Vol DMTCS Proceedings vol. AH,... (Proceedings) ◽  
Author(s):  
Guillaume Chapuy

International audience Let $\sigma$ be a random permutation chosen uniformly over the symmetric group $\mathfrak{S}_n$. We study a new "process-valued" statistic of $\sigma$, which appears in the domain of computational biology to construct tests of similarity between ordered lists of genes. More precisely, we consider the following "partial sums": $Y^{(n)}_{p,q} = \mathrm{card} \{1 \leq i \leq p : \sigma_i \leq q \}$ for $0 \leq p,q \leq n$. We show that a suitable normalization of $Y^{(n)}$ converges weakly to a bivariate tied down brownian bridge on $[0,1]^2$, i.e. a continuous centered gaussian process $X^{\infty}_{s,t}$ of covariance: $\mathbb{E}[X^{\infty}_{s,t}X^{\infty}_{s',t'}] = (min(s,s')-ss')(min(t,t')-tt')$.


2008 ◽  
Vol DMTCS Proceedings vol. AJ,... (Proceedings) ◽  
Author(s):  
Mark Dukes ◽  
Vít Jelínek ◽  
Toufik Mansour ◽  
Astrid Reifegerste

International audience We complete the Wilf classification of signed patterns of length 5 for both signed permutations and signed involutions. New general equivalences of patterns are given which prove Jaggard's conjectures concerning involutions in the symmetric group avoiding certain patterns of length 5 and 6. In this way, we also complete the Wilf classification of $S_5$, $S_6$, and $S_7$ for both permutations and involutions. Nous complétons la classification de Wilf des motifs signés de longueur 5 à la fois pour les permutations signées et les involutions signées. Nous donnons de nouvelles équivalences générales de motifs qui prouvent les conjectures de Jaggard concernant les involutions dans le groupe symétrique évitant certains motifs de longueur 5 et 6. De cette manière nous complétons également la classification de Wilf de $S_5$, $S_6$ et $S_7$ à la fois pour les permutations et les involutions.


2013 ◽  
Vol DMTCS Proceedings vol. AS,... (Proceedings) ◽  
Author(s):  
Matthew Housley ◽  
Heather M. Russell ◽  
Julianna Tymoczko

International audience The $A_2$-spider category encodes the representation theory of the $sl_3$ quantum group. Kuperberg (1996) introduced a combinatorial version of this category, wherein morphisms are represented by planar graphs called $\textit{webs}$ and the subset of $\textit{reduced webs}$ forms bases for morphism spaces. A great deal of recent interest has focused on the combinatorics of invariant webs for tensors powers of $V^+$, the standard representation of the quantum group. In particular, the invariant webs for the 3$n$th tensor power of $V^+$ correspond bijectively to $[n,n,n]$ standard Young tableaux. Kuperberg originally defined this map in terms of a graphical algorithm, and subsequent papers of Khovanov–Kuperberg (1999) and Tymoczko (2012) introduce algorithms for computing the inverse. The main result of this paper is a redefinition of Kuperberg's map through the representation theory of the symmetric group. In the classical limit, the space of invariant webs carries a symmetric group action. We use this structure in conjunction with Vogan's generalized tau-invariant and Kazhdan–Lusztig theory to show that Kuperberg's map is a direct analogue of the Robinson–Schensted correspondence.


2010 ◽  
Vol DMTCS Proceedings vol. AN,... (Proceedings) ◽  
Author(s):  
Sho Matsumoto ◽  
Jonathan Novak

International audience A factorization of a permutation into transpositions is called "primitive'' if its factors are weakly ordered.We discuss the problem of enumerating primitive factorizations of permutations, and its place in the hierarchy of previously studied factorization problems. Several formulas enumerating minimal primitive and possibly non-minimal primitive factorizations are presented, and interesting connections with Jucys-Murphy elements, symmetric group characters, and matrix models are described. Une factorisation en transpositions d'une permutation est dite "primitive'' si ses facteurs sont ordonnés. Nous discutons du problème de l'énumération des factorisations primitives de permutations, et de sa place dans la hiérarchie des problèmes de factorisation précédemment étudiés. Nous présentons plusieurs formules énumérant certaines classes de factorisations primitives,et nous soulignons des connexions intéressantes avec les éléments Jucys-Murphy, les caractères des groupes symétriques, et les modèles de matrices.


2014 ◽  
Vol DMTCS Proceedings vol. AT,... (Proceedings) ◽  
Author(s):  
Stuart Margolis ◽  
Franco Saliola ◽  
Benjamin Steinberg

International audience We present a beautiful interplay between combinatorial topology and homological algebra for a class of monoids that arise naturally in algebraic combinatorics. We explore several applications of this interplay. For instance, we provide a new interpretation of the Leray number of a clique complex in terms of non-commutative algebra.


2020 ◽  
Vol DMTCS Proceedings, 28th... ◽  
Author(s):  
Michael Chmutov ◽  
Pavlo Pylyavskyy ◽  
Elena Yudovina

International audience In his study of Kazhdan-Lusztig cells in affine type A, Shi has introduced an affine analog of Robinson- Schensted correspondence. We generalize the Matrix-Ball Construction of Viennot and Fulton to give a more combi- natorial realization of Shi's algorithm. As a biproduct, we also give a way to realize the affine correspondence via the usual Robinson-Schensted bumping algorithm. Next, inspired by Honeywill, we extend the algorithm to a bijection between extended affine symmetric group and triples (P, Q, ρ) where P and Q are tabloids and ρ is a dominant weight. The weights ρ get a natural interpretation in terms of the Affine Matrix-Ball Construction. Finally, we prove that fibers of the inverse map possess a Weyl group symmetry, explaining the dominance condition on weights.


Sign in / Sign up

Export Citation Format

Share Document