Skip to main content Accessibility help
×
Hostname: page-component-78c5997874-xbtfd Total loading time: 0 Render date: 2024-11-06T00:23:27.706Z Has data issue: false hasContentIssue false

7 - Bounds for dim Qd(n)

Published online by Cambridge University Press:  06 November 2017

Grant Walker
Affiliation:
University of Manchester
Reginald M. W. Wood
Affiliation:
University of Manchester
Get access

Summary

Introduction

The dimension of the vector space Pd(n) increases with d for a fixed n. By contrast, we show in Section 7.1 that there is an upper bound for dim Qd(n) which is independent of d. The proof involves the idea of an α +-bounded monomial. These span Qd(n), and in a given degree d the number of α +-bounded monomials is bounded by a function of n. However, for n > 2, the bound is too large to be of practical use.

In Section 7.2, the 1-back splicing technique introduced in Section 6.4 is extended to multiple 1-back splicing, and is used to show that Qω(n) = 0 if ω>l ωmax(n,d), the maximum element of Decd(n) (compare Theorem 6.3.12). In the case where Decd(n) has only one element ω, we use the same technique to show that any block in Pd(n) with ω-sequence right lower than ωmin(d) is hit. In Chapter 14, this will be proved for every degree d.

In Section 7.3, we introduce semi-standard monomials and blocks. Under certain conditions on ω, Qω(n) is spanned by semi-standard blocks. In contrast to α+-bounded monomials, when n ≥ 2 the number of semi-standard monomials in a given degree is not bounded. Multiple 1-back splicing involves the interchange of entries between adjacent columns of a block, together with certain ‘error’ terms when applied to the action of the Steenrod algebra. By ignoring the error terms, we obtain the notion of combinatorial splicing. Using iterated combinatorial splicing, a block with decreasing ω-sequence is equivalent to a sum of semi-standard blocks.

In Section 7.4 we show how various notions in the previous section translate into the combinatorial theory of Young tableaux. The hook-length formula (7.1) gives the number of semi-standard blocks. In the case d = 2nn−1 we show that the semi-standard blocks form a basis of Qd(n) and that dim Qd(n)= 2n(n−1)/2. In this case we show in Chapter 22 that Qd(n) is the Steinberg representation St(n) of GL(n). For an arbitrary decreasing sequence ω of 2-degree d, we show in Proposition 7.4.5 that an ordering on Decd(n) can be chosen, dependent on ω, for which Qω(n), defined using this order, is spanned by semi-standard monomials.

Type
Chapter
Information
Publisher: Cambridge University Press
Print publication year: 2017

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Save book to Kindle

To save this book to your Kindle, first ensure [email protected] is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats
×