Related papers: Complete branching rules for Specht modules

New exact modular branching rules are obtained for modules over the symmetric groups that are close to completely splittable modules. These results are based on some upper bounds for the Ext^1-spaces between simple modules.

Using purely combinatorial methods we calculate the first degree cohomology of Specht modules indexed by two part partitions over fields of characteristic $p\ge 3$. These combinatorial methods also allow us to obtain an explicit description…

We show that the modular branching rule (in the sense of Harish-Chandra) on unipotent modules for finite unitary groups is piecewise described by particular connected components of the crystal graph of well-chosen Fock spaces, under…

We review a class of modules for the wreath product S(m) wr S(n) of two symmetric groups which are analogous to the Specht modules of the symmetric group, and prove a pair of branching rules for this family of modules. These branching rules…

For the affine Hecke algebra of type A at roots of unity, we make explicit the correspondence between geometrically constructed simple modules and combinatorially constructed simple modules and prove the modular branching rule. The latter…

For the affine Hecke algebra of type A at roots of unity, we make explicit the correspondence between geometrically constructed simple modules and combinatorially constructed simple modules and prove the modular branching rule. The latter…

The branching algorithm is a fundamental technique for designing fast exponential-time algorithms to solve combinatorial optimization problems exactly. It divides the entire solution space into independent search branches using…

Specht modules for an Ariki-Koike algebra have been investigated recently in the context of cellular algebras. Thus, these modules are defined as quotient modules of certain ``permutation'' modules, that is, defined as ``cell modules'' via…

In 2009, G. Gr\"atzer and E. Knapp proved that every planar semimodular lattice has a rectangular extension. We prove that, under reasonable additional conditions, this extension is unique. This theorem naturally leads to a hierarchy of…

We introduce a generalization of degenerate affine Hecke algebra, called wreath Hecke algebra, associated to an arbitrary finite group G. The simple modules of the wreath Hecke algebra and of its associated cyclotomic algebras are…

The submodule structure of general Specht modules in prime characteristic is a difficult open problem. Kleshchev and Sheth [Journal of Algebra, 221(2), pp.705-722] gave a combinatorial description of the submodule structure of Specht…

This paper studies the vertices, in the sense defined by J. A. Green, of Specht modules for symmetric groups. The main theorem gives, for each indecomposable non-projective Specht module, a large subgroup contained in one of its vertices. A…

We give a modular branching rule for certain wreath products as a generalization of Kleshchev's modular branching rule for the symmetric groups. Our result contains a modular branching rule for the complex reflection groups $G(m,1,n)$…

The Murnaghan--Nakayama rule is a combinatorial rule for the character values of symmetric groups. We give a new combinatorial proof by explicitly finding the trace of the representing matrices in the standard basis of Specht modules. This…

A root system is splint if it is a decomposition into a union of two root systems. Examples of such root systems arise naturally in studying embeddings of reductive Lie subalgebras into simple Lie algebras. Given a splint root system, one…

We present a link-by-link rule-based method for constructing all members of the ensemble of spanning trees for any recursively generated, finitely articulated graph, such as the DGM net. The recursions allow for many large-scale properties…

For a Specht module S^\lambda for the symmetric group \Sigma_d, the cohomology H^i(\Sigma_d, S^\lambda) is known only in degree i=0. We give a combinatorial criterion equivalent to the nonvanishing of the degree i=1 cohomology, valid in odd…

We obtain sharp lower and upper bounds for the number of maximal (under inclusion) independent sets in trees with fixed number of vertices and diameter. All extremal trees are described up to isomorphism.

We provide an explicit construction of skew cell modules for diagram algebras.

Regarding the Specht modules associated to the two-row partition $(n,n)$, we provide a combinatorial path model to study the transitioning matrix from the tableau basis to the $A_1$-web basis (i.e. cup diagrams), and prove that the entries…