Boolean Product Polynomials and the Resonance Arrangement
|
|
- Meagan Quinn
- 5 years ago
- Views:
Transcription
1 Boolean Product Polynomials and the Resonance Arrangement Sara Billey University of Washington Based on joint work with: Lou Billera and Vasu Tewari FPSAC July 17, 2018
2 Outline Symmetric Polynomials Schur Positivity via GL n representation theory and vector bundles Corollaries and Generalizations (Work in Progress) Motivation
3 Symmetric Polynomials Notation. Fix an alphabet of variables X = {x 1, x 2,..., x n }. The symmetric group S n acts on C[x 1, x 2,..., x n ] by permuting the variables: w.x i = x w(i). A polynomial f C[x 1, x 2,..., x n ] is symmetric if w.f = f for all w S n. Let Λ n denote the ring of symmetric polynomials in C[x 1, x 2,..., x n ].
4 Symmetric Polynomials Examples. Let [n] = {1, 2,..., n}. Elementary: e k = Homogeneous: h k = Power sum: p k = A [n] A =k x i i A multisets A [n] A =k n xi k i=1 x i i A e 2 (x 1, x 2, x 3, x 4 ) = x 1 x 2 + x 1 x 3 + x 1 x 4 + x 2 x 3 + x 2 x 4 + x 3 x 4 p 2 (x 1, x 2, x 3, x 4 ) = x x x x 2 4 h 2 = e 2 + p 2.
5 Symmetric Polynomials Fact. Λ n = C[e 1,..., e n ] = C[h 1,..., h n ] = C[p 1,..., p n ]
6 Symmetric Polynomials Fact. Λ n = C[e 1,..., e n ] = C[h 1,..., h n ] = C[p 1,..., p n ] Question. What other symmetric polynomials are natural?
7 Symmetric Polynomials Fact. Λ n = C[e 1,..., e n ] = C[h 1,..., h n ] = C[p 1,..., p n ] Question. What other symmetric polynomials are natural? Monomials: m λ = x λ 1 1 x λ 2 2 x n λn + other monomials in S n -orbit Stanley s chromatic symmetric functions on a graph G = (V, E): X G (x 1,..., x n ) = c:v [n] v V proper coloring x c(v). Observe. These examples are all sums of products.
8 Schur Polynomials Defn. Given a partition λ = (λ 1,..., λ n ), the Schur polynomial s λ (x 1,..., x n ) = x i T SSYT (λ,n) i T where SSYT (λ, n) are the semistandard fillings of λ with positive integers in [n]. Semistandard implies strictly increasing in columns and leniently increasing in rows. Example. For λ = (2, 1) and n = 2, SSYT (λ, n) has two fillings so s (2,1) (x 1, x 2 ) = x 2 1 x 2 + x 1 x 2 2.
9 Boolean Product Polynomials Question. What about products of sums?
10 Boolean Product Polynomials Question. What about products of sums? Defn. For X = {x 1,..., x n }, define (n, k)-boolean Product Polynomial: For 1 k n, B n,k (X) := A [n] A =k x i i A n-th Total Boolean Product Polynomial: n B n (X) := B n,k (X) = x i k=1 A [n] i A A Example. B 2 = (x 1 )(x 2 )(x 1 + x 2 ) = x1 2x 2 + x 1 x2 2 = s (2,1)(x 1, x 2 )
11 Boolean Product Polynomials Examples. B 3,1 = (x 1 )(x 2 )(x 3 ) = e 3 (x 1, x 2, x 3 ) = s (1,1,1) (x 1, x 2, x 3 ) B 3,2 = (x 1 + x 2 )(x 1 + x 3 )(x 2 + x 3 ) = s (2,1) (x 1, x 2, x 3 ) B 3,3 = (x 1 + x 2 + x 3 ) = e 1 (x 1, x 2, x 3 ) = s (1) (x 1, x 2, x 3 ) B 3 = s (1,1,1) s (2,1) s (1) = s (4,2,1) + s (3,3,1) + s (3,2,2).
12 Subset Alphabets Defn. For 1 k n, define a new alphabet of linear forms X (k) = {x A = i A x i : A [n], A = k}. Then B n,k = A [n] A =k x A = e ( n k) (X (k) ).
13 Subset Alphabets Defn. For 1 k n, define a new alphabet of linear forms X (k) = {x A = i A x i : A [n], A = k}. Then B n,k = A [n] A =k x A = e ( n k) (X (k) ). Furthermore, for 1 p ( n k) define the symmetric polynomials e p (X (k) ) = S k-subsets of[n] S =p x A. A S
14 Schur Positivity Theorem. For all 1 k n and 1 p ( n k), the expansion e p (X (k) ) = λ c λ s λ (x 1,..., x n ) has nonnegative integer coefficients c λ. Corollary. Both B n,k and B n are Schur positive.
15 Proof Setup Notation. Fix a complex vector bundle E of rank n. The total Chern class c(e) is the sum of the individual Chern classes c(e) = 1 + c 1 (E) + + c n (E). Via the Splitting Principle, we have c(e) = n i=1 (1 + x i ) where the x i for 1 i n are the Chern roots of E associated to certain line bundles.
16 Prior Work Thm.(Lascoux, 1978) The total Chern class of 2 E and Sym 2 E is Schur-positive in terms of the Chern roots x 1,..., x n of E. Specifically, there exist integers d λ,µ 0 for µ λ such that c( 2 E) = c(sym 2 E) = 1 i<j n 1 i j n (1 + x i + x j ) = 2 (n 2) µ δ n 1 d γn,µ2 µ s µ (X), (1 + x i + x j ) = 2 (n 2) µ δ n d δn,µ2 µ s µ (X). Here γ n = (n 1,..., 1, 0) and δ n = (n,..., 2, 1).
17 Binomial Determinants Lascoux showed that for µ = (µ 1,..., µ n ) λ = (λ 1,..., λ n ), d λ,µ = det (( )) λi + n i 0. µ j + n j 1 i,j n
18 Binomial Determinants Lascoux showed that for µ = (µ 1,..., µ n ) λ = (λ 1,..., λ n ), d λ,µ = det (( )) λi + n i 0. µ j + n j 1 i,j n Thm.(Gessel-Viennot 1985) d λ,µ counts the number of nonintersecting lattice paths from heights λ + δ n along the y-axis to main diagonal points µ + δ n using east or south steps. This highly influential theorem was inspired by Lascoux s theorem!
19 Vector Bundle Approach to Schur Positivity Notation. Fix a complex vector bundle E of rank n over a smooth projective variety V. The total Chern class n c(e) = 1 + c 1 (E) + + c n (E) = (1 + x i ) i=1 where the x i for 1 i n are the Chern roots of E. Construct another vector bundle S λ (E) over V by applying the Schur functor from GL n -representation theory on each fiber. Thm.(Fulton) The Chern roots of S λ (E) are indexed by semistandard tableaux: {x T = x i for T SSYT (λ, n)}. i T
20 Vector Bundle Approach to Schur Positivity Notation. For any partitions λ and µ, consider the Schur function s µ on the alphabet of Chern roots on S λ (E), denoted s µ (S λ (E)). Example. Take n = 3, λ = (1, 1), then the Chern roots of S λ (E) are the variables in the alphabet For µ = (2, 1), expand X (2) = {x 1 + x 2, x 1 + x 3, x 2 + x 3 }. s µ (S λ (E)) =s (2,1) (x 1 + x 2, x 1 + x 3, x 2 + x 3 ) =2s (3) (x 1, x 2, x 3 ) + 5s (2,1) (x 1, x 2, x 3 ) + 4s (1,1,1) (x 1, x 2, x 3 ).
21 Vector Bundle Approach to Schur Positivity Notation. For any partitions λ and µ, consider the Schur function s µ on the alphabet of Chern roots on S λ (E), denoted s µ (S λ (E)). Example. Take n = 3, λ = (1, 1), then the Chern roots of S λ (E) are the variables in the alphabet For µ = (2, 1), expand X (2) = {x 1 + x 2, x 1 + x 3, x 2 + x 3 }. s µ (S λ (E)) =s (2,1) (x 1 + x 2, x 1 + x 3, x 2 + x 3 ) =2s (3) (x 1, x 2, x 3 ) + 5s (2,1) (x 1, x 2, x 3 ) + 4s (1,1,1) (x 1, x 2, x 3 ). Note. This operation is not plethysm s µ [s λ ].
22 Key Ingredient Thm.(Pragacz 1996) Let λ be a partition, and let E 1,..., E k be vector bundles, Y 1,..., Y k be the alphabets consisting of their Chern roots, µ (1),..., µ (k) be partitions. Then, there exists nonnegative integers c (ν (1),...,ν (k) ) such that s λ (S µ(1) (E 1 ) S µ(k) (E k )) = c (ν (1),...,ν (k) ) s ν 1 (Y 1 ) s νk (Y k ). ν 1,...,ν k Pragacz s proof uses work of Fulton-Lazarsfeld on numerical positivity for ample vector bundles. The Hard Lefschetz theorem is a key component.
23 Corollaries Cor. For any partitions λ, µ, s µ (S λ (E)) is Schur positive. Cor. The expansion of e p (X (k) ) is Schur positive since the Chern roots of S 1k (E) = X (k) and e p = s 1 p. Cor. The analogue of Lascoux s theorem holds for all Schur functors S λ (E)), e.g. c( k E) = A [n], A =k 1 + x i = e p (X (k) ). i A p 0 Question. What are the Schur expansions?
24 Boolean Product Expansions for B n,n 1 Thm. For n 2, n B n,n 1 = 1 + x x n x i ) = i=1(x a λ s λ (X) λ n where a λ is the number of T SYT (λ) with smallest ascent given by an even number. More generally, consider n B n,n 1 (X; q) := (h 1 (X) + qx i ) i=1 n = q j e j (X)h (1 n j )(X). j=0 **New**: Brendon Rhoades has a new graded S n -module with B n,n 1 (X; q) as the graded Frobenius characteristic.
25 Motivation Defn. Consider the real variety V (B n ). Since each factor of B n is linear, this variety is a hyperplane arrangement called the Resonance Arrangement or All-Subsets Arrangement H n. Each hyperplane is orthogonal to a nonzero 0-1-vector in R n. Open. Find the characteristic polynomial for H n. Use it to count the number of regions and number of bounded regions by Zaslavsky s Theorem. Thm.(Cavalieri-Johnson-Markwig, 2011) The regions of H n are the domains of polynomiality of double Hurwitz numbers.
26 Motivation Further Connections. See Lou Billera s talk slides On the real linear algebra of vectors of zeros and ones 1. The chambers of the Resonance Arrangement H n can be labeled by maximal unbalanced collections of 0-1 vectors. See Billera-Moore-Moraites-Wang-Williams, Minimal balanced collections determine the minimum linear description of cooperative games possessing a nonempty core in Lloyd Shapley s economic game theory work from Finding a good formula for enumerating them is still open. 3. Hadamard s maximal determinant problem from 1893 can be rephrased in terms of finding maximal absolute value determinants of 0-1 matrices.
27 Many Thanks!
Combinatorics for algebraic geometers
Combinatorics for algebraic geometers Calculations in enumerative geometry Maria Monks March 17, 214 Motivation Enumerative geometry In the late 18 s, Hermann Schubert investigated problems in what is
More informationCoxeter-Knuth Graphs and a signed Little Bijection
Coxeter-Knuth Graphs and a signed Little Bijection Sara Billey University of Washington http://www.math.washington.edu/ billey AMS-MAA Joint Meetings January 17, 2014 0-0 Outline Based on joint work with
More informationOn certain family of B-modules
On certain family of B-modules Piotr Pragacz (IM PAN, Warszawa) joint with Witold Kraśkiewicz with results of Masaki Watanabe Issai Schur s dissertation (Berlin, 1901): classification of irreducible polynomial
More informationTHE SMITH NORMAL FORM OF A SPECIALIZED JACOBI-TRUDI MATRIX
THE SMITH NORMAL FORM OF A SPECIALIZED JACOBI-TRUDI MATRIX RICHARD P. STANLEY Abstract. LetJT λ bethejacobi-trudimatrixcorrespondingtothepartitionλ, sodetjt λ is the Schur function s λ in the variables
More informationCoxeter-Knuth Classes and a Signed Little Bijection
Coxeter-Knuth Classes and a Signed Little Bijection Sara Billey University of Washington Based on joint work with: Zachary Hamaker, Austin Roberts, and Benjamin Young. UC Berkeley, February, 04 Outline
More informationStandard Young Tableaux Old and New
Standard Young Tableaux Old and New Ron Adin and Yuval Roichman Department of Mathematics Bar-Ilan University Workshop on Group Theory in Memory of David Chillag Technion, Haifa, Oct. 14 1 2 4 3 5 7 6
More informationCHROMATIC CLASSICAL SYMMETRIC FUNCTIONS
CHROMATIC CLASSICAL SYMMETRIC FUNCTIONS SOOJIN CHO AND STEPHANIE VAN WILLIGENBURG Abstract. In this note we classify when a skew Schur function is a positive linear combination of power sum symmetric functions.
More informationPatterns in Standard Young Tableaux
Patterns in Standard Young Tableaux Sara Billey University of Washington Slides: math.washington.edu/ billey/talks Based on joint work with: Matjaž Konvalinka and Joshua Swanson 6th Encuentro Colombiano
More informationMatrix compositions. Emanuele Munarini. Dipartimento di Matematica Politecnico di Milano
Matrix compositions Emanuele Munarini Dipartimento di Matematica Politecnico di Milano emanuelemunarini@polimiit Joint work with Maddalena Poneti and Simone Rinaldi FPSAC 26 San Diego Motivation: L-convex
More informationThe (q, t)-catalan Numbers and the Space of Diagonal Harmonics. James Haglund. University of Pennsylvania
The (q, t)-catalan Numbers and the Space of Diagonal Harmonics James Haglund University of Pennsylvania Outline Intro to q-analogues inv and maj q-catalan Numbers MacMahon s q-analogue The Carlitz-Riordan
More informationPuzzles Littlewood-Richardson coefficients and Horn inequalities
Puzzles Littlewood-Richardson coefficients and Horn inequalities Olga Azenhas CMUC, Centre for Mathematics, University of Coimbra Seminar of the Mathematics PhD Program UCoimbra-UPorto Porto, 6 October
More informationEQUIVARIANT COHOMOLOGY IN ALGEBRAIC GEOMETRY LECTURE TWO: DEFINITIONS AND BASIC PROPERTIES
EQUIVARIANT COHOMOLOGY IN ALGEBRAIC GEOMETRY LECTURE TWO: DEFINITIONS AND BASIC PROPERTIES WILLIAM FULTON NOTES BY DAVE ANDERSON 1 For a Lie group G, we are looking for a right principal G-bundle EG BG,
More informationAn Introduction to Transversal Matroids
An Introduction to Transversal Matroids Joseph E Bonin The George Washington University These slides and an accompanying expository paper (in essence, notes for this talk, and more) are available at http://homegwuedu/
More informationAbacus-tournament Models of Hall-Littlewood Polynomials
Abacus-tournament Models of Hall-Littlewood Polynomials Andrew J. Wills Dissertation submitted to the Faculty of the Virginia Polytechnic Institute and State University in partial fulfillment of the requirements
More information(Permutations Arising from) Hook Coefficients of Chromatic Symmetric Functions
(Permutations Arising from) Hook Coefficients of Chromatic Symmetric Functions Ryan Kaliszewski Drexel University rlk72@drexel.edu July 17, 2014 Ryan Kaliszewski (Drexel University) Hook Coefficients July
More informationA quasisymmetric function generalization of the chromatic symmetric function
A quasisymmetric function generalization of the chromatic symmetric function Brandon Humpert University of Kansas Lawrence, KS bhumpert@math.ku.edu Submitted: May 5, 2010; Accepted: Feb 3, 2011; Published:
More informationReduced words and a formula of Macdonald
Reduced words and a formula of Macdonald Sara Billey University of Washington Based on joint work with: Alexander Holroyd and Benjamin Young preprint arxiv:70.096 Graduate Student Combinatorics Conference
More informationEnumeration of Parabolic Double Cosets for Coxeter Groups
Enumeration of Parabolic Double Cosets for Coxeter Groups Sara Billey University of Washington Based on joint work with: Matjaž Konvalinka, T. Kyle Petersen, William Slofstra and Bridget Tenner based on
More informationh r t r 1 (1 x i=1 (1 + x i t). e r t r = i=1 ( 1) i e i h r i = 0 r 1.
. Four definitions of Schur functions.. Lecture : Jacobi s definition (ca 850). Fix λ = (λ λ n and X = {x,...,x n }. () a α = det ( ) x α i j for α = (α,...,α n ) N n (2) Jacobi s def: s λ = a λ+δ /a δ
More informationMath Linear Algebra Final Exam Review Sheet
Math 15-1 Linear Algebra Final Exam Review Sheet Vector Operations Vector addition is a component-wise operation. Two vectors v and w may be added together as long as they contain the same number n of
More informationLittlewood Richardson polynomials
Littlewood Richardson polynomials Alexander Molev University of Sydney A diagram (or partition) is a sequence λ = (λ 1,..., λ n ) of integers λ i such that λ 1 λ n 0, depicted as an array of unit boxes.
More informationTwo Remarks on Skew Tableaux
Two Remarks on Skew Tableaux Richard P. Stanley Department of Mathematics Massachusetts Institute of Technology Cambridge, MA 02139 rstan@math.mit.edu Submitted: 2011; Accepted: 2011; Published: XX Mathematics
More informationProduct of P-polynomial association schemes
Product of P-polynomial association schemes Ziqing Xiang Shanghai Jiao Tong University Nov 19, 2013 1 / 20 P-polynomial association scheme Definition 1 P-polynomial association scheme A = (X, {A i } 0
More informationBP -HOMOLOGY AND AN IMPLICATION FOR SYMMETRIC POLYNOMIALS. 1. Introduction and results
BP -HOMOLOGY AND AN IMPLICATION FOR SYMMETRIC POLYNOMIALS DONALD M. DAVIS Abstract. We determine the BP -module structure, mod higher filtration, of the main part of the BP -homology of elementary 2- groups.
More informationENUMERATION OF CONNECTED CATALAN OBJECTS BY TYPE. 1. Introduction
ENUMERATION OF CONNECTED CATALAN OBJECTS BY TYPE BRENDON RHOADES Abstract. Noncrossing set partitions, nonnesting set partitions, Dyck paths, and rooted plane trees are four classes of Catalan objects
More informationAdjoint Representations of the Symmetric Group
Adjoint Representations of the Symmetric Group Mahir Bilen Can 1 and Miles Jones 2 1 mahirbilencan@gmail.com 2 mej016@ucsd.edu Abstract We study the restriction to the symmetric group, S n of the adjoint
More informationarxiv: v1 [math.rt] 5 Aug 2016
AN ALGEBRAIC FORMULA FOR THE KOSTKA-FOULKES POLYNOMIALS arxiv:1608.01775v1 [math.rt] 5 Aug 2016 TIMOTHEE W. BRYAN, NAIHUAN JING Abstract. An algebraic formula for the Kostka-Foukles polynomials is given
More informationA minimaj-preserving crystal structure on ordered multiset partitions
Séminaire Lotharingien de Combinatoire 80B (018) Article #1, 1 pp. Proceedings of the 30 th Conference on Formal Power Series and Algebraic Combinatorics (Hanover) A minimaj-preserving crystal structure
More informationThe Combinatorics of Symmetric Functions: (3 + 1)-free Posets and the Poset Chain Conjecture
The Combinatorics of Symmetric Functions: ( + 1)-free Posets and the Poset Chain Conjecture Mary Bushman, Alex Evangelides, Nathan King, Sam Tucker Department of Mathematics Carleton College Northfield,
More informationTwo Remarks on Skew Tableaux
Two Remarks on Skew Tableaux The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story matters. Citation As Published Publisher Stanley, Richard P. "Two
More informationClassical Lie algebras and Yangians
Classical Lie algebras and Yangians Alexander Molev University of Sydney Advanced Summer School Integrable Systems and Quantum Symmetries Prague 2007 Lecture 1. Casimir elements for classical Lie algebras
More informationEnumeration on row-increasing tableaux of shape 2 n
Enumeration on row-increasing tableaux of shape 2 n Rosena R. X. Du East China Normal University, Shanghai, China Joint work with Xiaojie Fan and Yue Zhao Shanghai Jiaotong University June 25, 2018 2/38
More informationA Formula for the Specialization of Skew Schur Functions
A Formula for the Specialization of Skew Schur Functions The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story matters. Citation As Published Publisher
More informationREPRESENTATION THEORY OF THE SYMMETRIC GROUP (FOLLOWING [Ful97])
REPRESENTATION THEORY OF THE SYMMETRIC GROUP (FOLLOWING [Ful97]) MICHAEL WALTER. Diagrams and Tableaux Diagrams and Tableaux. A (Young) diagram λ is a partition of a natural number n 0, which we often
More informationq xk y n k. , provided k < n. (This does not hold for k n.) Give a combinatorial proof of this recurrence by means of a bijective transformation.
Math 880 Alternative Challenge Problems Fall 2016 A1. Given, n 1, show that: m1 m 2 m = ( ) n+ 1 2 1, where the sum ranges over all positive integer solutions (m 1,..., m ) of m 1 + + m = n. Give both
More informationA Murnaghan-Nakayama Rule for k-schur Functions
A Murnaghan-Nakayama Rule for k-schur Functions Anne Schilling (joint work with Jason Bandlow, Mike Zabrocki) University of California, Davis October 31, 2012 Outline History The Murnaghan-Nakayama rule
More informationCounting matrices over finite fields
Counting matrices over finite fields Steven Sam Massachusetts Institute of Technology September 30, 2011 1/19 Invertible matrices F q is a finite field with q = p r elements. [n] = 1 qn 1 q = qn 1 +q n
More informationKraśkiewicz-Pragacz modules and some positivity properties of Schubert polynomials
Kraśkiewicz-Pragacz modules and some positivity properties of Schubert polynomials Masaki Watanabe Graduate School of Mathematical Sciences, the University of Tokyo December 9, 2015 Masaki Watanabe KP
More informationMath Camp Lecture 4: Linear Algebra. Xiao Yu Wang. Aug 2010 MIT. Xiao Yu Wang (MIT) Math Camp /10 1 / 88
Math Camp 2010 Lecture 4: Linear Algebra Xiao Yu Wang MIT Aug 2010 Xiao Yu Wang (MIT) Math Camp 2010 08/10 1 / 88 Linear Algebra Game Plan Vector Spaces Linear Transformations and Matrices Determinant
More informationHyperplane Arrangements & Diagonal Harmonics
Hyperplane Arrangements & Diagonal Harmonics Drew Armstrong arxiv:1005.1949 Coinvariants Coinvariants Theorems (Newton-Chevalley-etc): Let S n act on S = C[x 1,..., x n ] by permuting variables. Coinvariants
More informationPIERI S FORMULA FOR GENERALIZED SCHUR POLYNOMIALS
Title Pieri's formula for generalized Schur polynomials Author(s)Numata, Yasuhide CitationJournal of Algebraic Combinatorics, 26(1): 27-45 Issue Date 2007-08 Doc RL http://hdl.handle.net/2115/33803 Rights
More informationREPRESENTATIONS OF S n AND GL(n, C)
REPRESENTATIONS OF S n AND GL(n, C) SEAN MCAFEE 1 outline For a given finite group G, we have that the number of irreducible representations of G is equal to the number of conjugacy classes of G Although
More informationGeneralized Moment-Angle Complexes, Lecture 3
Generalized Moment-Angle Complexes, Lecture 3 Fred Cohen 1-5 June 2010 joint work with Tony Bahri, Martin Bendersky, and Sam Gitler Outline of the lecture: This lecture addresses the following points.
More informationSCHUR-WEYL DUALITY FOR U(n)
SCHUR-WEYL DUALITY FOR U(n) EVAN JENKINS Abstract. These are notes from a lecture given in MATH 26700, Introduction to Representation Theory of Finite Groups, at the University of Chicago in December 2009.
More informationThe Littlewood-Richardson Rule
REPRESENTATIONS OF THE SYMMETRIC GROUP The Littlewood-Richardson Rule Aman Barot B.Sc.(Hons.) Mathematics and Computer Science, III Year April 20, 2014 Abstract We motivate and prove the Littlewood-Richardson
More informationOperators on k-tableaux and the k-littlewood Richardson rule for a special case. Sarah Elizabeth Iveson
Operators on k-tableaux and the k-littlewood Richardson rule for a special case by Sarah Elizabeth Iveson A dissertation submitted in partial satisfaction of the requirements for the degree of Doctor of
More informationThe Waring rank of the Vandermonde determinant
The Waring rank of the Vandermonde determinant Alexander Woo (U. Idaho) joint work with Zach Teitler(Boise State) SIAM Conference on Applied Algebraic Geometry, August 3, 2014 Waring rank Given a polynomial
More informationIr O D = D = ( ) Section 2.6 Example 1. (Bottom of page 119) dim(v ) = dim(l(v, W )) = dim(v ) dim(f ) = dim(v )
Section 3.2 Theorem 3.6. Let A be an m n matrix of rank r. Then r m, r n, and, by means of a finite number of elementary row and column operations, A can be transformed into the matrix ( ) Ir O D = 1 O
More informationA zoo of Hopf algebras
Non-Commutative Symmetric Functions I: A zoo of Hopf algebras Mike Zabrocki York University Joint work with Nantel Bergeron, Anouk Bergeron-Brlek, Emmanurel Briand, Christophe Hohlweg, Christophe Reutenauer,
More informationA combinatorial approach to the q, t-symmetry relation in Macdonald polynomials
A combinatorial approach to the q, t-symmetry relation in Macdonald polynomials Maria Monks Gillespie Department of Mathematics University of California, Berkeley Berkeley, CA, U.S.A. monks@math.berkeley.edu
More informationCatalan functions and k-schur positivity
Catalan functions and k-schur positivity Jonah Blasiak Drexel University joint work with Jennifer Morse, Anna Pun, and Dan Summers November 2018 Theorem (Haiman) Macdonald positivity conjecture The modified
More informationALGEBRAIC COMBINATORICS
ALGEBRAIC COMBINATORICS Sami Assaf & Anne Schilling A Demazure crystal construction for Schubert polynomials Volume 1, issue (018), p. 5-7. The journal
More informationSkew row-strict quasisymmetric Schur functions
Journal of Algebraic Combinatorics manuscript No. (will be inserted by the editor) Skew row-strict quasisymmetric Schur functions Sarah K. Mason Elizabeth Niese Received: date / Accepted: date Abstract
More informationMath 240 Calculus III
Generalized Calculus III Summer 2015, Session II Thursday, July 23, 2015 Agenda 1. 2. 3. 4. Motivation Defective matrices cannot be diagonalized because they do not possess enough eigenvectors to make
More informationA Survey of Parking Functions
A Survey of Parking Functions Richard P. Stanley M.I.T. Parking functions... n 2 1... a a a 1 2 n Car C i prefers space a i. If a i is occupied, then C i takes the next available space. We call (a 1,...,a
More informationComparing skew Schur functions: a quasisymmetric perspective
Comparing skew Schur functions: a quasisymmetric perspective Peter McNamara Bucknell University AMS/EMS/SPM International Meeting 11 June 2015 Slides and paper available from www.facstaff.bucknell.edu/pm040/
More informationAn Introduction to Combinatorial Species
An Introduction to Combinatorial Species Ira M. Gessel Department of Mathematics Brandeis University Summer School on Algebraic Combinatorics Korea Institute for Advanced Study Seoul, Korea June 14, 2016
More informationHodge theory for combinatorial geometries
Hodge theory for combinatorial geometries June Huh with Karim Adiprasito and Eric Katz June Huh 1 / 48 Three fundamental ideas: June Huh 2 / 48 Three fundamental ideas: The idea of Bernd Sturmfels that
More informationNotes on the Matrix-Tree theorem and Cayley s tree enumerator
Notes on the Matrix-Tree theorem and Cayley s tree enumerator 1 Cayley s tree enumerator Recall that the degree of a vertex in a tree (or in any graph) is the number of edges emanating from it We will
More informationTRIVARIATE MONOMIAL COMPLETE INTERSECTIONS AND PLANE PARTITIONS
TRIVARIATE MONOMIAL COMPLETE INTERSECTIONS AND PLANE PARTITIONS CHARLES CHEN, ALAN GUO, XIN JIN, AND GAKU LIU Abstract. We consider the homogeneous components U r of the map on R = k[x, y, z]/(x A, y B,
More informationCylindric Young Tableaux and their Properties
Cylindric Young Tableaux and their Properties Eric Neyman (Montgomery Blair High School) Mentor: Darij Grinberg (MIT) Fourth Annual MIT PRIMES Conference May 17, 2014 1 / 17 Introduction Young tableaux
More informationNOTES ABOUT SATURATED CHAINS IN THE DYCK PATH POSET. 1. Basic Definitions
NOTES ABOUT SATURATED CHAINS IN THE DYCK PATH POSET JENNIFER WOODCOCK 1. Basic Definitions Dyck paths are one of the many combinatorial objects enumerated by the Catalan numbers, sequence A000108 in [2]:
More informationCharacters, Derangements and Descents for the Hyperoctahedral Group
Characters, Derangements and Descents for the Hyperoctahedral Group Christos Athanasiadis joint with Ron Adin, Sergi Elizalde and Yuval Roichman University of Athens July 9, 2015 1 / 42 Outline 1 Motivation
More informationEcon Slides from Lecture 7
Econ 205 Sobel Econ 205 - Slides from Lecture 7 Joel Sobel August 31, 2010 Linear Algebra: Main Theory A linear combination of a collection of vectors {x 1,..., x k } is a vector of the form k λ ix i for
More informationAN ALGORITHMIC SIGN-REVERSING INVOLUTION FOR SPECIAL RIM-HOOK TABLEAUX
AN ALGORITHMIC SIGN-REVERSING INVOLUTION FOR SPECIAL RIM-HOOK TABLEAUX BRUCE E. SAGAN AND JAEJIN LEE Abstract. Eğecioğlu and Remmel [2] gave an interpretation for the entries of the inverse Kostka matrix
More informationResults and conjectures on the number of standard strong marked tableaux
FPSAC 013, Paris, France DMTCS proc. (subm.), by the authors, 1 1 Results and conjectures on the number of standard strong marked tableaux Susanna Fishel 1 and Matjaž Konvalinka 1 School of Mathematical
More informationShifted symmetric functions I: the vanishing property, skew Young diagrams and symmetric group characters
I: the vanishing property, skew Young diagrams and symmetric group characters Valentin Féray Institut für Mathematik, Universität Zürich Séminaire Lotharingien de Combinatoire Bertinoro, Italy, Sept. 11th-12th-13th
More informationThe uniqueness problem for chromatic symmetric functions of trees
The uniqueness problem for chromatic symmetric functions of trees Jeremy L. Martin (University of Kansas) AMS Western Sectional Meeting UNLV, April 18, 2015 Colorings and the Chromatic Polynomial Throughout,
More informationEXTREME RAYS OF THE (N,K)-SCHUR CONE
EXTREME RAYS OF THE (N,K-SCHUR CONE CHRISTIAN GAETZ, KYLE MEYER, KA YU TAM, MAX WIMBERLEY, ZIJIAN YAO, AND HEYI ZHU Abstract. We discuss several partial results towards proving White s conjecture on the
More informationCombinatorial Reciprocity Theorems
Combinatorial Reciprocity Theorems Matthias Beck San Francisco State University math.sfsu.edu/beck Based on joint work with Thomas Zaslavsky Binghamton University (SUNY) In mathematics you don t understand
More informationCombinatorial Reciprocity Theorems
Combinatorial Reciprocity Theorems Matthias Beck San Francisco State University math.sfsu.edu/beck based on joint work with Raman Sanyal Universität Frankfurt JCCA 2018 Sendai Thomas Zaslavsky Binghamton
More informationMATHEMAGICAL FORMULAS FOR SYMMETRIC FUNCTIONS. Contents
MATHEMAGICAL FORMULAS FOR SYMMETRIC FUNCTIONS Contents The Bibliography. Basic Notations. Classical Basis of Λ. Generating Functions and Identities 4 4. Frobenius transform and Hilbert series 4 5. Plethysm
More informationYOUNG TABLEAUX AND THE REPRESENTATIONS OF THE SYMMETRIC GROUP
YOUNG TABLEAUX AND THE REPRESENTATIONS OF THE SYMMETRIC GROUP YUFEI ZHAO ABSTRACT We explore an intimate connection between Young tableaux and representations of the symmetric group We describe the construction
More informationINEQUALITIES OF SYMMETRIC FUNCTIONS. 1. Introduction to Symmetric Functions [?] Definition 1.1. A symmetric function in n variables is a function, f,
INEQUALITIES OF SMMETRIC FUNCTIONS JONATHAN D. LIMA Abstract. We prove several symmetric function inequalities and conjecture a partially proved comprehensive theorem. We also introduce the condition of
More informationChromatic bases for symmetric functions
Chromatic bases for symmetric functions Soojin Cho Department of Mathematics Ajou University Suwon 443-749, Korea chosj@ajou.ac.kr Stephanie van Willigenburg Department of Mathematics University of British
More informationTrees, Tanglegrams, and Tangled Chains
Trees, Tanglegrams, and Tangled Chains Sara Billey University of Washington Based on joint work with: Matjaž Konvalinka and Frederick (Erick) Matsen IV arxiv:1507.04976 WPI, September 12, 2015 Outline
More informationPeter Magyar Research Summary
Peter Magyar Research Summary 1993 2005 Nutshell Version 1. Borel-Weil theorem for configuration varieties and Schur modules One of the most useful constructions of algebra is the Schur module S λ, an
More information5-VERTEX MODELS, GELFAND-TSETLIN PATTERNS AND SEMISTANDARD YOUNG TABLEAUX
5-VERTEX MODELS, GELFAND-TSETLIN PATTERNS AND SEMISTANDARD YOUNG TABLEAUX TANTELY A. RAKOTOARISOA 1. Introduction In statistical mechanics, one studies models based on the interconnections between thermodynamic
More informationProblem 1. Let f n (x, y), n Z, be the sequence of rational functions in two variables x and y given by the initial conditions.
18.217 Problem Set (due Monday, December 03, 2018) Solve as many problems as you want. Turn in your favorite solutions. You can also solve and turn any other claims that were given in class without proofs,
More informationCombinatorics of non-associative binary operations
Combinatorics of non-associative binary operations Jia Huang University of Nebraska at Kearney E-mail address: huangj2@unk.edu December 26, 2017 This is joint work with Nickolas Hein (Benedictine College),
More informationPLANE PARTITIONS AMY BECKER, LILLY BETKE-BRUNSWICK, ANNA ZINK
PLANE PARTITIONS AMY BECKER, LILLY BETKE-BRUNSWICK, ANNA ZINK Abstract. Throughout our study of the enumeration of plane partitions we make use of bijective proofs to find generating functions. In particular,
More informationPartitions, rooks, and symmetric functions in noncommuting variables
Partitions, rooks, and symmetric functions in noncommuting variables Mahir Bilen Can Department of Mathematics, Tulane University New Orleans, LA 70118, USA, mcan@tulane.edu and Bruce E. Sagan Department
More informationBinomial determinants and positivity of Chern-Schwartz-MacPherson classes
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 6() (015), Pages 155 171 Binomial determinants and positivity of Chern-Schwartz-MacPherson classes Leonardo Constantin Mihalcea Department of Mathematics 460
More informationGrassmann Coordinates
Grassmann Coordinates and tableaux Matthew Junge Autumn 2012 Goals 1 Describe the classical embedding G(k, n) P N. 2 Characterize the image of the embedding quadratic relations. vanishing polynomials.
More informationThe Gaussian coefficient revisited
The Gaussian coefficient revisited Richard EHRENBORG and Margaret A. READDY Abstract We give new -(1+)-analogue of the Gaussian coefficient, also now as the -binomial which, lie the original -binomial
More informationMATH 323 Linear Algebra Lecture 12: Basis of a vector space (continued). Rank and nullity of a matrix.
MATH 323 Linear Algebra Lecture 12: Basis of a vector space (continued). Rank and nullity of a matrix. Basis Definition. Let V be a vector space. A linearly independent spanning set for V is called a basis.
More informationComputing inclusions of Schur modules
JSAG 1 (2009), 5 10 The Journal of Software for Algebra and Geometry Computing inclusions of Schur modules STEVEN V SAM ABSTRACT. We describe a software package for constructing minimal free resolutions
More informationGRE Subject test preparation Spring 2016 Topic: Abstract Algebra, Linear Algebra, Number Theory.
GRE Subject test preparation Spring 2016 Topic: Abstract Algebra, Linear Algebra, Number Theory. Linear Algebra Standard matrix manipulation to compute the kernel, intersection of subspaces, column spaces,
More informationMath 240 Calculus III
The Calculus III Summer 2015, Session II Wednesday, July 8, 2015 Agenda 1. of the determinant 2. determinants 3. of determinants What is the determinant? Yesterday: Ax = b has a unique solution when A
More informationGraph invariants in the spin model
Graph invariants in the spin model Alexander Schrijver 1 Abstract. Given a symmetric n n matrix A, we define, for any graph G, f A (G) := a φ(u),φ(v). φ:v G {1,...,n} uv EG We characterize for which graph
More informationD-FINITE SYMMETRIC FUNCTIONS.
D-FINITE SYMMETRIC FUNCTIONS. by Mariolys Rivas B.Sc.H., Central University of Venezuela, 2006 a Thesis submitted in partial fulfillment of the requirements for the degree of Master of Science in the School
More informationA MURNAGHAN-NAKAYAMA RULE FOR NONCOMMUTATIVE SCHUR FUNCTIONS
A MURNAGHAN-NAKAYAMA RULE FOR NONCOMMUTATIVE SCHUR FUNCTIONS VASU V. TEWARI Abstract. We prove a Murnaghan-Nakayama rule for noncommutative Schur functions introduced by Bessenrodt, Luoto and van Willigenburg.
More informationCOINCIDENCES AMONG SKEW SCHUR FUNCTIONS
COINCIDENCES AMONG SKEW SCHUR FUNCTIONS author: Victor Reiner address: School of Mathematics University of Minnesota Minneapolis, MN 55455 USA email: reiner@math.umn.edu author: Kristin M. Shaw address:
More informationFiner rook equivalence: Classifying Ding s Schubert varieties
Finer rook equivalence: Classifying Ding s Schubert varieties Mike Develin Jeremy Martin Victor Reiner (AIM) (University of Minnesota) (University of Minnesota Preprint: arxiv:math.ag/4353 math.umn.edu/
More informationTrees, Tanglegrams, and Tangled Chains
Trees, Tanglegrams, and Tangled Chains Sara Billey University of Washington Based on joint work with: Matjaž Konvalinka and Frederick (Erick) Matsen IV arxiv:1507.04976 LSU Math Student Colloquium, February
More informationand Other Combinatorial Reciprocity Instances
and Other Combinatorial Reciprocity Instances Matthias Beck San Francisco State University math.sfsu.edu/beck [Courtney Gibbons] Act 1: Binomial Coefficients Not everything that can be counted counts,
More information5 Quiver Representations
5 Quiver Representations 5. Problems Problem 5.. Field embeddings. Recall that k(y,..., y m ) denotes the field of rational functions of y,..., y m over a field k. Let f : k[x,..., x n ] k(y,..., y m )
More informationEdinburgh, December 2009
From totally nonnegative matrices to quantum matrices and back, via Poisson geometry Edinburgh, December 2009 Joint work with Ken Goodearl and Stéphane Launois Papers available at: http://www.maths.ed.ac.uk/~tom/preprints.html
More informationPlücker Relations on Schur Functions
Journal of Algebraic Combinatorics 13 (2001), 199 211 c 2001 Kluwer Academic Publishers. Manufactured in The Netherlands. Plücker Relations on Schur Functions MICHAEL KLEBER kleber@math.mit.edu Department
More informationWreath Product Symmetric Functions
International Journal of Algebra, Vol. 3, 2009, no. 1, 1-19 Wreath Product Symmetric Functions Frank Ingram Mathematics Department, Winston-Salem State University Winston-Salem, NC 27110, USA ingramfr@wssu.edu
More information