DOCSLIB.ORG

Grassmannian Codes with New Distance Measures for Network Coding

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Grassmannian Codes with New Distance Measures for Network Coding 1 Grassmannian Codes with New Distance Measures for Network Coding TUVI ETZION, Fellow, IEEE HUI ZHANG Abstract—Grassmannian codes are known to be useful in network has N receivers, each one demands all the h error-correction for random network coding. Recently, they messages of the source to be transmitted in one round of were used to prove that vector network codes outperform a network use. An up-to-date survey on network coding scalar linear network codes, on multicast networks, with respect to the alphabet size. The multicast networks which for multicast networks can be found for example in [21]. were used for this purpose are generalized combination Kotter¨ and Medard´ [29] provided an algebraic formulation networks. In both the scalar and the vector network coding for the network coding problem: for a given network, find solutions, the subspace distance is used as the distance coding coefficients for each edge, whose starting vertex measure for the codes which solve the network coding has in-degree greater than one. These coding coefficients problem in the generalized combination networks. In this work we show that the subspace distance can be replaced are multiplied by the symbols received at the starting node with two other possible distance measures which generalize of the edge and these products are added together. These the subspace distance. These two distance measures are coefficients should be chosen in a way that each receiver shown to be equivalent under an orthogonal transformation. can recover the h messages from its received symbols on It is proved that the Grassmannian codes with the new its incoming edges. This sequence of coding coefficients distance measures generalize the Grassmannian codes with the subspace distance and the subspace designs with the at each such edge is called the local coding vector and strength of the design. Furthermore, optimal Grassmannian the edge is called a coding point. Such an assignment codes with the new distance measures have minimal re- of coding coefficients for all such edges in the network quirements for network coding solutions of some generalized is called a solution for the network and the network is combination networks. The coding problems related to these called solvable. It is easy to verify that the information two distance measures, especially with respect to network coding, are discussed. Finally, by using these new concepts on each edge is a linear combination of the h messages. it is proved that codes in the Hamming scheme form a The vector of length h of these coefficients of this linear subfamily of the Grassmannian codes. combination is called the global coding vector. From the global coding vectors and the symbols on its incoming edges, the receiver should recover the h messages, by Index Terms—Distance measures, generalized combination networks, Grassmannian codes, network coding. solving a set of h linearly independent equations. The coding coefficients defined in this way are scalars and the solution is a scalar linear solution. Ebrahimi and Fragouli [7] have extended this algebraic approach to I. INTRODUCTION vector network coding. In the setting of vector network ETWORK coding has been attracting increasing coding, the messages of the source are vectors of length ` N attention in the last fifteen years. The seminal work over Fq and the coding coefficients are ` × ` matrices of Ahlswede, Cai, Li, and Yeung [1] and Li, Yeung, over Fq. A set of matrices, which have the role of the and Cai [24] introduced the basic concepts of network coefficients of these vector messages, such that all the arXiv:1801.02329v7 [cs.IT] 8 Feb 2019 coding and how network coding outperforms the well- receivers can recover their requested information, is called known routing. The class of networks which are mainly a vector solution. Also in the setting of vector network studied is the class of multicast networks and these are coding we distinguish between the local coding vectors also the target of this work. A multicast network is a and the global coding vectors. There is a third type of directed acyclic graph with one source. The source has network coding solution, a scalar nonlinear network code. Again, in each coding point there is a function of the h messages, which are scalars over a finite field Fq. The symbols received at the starting node of the coding point. Department of Computer Science, Technion, Haifa 3200003, Israel, This function can be linear or nonlinear. There is clearly a e-mail: [email protected]. hierarchy, where a scalar linear solution can be translated Nanyang Technological University, Singapore, e-mail: [email protected]. Part of the research was performed to a vector solution, and a vector solution can be translated while the author was with the Department of Computer Science, to a scalar nonlinear solution. Technion, Haifa 3200003, supported in part by a fellowship of the Israel Council of Higher Education. The alphabet size of the solution is an important Parts of this work have been presented at the IEEE International Symposium on Information Theory 2018, Vail, Colorado, U.S.A., June parameter that directly influences the complexity of the 2018. calculations at the network nodes and as a consequence the 2 performance of the network. A comparison between the measures on Grassmannian codes which generalize the required alphabet size for a scalar linear solution, a vector Grassmannian distance. We discuss the maximum sizes solution, and a scalar nonlinear solution, of the same of Grassmannian codes with the new distance measures multicast network is an important problem. It was proved and analyse these bounds from a few different point of in [18], [19] that there are multicast networks on which view. We explore the connection between these codes a vector network coding solution with vectors of length and related generalized combination networks. Our ex- ` over Fq outperforms any scalar linear network coding position will derive some interesting properties of these solution, i.e. the scalar solution requires an alphabet of codes with respect to the traditional Grassmannian codes ` size qs, where qs > q . The proof used a family of and some subspace designs. We will show, using a few networks called the generalized combination networks, different approaches, that codes in the Hamming space where the combination networks were defined and used form a subfamily of the Grassmannian codes. Some other in [34]. interesting connections to subspace designs and codes in Kotter¨ and Kschischang [30] introduced a framework the Hamming scheme will be also explored. for error-correction in random network coding. They have The Grassmannian codes (constant dimension codes) shown that for this purpose the codewords (messages) are are the q-analog of the constant weight codes, where taken as subspaces over a finite field Fq. For this purpose q-analogs replace concepts of subsets by concepts of sub- they have defined the subspace distance. This approach spaces when problems on sets are transferred to problems was mainly applied on subspaces of the same dimension. on subspaces over the finite field Fq. For example, the size For given positive integers n and k, 0 ≤ k ≤ n, the n of a set is replaced by the dimension of a subspace, the Grassmannian Gq(n; k) is the set of all subspaces of Fq binomial coefficients are replaced by the Gaussian coef- whose dimension is k. It is well known that ficients, etc. The Grassmann space is the q-analog of the n n−1 n−k+1 n def (q − 1)(q − 1) ··· (q − 1) Johnson space and the subspace distance is the q-analog = jGq(n; k)j = k k−1 k q (q − 1)(q − 1) ··· (q − 1) of the Hamming distance. The new distance measures are q-analogs of related distances in the Johnson space. n where k q is the q-binomial coefficient (known also as The Johnson scheme J(n; w) consists of all w-subsets the q−ary Gaussian coefficient [45, pp. 325-332]. A code of an n-set (equivalent to binary words on length n and 2 G (n; k) is called a Grassmannian code or a constant C q weight w). The Johnson distance dJ (x; y) between two dimension code. For two subspaces X; Y 2 Gq(n; k) w-subsets x and y is half of the related Hamming distance, the subspace distance is reduced to the Grassmannian i.e., dJ (x; y) , jx n yj. distance defined by The rest of this paper is organized as follows. In def Section II we present the combination network and its gen- dG(X; Y ) = k − dim(X \ Y ) : eralization which was defined in [18], [19]. We discuss the Most of the research on Grassmannian codes motivated family of codes which provide network coding solutions by [30] was in two directions – finding the largest codes for these networks. We will make a brief comparison be- with prescribed minimum Grassmannian distance and tween the related scalar coding solutions and vector cod- looking for designs based on subspaces. To this end, the ing solutions. In Section III we further consider this family quantity Aq(n; 2d; k) was defined as the maximum size of of codes, define two dual distance measures on these a code in Gq(n; k) with minimum Grassmannian distance codes, and show how these codes and the new distance d. There has been extensive work on Grassmannian codes measures defined on them generalize the conventional in the last ten years, e.g. [13], [14], [15], [16], [36] and Grassmannian codes with the Grassmannian distance. We references therein. A related concept is a subspace design show the connection of these codes to subspace designs.
Load more

Recommended publications
  • Classification on the Grassmannians
    GEOMETRIC FRAMEWORK SOME EMPIRICAL RESULTS COMPRESSION ON G(k, n) CONCLUSIONS Classification on the Grassmannians: Theory and Applications Jen-Mei Chang Department of Mathematics and Statistics California State University, Long Beach [email protected] AMS Fall Western Section Meeting Special Session on Metric and Riemannian Methods in Shape Analysis October 9, 2010 at UCLA GEOMETRIC FRAMEWORK SOME EMPIRICAL RESULTS COMPRESSION ON G(k, n) CONCLUSIONS Outline 1 Geometric Framework Evolution of Classification Paradigms Grassmann Framework Grassmann Separability 2 Some Empirical Results Illumination Illumination + Low Resolutions 3 Compression on G(k, n) Motivations, Definitions, and Algorithms Karcher Compression for Face Recognition GEOMETRIC FRAMEWORK SOME EMPIRICAL RESULTS COMPRESSION ON G(k, n) CONCLUSIONS Architectures Historically Currently single-to-single subspace-to-subspace )2( )3( )1( d ( P,x ) d ( P,x ) d(P,x ) ... P G , , … , x )1( x )2( x( N) single-to-many many-to-many Image Set 1 … … G … … p * P , Grassmann Manifold Image Set 2 * X )1( X )2( … X ( N) q Project Eigenfaces GEOMETRIC FRAMEWORK SOME EMPIRICAL RESULTS COMPRESSION ON G(k, n) CONCLUSIONS Some Approaches • Single-to-Single 1 Euclidean distance of feature points. 2 Correlation. • Single-to-Many 1 Subspace method [Oja, 1983]. 2 Eigenfaces (a.k.a. Principal Component Analysis, KL-transform) [Sirovich & Kirby, 1987], [Turk & Pentland, 1991]. 3 Linear/Fisher Discriminate Analysis, Fisherfaces [Belhumeur et al., 1997]. 4 Kernel PCA [Yang et al., 2000]. GEOMETRIC FRAMEWORK SOME EMPIRICAL RESULTS COMPRESSION ON G(k, n) CONCLUSIONS Some Approaches • Many-to-Many 1 Tangent Space and Tangent Distance - Tangent Distance [Simard et al., 2001], Joint Manifold Distance [Fitzgibbon & Zisserman, 2003], Subspace Distance [Chang, 2004].
    [Show full text]
  • Arxiv:1711.05949V2 [Math.RT] 27 May 2018 Mials, One Obtains a Sum Whose Summands Are Rational Functions in Ti
    RESIDUES FORMULAS FOR THE PUSH-FORWARD IN K-THEORY, THE CASE OF G2=P . ANDRZEJ WEBER AND MAGDALENA ZIELENKIEWICZ Abstract. We study residue formulas for push-forward in the equivariant K-theory of homogeneous spaces. For the classical Grassmannian the residue formula can be obtained from the cohomological formula by a substitution. We also give another proof using sym- plectic reduction and the method involving the localization theorem of Jeffrey–Kirwan. We review formulas for other classical groups, and we derive them from the formulas for the classical Grassmannian. Next we consider the homogeneous spaces for the exceptional group G2. One of them, G2=P2 corresponding to the shorter root, embeds in the Grass- mannian Gr(2; 7). We find its fundamental class in the equivariant K-theory KT(Gr(2; 7)). This allows to derive a residue formula for the push-forward. It has significantly different character comparing to the classical groups case. The factor involving the fundamen- tal class of G2=P2 depends on the equivariant variables. To perform computations more efficiently we apply the basis of K-theory consisting of Grothendieck polynomials. The residue formula for push-forward remains valid for the homogeneous space G2=B as well. 1. Introduction ∗ r Suppose an algebraic torus T = (C ) acts on a complex variety X which is smooth and complete. Let E be an equivariant complex vector bundle over X. Then E defines an element of the equivariant K-theory of X. In our setting there is no difference whether one considers the algebraic K-theory or the topological one.
    [Show full text]
  • Filtering Grassmannian Cohomology Via K-Schur Functions
    FILTERING GRASSMANNIAN COHOMOLOGY VIA K-SCHUR FUNCTIONS THE 2020 POLYMATH JR. \Q-B-AND-G" GROUPy Abstract. This paper is concerned with studying the Hilbert Series of the subalgebras of the cohomology rings of the complex Grassmannians and La- grangian Grassmannians. We build upon a previous conjecture by Reiner and Tudose for the complex Grassmannian and present an analogous conjecture for the Lagrangian Grassmannian. Additionally, we summarize several poten- tial approaches involving Gr¨obnerbases, homological algebra, and algebraic topology. Then we give a new interpretation to the conjectural expression for the complex Grassmannian by utilizing k-conjugation. This leads to two conjectural bases that would imply the original conjecture for the Grassman- nian. Finally, we comment on how this new approach foreshadows the possible existence of analogous k-Schur functions in other Lie types. Contents 1. Introduction2 2. Conjectures3 2.1. The Grassmannian3 2.2. The Lagrangian Grassmannian4 3. A Gr¨obnerBasis Approach 12 3.1. Patterns, Patterns and more Patterns 12 3.2. A Lex-greedy Approach 20 4. An Approach Using Natural Maps Between Rings 23 4.1. Maps Between Grassmannians 23 4.2. Maps Between Lagrangian Grassmannians 24 4.3. Diagrammatic Reformulation for the Two Main Conjectures 24 4.4. Approach via Coefficient-Wise Inequalities 27 4.5. Recursive Formula for Rk;` 27 4.6. A \q-Pascal Short Exact Sequence" 28 n;m 4.7. Recursive Formula for RLG 30 4.8. Doubly Filtered Basis 31 5. Schur and k-Schur Functions 35 5.1. Schur and Pieri for the Grassmannian 36 5.2. Schur and Pieri for the Lagrangian Grassmannian 37 Date: August 2020.
    [Show full text]
  • §4 Grassmannians 73
    §4 Grassmannians 4.1 Plücker quadric and Gr(2,4). Let 푉 be 4-dimensional vector space. e set of all 2-di- mensional vector subspaces 푈 ⊂ 푉 is called the grassmannian Gr(2, 4) = Gr(2, 푉). More geomet- rically, the grassmannian Gr(2, 푉) is the set of all lines ℓ ⊂ ℙ = ℙ(푉). Sending 2-dimensional vector subspace 푈 ⊂ 푉 to 1-dimensional subspace 훬푈 ⊂ 훬푉 or, equivalently, sending a line (푎푏) ⊂ ℙ(푉) to 한 ⋅ 푎 ∧ 푏 ⊂ 훬푉 , we get the Plücker embedding 픲 ∶ Gr(2, 4) ↪ ℙ = ℙ(훬 푉). (4-1) Its image consists of all decomposable¹ grassmannian quadratic forms 휔 = 푎∧푏 , 푎, 푏 ∈ 푉. Clearly, any such a form has zero square: 휔 ∧ 휔 = 푎 ∧ 푏 ∧ 푎 ∧ 푏 = 0. Since an arbitrary form 휉 ∈ 훬푉 can be wrien¹ in appropriate basis of 푉 either as 푒 ∧ 푒 or as 푒 ∧ 푒 + 푒 ∧ 푒 and in the laer case 휉 is not decomposable, because of 휉 ∧ 휉 = 2 푒 ∧ 푒 ∧ 푒 ∧ 푒 ≠ 0, we conclude that 휔 ∈ 훬 푉 is decomposable if an only if 휔 ∧ 휔 = 0. us, the image of (4-1) is the Plücker quadric 푃 ≝ { 휔 ∈ 훬푉 | 휔 ∧ 휔 = 0 } (4-2) If we choose a basis 푒, 푒, 푒, 푒 ∈ 푉, the monomial basis 푒 = 푒 ∧ 푒 in 훬 푉, and write 푥 for the homogeneous coordinates along 푒, then straightforward computation 푥 ⋅ 푒 ∧ 푒 ∧ 푥 ⋅ 푒 ∧ 푒 = 2 푥 푥 − 푥 푥 + 푥 푥 ⋅ 푒 ∧ 푒 ∧ 푒 ∧ 푒 < < implies that 푃 is given by the non-degenerated quadratic equation 푥푥 = 푥푥 + 푥푥 .
    [Show full text]
  • 8. Grassmannians
    66 Andreas Gathmann 8. Grassmannians After having introduced (projective) varieties — the main objects of study in algebraic geometry — let us now take a break in our discussion of the general theory to construct an interesting and useful class of examples of projective varieties. The idea behind this construction is simple: since the definition of projective spaces as the sets of 1-dimensional linear subspaces of Kn turned out to be a very useful concept, let us now generalize this and consider instead the sets of k-dimensional linear subspaces of Kn for an arbitrary k = 0;:::;n. Definition 8.1 (Grassmannians). Let n 2 N>0, and let k 2 N with 0 ≤ k ≤ n. We denote by G(k;n) the set of all k-dimensional linear subspaces of Kn. It is called the Grassmannian of k-planes in Kn. Remark 8.2. By Example 6.12 (b) and Exercise 6.32 (a), the correspondence of Remark 6.17 shows that k-dimensional linear subspaces of Kn are in natural one-to-one correspondence with (k − 1)- n− dimensional linear subspaces of P 1. We can therefore consider G(k;n) alternatively as the set of such projective linear subspaces. As the dimensions k and n are reduced by 1 in this way, our Grassmannian G(k;n) of Definition 8.1 is sometimes written in the literature as G(k − 1;n − 1) instead. Of course, as in the case of projective spaces our goal must again be to make the Grassmannian G(k;n) into a variety — in fact, we will see that it is even a projective variety in a natural way.
    [Show full text]
  • Grassmannians Via Projection Operators and Some of Their Special Submanifolds ∗
    GRASSMANNIANS VIA PROJECTION OPERATORS AND SOME OF THEIR SPECIAL SUBMANIFOLDS ∗ IVKO DIMITRIC´ Department of Mathematics, Penn State University Fayette, Uniontown, PA 15401-0519, USA E-mail: [email protected] We study submanifolds of a general Grassmann manifold which are of 1-type in a suitably defined Euclidean space of F−Hermitian matrices (such a submanifold is minimal in some hypersphere of that space and, apart from a translation, the im- mersion is built using eigenfunctions from a single eigenspace of the Laplacian). We show that a minimal 1-type hypersurface of a Grassmannian is mass-symmetric and has the type-eigenvalue which is a specific number in each dimension. We derive some conditions on the mean curvature of a 1-type hypersurface of a Grassmannian and show that such a hypersurface with a nonzero constant mean curvature has at most three constant principal curvatures. At the end, we give some estimates of the first nonzero eigenvalue of the Laplacian on a compact submanifold of a Grassmannian. 1. Introduction The Grassmann manifold of k dimensional subspaces of the vector space − Fm over a field F R, C, H can be conveniently defined as the base man- ∈{ } ifold of the principal fibre bundle of the corresponding Stiefel manifold of F unitary frames, where a frame is projected onto the F plane spanned − − by it. As observed already in 1927 by Cartan, all Grassmannians are sym- metric spaces and they have been studied in such context ever since, using the root systems and the Lie algebra techniques. However, the submani- fold geometry in Grassmannians of higher rank is much less developed than the corresponding geometry in rank-1 symmetric spaces, the notable excep- tions being the classification of the maximal totally geodesic submanifolds (the well known results of J.A.
    [Show full text]
  • WEIGHT FILTRATIONS in ALGEBRAIC K-THEORY Daniel R
    November 13, 1992 WEIGHT FILTRATIONS IN ALGEBRAIC K-THEORY Daniel R. Grayson University of Illinois at Urbana-Champaign Abstract. We survey briefly some of the K-theoretic background related to the theory of mixed motives and motivic cohomology. 1. Introduction. The recent search for a motivic cohomology theory for varieties, described elsewhere in this volume, has been largely guided by certain aspects of the higher algebraic K-theory developed by Quillen in 1972. It is the purpose of this article to explain the sense in which the previous statement is true, and to explain how it is thought that the motivic cohomology groups with rational coefficients arise from K-theory through the intervention of the Adams operations. We give a basic description of algebraic K-theory and explain how Quillen’s idea [42] that the Atiyah-Hirzebruch spectral sequence of topology may have an algebraic analogue guides the search for motivic cohomology. There are other useful survey articles about algebraic K-theory: [50], [46], [23], [56], and [40]. I thank W. Dwyer, E. Friedlander, S. Lichtenbaum, R. McCarthy, S. Mitchell, C. Soul´e and R. Thomason for frequent and useful consultations. 2. Constructing topological spaces. In this section we explain the considerations from combinatorial topology which give rise to the higher algebraic K-groups. The first principle is simple enough to state, but hard to implement: when given an interesting group (such as the Grothendieck group of a ring) arising from some algebraic situation, try to realize it as a low-dimensional homotopy group (especially π0 or π1) of a space X constructed in some combinatorial way from the same algebraic inputs, and study the homotopy type of the resulting space.
    [Show full text]
  • Equivariant Homology and K-Theory of Affine Grassmannians and Toda Lattices R Bezrukavnikov
    University of Massachusetts Amherst ScholarWorks@UMass Amherst Mathematics and Statistics Department Faculty Mathematics and Statistics Publication Series 2005 Equivariant homology and K-theory of affine Grassmannians and Toda lattices R Bezrukavnikov M Finkelberg I Mirkovic University of Massachusetts - Amherst, [email protected] Follow this and additional works at: https://scholarworks.umass.edu/math_faculty_pubs Part of the Physical Sciences and Mathematics Commons Recommended Citation Bezrukavnikov, R; Finkelberg, M; and Mirkovic, I, "Equivariant homology and K-theory of affine asGr smannians and Toda lattices" (2005). COMPOSITIO MATHEMATICA. 727. Retrieved from https://scholarworks.umass.edu/math_faculty_pubs/727 This Article is brought to you for free and open access by the Mathematics and Statistics at ScholarWorks@UMass Amherst. It has been accepted for inclusion in Mathematics and Statistics Department Faculty Publication Series by an authorized administrator of ScholarWorks@UMass Amherst. For more information, please contact [email protected]. EQUIVARIANT (K-)HOMOLOGY OF AFFINE GRASSMANNIAN AND TODA LATTICE ROMAN BEZRUKAVNIKOV, MICHAEL FINKELBERG, AND IVAN MIRKOVIC´ 1. Introduction 1.1. Let G be an almost simple complex algebraic group, and let GrG be its affine Grassmannian. Recall that if we set O = C[[t]], F = C((t)), then GrG = G(F)/G(O). It is well-known that the subgroup ΩK of polynomial loops into a maximal compact subgroup K G projects isomorphically to GrG; thus GrG acquires the structure of a topological⊂ group. An algebro-geometric counterpart of this structure is provided by the convolution diagram G(F) O Gr Gr . ×G( ) G → G It allows one to define the convolution of two G(O) equivariant geometric objects (such as sheaves, or constrictible functions) on GrG.
    [Show full text]
  • Cohomology of the Complex Grassmannian
    COHOMOLOGY OF THE COMPLEX GRASSMANNIAN JONAH BLASIAK Abstract. The Grassmannian is a generalization of projective spaces–instead of looking at the set of lines of some vector space, we look at the set of all n-planes. It can be given a manifold structure, and we study the cohomology ring of the Grassmannian manifold in the case that the vector space is complex. The mul- tiplicative structure of the ring is rather complicated and can be computed using the fact that for smooth oriented manifolds, cup product is Poincar´edual to intersection. There is some nice com- binatorial machinery for describing the intersection numbers. This includes the symmetric Schur polynomials, Young tableaux, and the Littlewood-Richardson rule. Sections 1, 2, and 3 introduce no- tation and the necessary topological tools. Section 4 uses linear algebra to prove Pieri’s formula, which describes the cup product of the cohomology ring in a special case. Section 5 describes the combinatorics and algebra that allow us to deduce all the multi- plicative structure of the cohomology ring from Pieri’s formula. 1. Basic properties of the Grassmannian The Grassmannian can be defined for a vector space over any field; the cohomology of the Grassmannian is the best understood for the complex case, and this is our focus. Following [MS], the complex Grass- m+n mannian Gn(C ) is the set of n-dimensional complex linear spaces, or n-planes for brevity, in the complex vector space Cm+n topologized n+m as follows: Let Vn(C ) denote the subspace of the n-fold direct sum Cm+n ⊕ ..
    [Show full text]
  • Equivariant Homology and K -Theory of Affine Grassmannians and Toda
    Compositio Math. 141 (2005) 746–768 DOI: 10.1112/S0010437X04001228 Equivariant homology and K-theory of affine Grassmannians and Toda lattices Roman Bezrukavnikov, Michael Finkelberg and Ivan Mirkovi´c Dedicated to Vladimir Drinfeld on the occasion of his 50th birthday Abstract For an almost simple complex algebraic group G with affine Grassmannian GrG = G(C[[t]]) G(C((t)))/G(C[[t]]), we consider the equivariant homology H (GrG)andK-theory G(C[[t]]) K (GrG). They both have a commutative ring structure with respect to convolution. We identify the spectrum of homology ring with the universal group-algebra centralizer of the Langlands dual group Gˇ, and we relate the spectrum of K-homology ring to the universal group-group centralizer of G and of Gˇ. If we add the loop-rotation equivariance, we obtain a noncommutative deformation of the (K-)homology ring, and thus a Poisson structure on its spectrum. We relate this structure to the standard one on the universal centralizer. The commutative subring of G(C[[t]])-equivariant homology of the point gives rise to a polarization which is related to Kostant’s Toda lattice integrable system. We also compute the equivariant K-ring of the affine Grassmannian Steinberg variety. The equivariant K-homology of GrG is equipped with a canonical basis formed by the classes of simple equivariant perverse coherent sheaves. Their convolution is again perverse and is related to the Feigin–Loktev fusion product of G(C[[t]])-modules. 1. Introduction Let G be an almost simple complex algebraic group, and let GrG be its affine Grassmannian.
    [Show full text]
  • MATH 465/565: Grassmannian Notes
    MATH 465/565: Grassmannian Notes The Grassmannian G(r; n) is the set of r-dimensional subspaces of the k-vector space kn; it has a natural bijection with the set G(r − 1; n − 1) of (r − 1)-dimensional linear subspaces Pr−1 ⊆ Pn. We write G(k; V ) for the set of k-dimensional subspaces of an n-dimensional k-vector space V . We'd like to be able to think of G(r; V ) as a quasiprojective variety; to do so, we consider the Pl¨uckerembedding: r γ ∶ G(r; V ) → P V Span(v1; : : : ; vr) ↦ [v1 ∧ ⋯ ∧ vr] If w a v is another ordered basis for Λ Span v ; : : : ; v , where A a is an invertible i = ∑j ij j1≤i≤r = ( 1 r) = ( ij) matrix, then w1 ∧⋯∧wr = (det A)(v1 ∧⋯∧vr). Thus the Pl¨ucker embedding is a well-defined function r from G(k; V ) to P ⋀ V . We would like to show, in analogy with what we were able to show for the Segre embedding σ∶ P(V ) × P(W ) → P(V ⊗ W ), that • the Pl¨ucker embedding γ is injective, • the image γ(G(r; V )) is closed, and • the Grassmannian G(r; V ) \locally" can be given a structure as an affine variety, and γ restricts to an isomorphism between these \local" pieces of G(r; V ) and Zariski open subsets of the image. r Given x ∈ ⋀ V , we say that x is totally decomposable if x = v1 ∧ ⋯ ∧ vr for some v1; : : : ; vr ∈ V , or equivalently, if [x] is in the image of the Pl¨ucker embedding.
    [Show full text]
  • The Grassmannian
    The Grassmannian Sam Panitch under the mentorship of Professor Chris Woodward and Marco Castronovo supported by the Rutgers Math Department June 11, 2020 DIMACS REU at Rutgers University 1 Definition Let V be an n-dimensional vector space, and fix an integer d < n • The Grassmannian, denoted Grd;V is the set of all d-dimensional vector subspaces of V • This is a manifold and a variety 2 Some Simple Examples For very small d and n, the Grassmannian is not very interesting, but it may still be enlightening to explore these examples in Rn 1. Gr1;2 - All lines in a 2D space ! P 2 2. Gr1;3 - P 3. Gr2;3 - we can identify each plane through the origin with a 2 unique perpendicular line that goes through the origin ! P 3 The First Interesting Grassmannian Let's spend some time exploring Gr2;4, as it turns out this the first Grassmannian over Euclidean space that is not just a projective space. • Consider the space of rank 2 (2 × 4) matrices with A ∼ B if A = CB where det(C) > 0 • Let B be a (2 × 4) matrix. Let Bij denote the minor from the ith and jth column. A simple computation shows B12B34 − B13B24 + B14B23 = 0 5 • Let Ω ⊂ P be such that (x; y; z; t; u; v) 2 Ω () xy − zt + uv = 0: Define a map 5 f : M(2 × 4) ! Ω ⊂ P , f (B) = (B12; B34; B13; B24; B14B23). It can be shown this is a bijection 4 The First Interesting Grassmannian Continued... Note for any element in Ω, and we can consider (1; y; z; t; u; v) and note that the matrix " # 1 0 −v −t 0 1 z u will map to this under f , showing we really only need 4 parameters, i.e, the dimension is k(n − k) = 2(4 − 2) = 4 We hope to observe similar trends in the more general case 5 An Atlas for the Grassmannian We will now show that Grk;V is a smooth manifold of dimension k(n − k).
    [Show full text]