中文
相关论文

相关论文: Abstract Young Pairs for Signed Permutation Groups

200 篇论文

Inspired by Vershik and Okounkov's inductive and Lie-theoretic approach to the representation theory of the symmetric group, we extend their point of view to reducible $S_n$-modules. Using induced representations along Young's lattice, we…

表示论 · 数学 2023-05-16 Eugene Stern

Let $G_M$ be one of the complex Lie groups $O_M$ and $Sp_M$. The irreducible finite-dimensional representations of the group $G_M$ are labeled by partitions $\mu$ satisfying certain extra conditions. Let $U$ be the representation of $G_M$…

表示论 · 数学 2007-05-23 Maxim Nazarov

We study the representations of the infinite symmetric group induced from the identity representations of Young subgroups. It turns out that such induced representations can be either of type~I or of type~II. Each Young subgroup corresponds…

表示论 · 数学 2007-05-23 N. V. Tsilevich , A. M. Vershik

Let $GL_M$ be general linear Lie group over the complex field. The irreducible rational representations of the group $GL_M$ are labeled by pairs of partitions $\mu$ and $\tilde\mu$ such that the total number of non-zero parts of $\mu$ and…

表示论 · 数学 2007-05-23 Maxim Nazarov

For any polynomial representation of the special linear group, the nodes of the corresponding crystal may be indexed by semi-standard Young tableaux. Under certain conditions, the standard Young tableaux occur, and do so with weight 0.…

组合数学 · 数学 2008-04-11 Sami Assaf

Young diagrams are ubiquitous in combinatorics and representation theory. Here we explain these diagrams, focusing on how they are used to classify representations of the symmetric groups $S_n$ and various "classical groups": famous groups…

表示论 · 数学 2023-02-17 John C. Baez

Let $S(d,N)$ denote the number of permutations in the symmetric group on $[N]$ which have no decreasing subsequence of length $d+1.$ We prove that $S(d,dn)$ is asymptotically equal to the number of standard Young tableaux of rectangular…

组合数学 · 数学 2010-02-12 Jonathan Novak

We calculate all inequivalent irreducible representations of $\S_4$ by specifying the matrices for adjacent transpositions and indicating how to obtain general permutations in $\S_4$ from these transpositions. We employ standard Young…

表示论 · 数学 2011-12-06 Quinton Westrich

We derive combinatorial identities, involving the Bernoulli and Euler numbers, for the numbers of standard Young tableaux of certain skew shapes. This generalizes the classical formulas of D. Andre on the number of up-down permutations. The…

组合数学 · 数学 2007-09-05 Yuliy Baryshnikov , Dan Romik

We derive a formula for the entries in the change-of-basis matrix between Young's seminormal and natural representations of the symmetric group. These entries are determined as sums over weighted paths in the weak Bruhat graph on standard…

表示论 · 数学 2020-12-08 Sam Armon , Tom Halverson

The group algebra of the permutation group is spanned by a set of elements called projectors. The coordinates of permutations expanded in projectors are matrix elements of irreducible representations. The projectors of the permutation group…

综合数学 · 数学 2007-05-23 G. Bergdolt

We provide an algorithmic framework for the computation of explicit representing matrices for all irreducible representations of a generalized symmetric group $\Grin_n$, i.e., a wreath product of cyclic group of order $r$ with the symmetric…

表示论 · 数学 2025-07-30 Koushik Paul , Götz Pfeiffer

The Yangian of the Lie algebra $gl_N$ has a distinguished family of irreducible finite-dimensional representations, called elementary representations. They are parametrized by pairs, consisting of a skew Young diagram and a complex number.…

表示论 · 数学 2007-05-23 Maxim Nazarov

In this paper we establish an order statistics model of Young tableaux. Multiple integration over nested simplexes is applied to the enumeration of Young tableaux. A brief proof of Frobenius-Young's and Aitken's formulas is given. Partially…

组合数学 · 数学 2013-02-05 Ping Sun

With an arbitrary finite graph having a special form of 2-intervals (a diamond-shaped graph) we associate a subgroup of a symmetric group and a representation of this subgroup; state a series of problems on such groups and their…

表示论 · 数学 2019-11-20 A. Vershik , N Tslevich

The representation theory of the symmetric groups S_n is intimately related to combinatorics: combinatorial objects such as Young tableaux and combinatorial algorithms such as Murnaghan-Nakayama rule. In the limit as n tends to infinity,…

组合数学 · 数学 2014-04-22 Piotr Śniady

Young tableaux are classical combinatorial objects playing recurring and varied roles in representation theory, algebraic geometry and commutative algebra. This article is a short exposition on Young tableaux, written for the "WHAT IS...?"…

组合数学 · 数学 2007-05-23 Alexander Yong

By utilizing the combinatorial properties of various tableau models, we establish an explicit correspondence between the polyhedral realizations of the crystal bases $\mathcal B(\lambda)$ (resp. $\mathcal B(\infty)$) of type $A_n$ and the…

表示论 · 数学 2026-05-12 Shaolong Han

We give a new (inductive) proof of the classical Frobenius--Young correspondence between irreducible complex representations of the symmetric group and Young diagrams, using the new approach, suggested in \cite{OV, VO}, to determining this…

表示论 · 数学 2007-05-23 A. Vershik

We present a representation for permutation groups as the automorphism group of an ordered set $U$ such that the automorphism group's action on a subset $T\subseteq U$ is the permutation group itself. For many imprimitive permutation…

组合数学 · 数学 2023-09-19 Bernd Schröder
‹ 上一页 1 2 3 10 下一页 ›