Inequalities for Symmetric Polynomials
|
|
- Anna Logan
- 6 years ago
- Views:
Transcription
1 Inequalities for Symmetric Polynomials Curtis Greene October 24, 2009
2 Co-authors This talk is based on Inequalities for Symmetric Means, with Allison Cuttler, Mark Skandera (to appear in European Jour. Combinatorics). Inequalities for Symmetric Functions of Degree 3, with Jeffrey Kroll, Jonathan Lima, Mark Skandera, and Rengyi Xu (to appear). Other work in progress. Available on request, or at
3 Inequalities for Averages and Means Classical examples (e.g., Hardy-Littlewood-Polya) THE AGM INEQUALITY: x 1 + x x n n (x 1 x 2 x n ) 1/n x 0.
4 Inequalities for Averages and Means Classical examples (e.g., Hardy-Littlewood-Polya) THE AGM INEQUALITY: x 1 + x x n n (x 1 x 2 x n ) 1/n x 0. NEWTON S INEQUALITIES: e k (x) e k (x) e k (1) e k (1) e k 1(x) e k+1 (x) e k 1 (1) e k+1 (1) x 0
5 Inequalities for Averages and Means Classical examples (e.g., Hardy-Littlewood-Polya) THE AGM INEQUALITY: x 1 + x x n n (x 1 x 2 x n ) 1/n x 0. NEWTON S INEQUALITIES: e k (x) e k (x) e k (1) e k (1) e k 1(x) e k+1 (x) e k 1 (1) e k+1 (1) x 0 MUIRHEAD S INEQUALITIES: If λ = µ, then m λ (x) m λ (1) m µ(x) m µ (1) x 0 iff λ µ (majorization).
6 Inequalities for Averages and Means Other examples: different degrees MACLAURIN S INEQUALITIES: ( e j (x) ) 1/j ( e k (x) ) 1/k if j k, x 0 e j (1) e k (1) SCHLÖMILCH S (POWER SUM) INEQUALITIES: (p j (x) n ) 1/j ( pk (x)) 1/k n if j k, x 0
7 Inequalities for Averages and Means Some results Muirhead-like theorems (and conjectures) for all of the classical families. A single master theorem that includes many of these. Proofs based on a new (and potentially interesting) kind of positivity.
8 Inequalities for Averages and Means Definitions We consider two kinds of averages : Term averages: F (x) = 1 f (1) f (x), assuming f has nonnegative integer coefficients. And also Means: F(x) = ( ) 1 1/d f (1) f (x) where f is homogeneous of degree d.
9 Inequalities for Averages and Means Definitions We consider two kinds of averages : Term averages: F (x) = 1 f (1) f (x), assuming f has nonnegative integer coefficients. And also Means: Example: F(x) = ( ) 1 1/d f (1) f (x) where f is homogeneous of degree d. E k (x) = 1 ( n k)e k (x) E k (x) = (E k (x)) 1/k
10 Inequalities for Averages and Means Muirhead-like Inequalities: ELEMENTARY: E λ (x) E µ (x), x 0 λ µ. POWER SUM: P λ (x) P µ (x), x 0 λ µ. HOMOGENEOUS: H λ (x) H µ (x), x 0 = λ µ. SCHUR: S λ (x) S µ (x), x 0 = λ µ.
11 Inequalities for Averages and Means Muirhead-like Inequalities: ELEMENTARY: E λ (x) E µ (x), x 0 λ µ. POWER SUM: P λ (x) P µ (x), x 0 λ µ. HOMOGENEOUS: H λ (x) H µ (x), x 0 = λ µ. SCHUR: S λ (x) S µ (x), x 0 = λ µ. CONJECTURE: the last two implications are. Reference: Cuttler,Greene, Skandera
12 Inequalities for Averages and Means The Majorization Poset P 7 (Governs term-average inequalities for E λ, P λ, H λ, S λ and M λ.)
13 Normalized Majorization Majorization vs. Normalized Majorization MAJORIZATION: λ µ iff λ 1 + λ i µ 1 + µ i i MAJORIZATION POSET: (P n, ) on partitions λ n. NORMALIZED MAJORIZATION: λ µ iff λ λ µ µ. NORMALIZED MAJORIZATION POSET: Define P = n P n. Then (P, ) = quotient of (P, ) (a preorder) under the relation α β if α β and β α.
14 Normalized Majorization Majorization vs. Normalized Majorization MAJORIZATION: λ µ iff λ 1 + λ i µ 1 + µ i i MAJORIZATION POSET: (P n, ) on partitions λ n. NORMALIZED MAJORIZATION: λ µ iff λ λ µ µ. NORMALIZED MAJORIZATION POSET: Define P = n P n. Then (P, ) = quotient of (P, ) (a preorder) under the relation α β if α β and β α. NOTES: (P, ) is a lattice, but is not locally finite. (P n, ) is not a lattice. (P n, ) embeds in (P, ) as a sublattice and in (P n, ) as a subposet.
15 Normalized Majorization P n partitions λ with λ n whose parts are relatively prime. Figure: (P 6, ) with an embedding of (P 6, ) shown in blue.
16 Normalized Majorization Muirhead-like Inequalities for Means ELEMENTARY: E λ (x) E µ (x), x 0 λ µ. POWER SUM: P λ (x) P µ (x), x 0 λ µ. HOMOGENEOUS: H λ (x) H µ (x), x 0 = λ µ. CONJECTURE: the last implication is.
17 Normalized Majorization Muirhead-like Inequalities for Means ELEMENTARY: E λ (x) E µ (x), x 0 λ µ. POWER SUM: P λ (x) P µ (x), x 0 λ µ. HOMOGENEOUS: H λ (x) H µ (x), x 0 = λ µ. CONJECTURE: the last implication is. What about inequalities for Schur means S λ?
18 Normalized Majorization Muirhead-like Inequalities for Means ELEMENTARY: E λ (x) E µ (x), x 0 λ µ. POWER SUM: P λ (x) P µ (x), x 0 λ µ. HOMOGENEOUS: H λ (x) H µ (x), x 0 = λ µ. CONJECTURE: the last implication is. What about inequalities for Schur means S λ? We have no idea.
19 Normalized Majorization Muirhead-like Inequalities for Means ELEMENTARY: E λ (x) E µ (x), x 0 λ µ. POWER SUM: P λ (x) P µ (x), x 0 λ µ. HOMOGENEOUS: H λ (x) H µ (x), x 0 = λ µ. CONJECTURE: the last implication is. What about inequalities for Schur means S λ? We have no idea. What about inequalities for monomial means M λ?
20 Normalized Majorization Muirhead-like Inequalities for Means ELEMENTARY: E λ (x) E µ (x), x 0 λ µ. POWER SUM: P λ (x) P µ (x), x 0 λ µ. HOMOGENEOUS: H λ (x) H µ (x), x 0 = λ µ. CONJECTURE: the last implication is. What about inequalities for Schur means S λ? We have no idea. What about inequalities for monomial means M λ? We know a lot.
21 Master Theorem: Double Majorization A Master Theorem for Monomial Means THEOREM/CONJECTURE: M λ (x) M µ (x)iff λ µ. where λ µ is the double majorization order (to be defined shortly).
22 Master Theorem: Double Majorization A Master Theorem for Monomial Means THEOREM/CONJECTURE: M λ (x) M µ (x)iff λ µ. where λ µ is the double majorization order (to be defined shortly). Generalizes Muirhead s inequality; allows comparison of symmetric polynomials of different degrees.
23 Master Theorem: Double Majorization The double (normalized) majorization order DEFINITION: λ µ iff λ µ and λ µ, EQUIVALENTLY: λ µ iff λ λ µ µ and λ λ µ µ. DEFINITION: DP = (P, )
24 Master Theorem: Double Majorization The double (normalized) majorization order DEFINITION: λ µ iff λ µ and λ µ, EQUIVALENTLY: λ µ iff λ λ µ µ and λ λ µ µ. DEFINITION: DP = (P, ) NOTES: The conditions λ µ and λ µ are not equivalent. Example: λ = {2, 2}, µ = {2, 1}. If λ µ and µ λ, then λ = µ; hence DP is a partial order. DP is self-dual and locally finite, but is not locally ranked, and is not a lattice. For all n, (P n, ) embeds isomorphically in DP as a subposet.
25 Master Theorem: Double Majorization DP 5 Figure: Double majorization poset DP 5 with vertical embeddings of P n, n = 1, 2,..., 5. (Governs inequalities for M λ.)
26 Master Theorem: Double Majorization DP 6 Figure: Double majorization poset DP 6 with an embedding of P 6 shown in blue.
27 Master Theorem: Double Majorization Much of the conjecture has been proved: MASTER THEOREM : λ, µ any partitions M λ M µ if and only if λ µ, i.e., λ λ µ µ and λ λ µ µ. PROVED: The only if part. For all λ, µ with λ µ. For λ, µ with λ, µ 6 (DP 6 ). For many other special cases.
28 Master Theorem: Double Majorization Interesting question The Master Theorem/Conjecture combined with our other results about P λ and E λ imply the following statement: M λ (x) M µ (x) E λ (x) E µ (x) and P λ (x) P µ (x).
29 Master Theorem: Double Majorization Interesting question The Master Theorem/Conjecture combined with our other results about P λ and E λ imply the following statement: M λ (x) M µ (x) E λ (x) E µ (x) and P λ (x) P µ (x). Is there a non-combinatorial (e.g., algebraic) proof of this?
30 Y-Positivity Why are these results true? Y-Positivity ALL of the inequalities in this talk can be established by an argument of the following type: Assuming that F (x) and G(x) are symmetric polynomials, let F (y) and G(y) be obtained from F (x) and G(x) by making the substitution x i = y i + y i+1 + y n, i = 1,..., n. Then F (y) G(y) is a polynomial in y with nonnegative coefficients. Hence F (x) G(x) for all x 0.
31 Y-Positivity Why are these results true? Y-Positivity ALL of the inequalities in this talk can be established by an argument of the following type: Assuming that F (x) and G(x) are symmetric polynomials, let F (y) and G(y) be obtained from F (x) and G(x) by making the substitution x i = y i + y i+1 + y n, i = 1,..., n. Then F (y) G(y) is a polynomial in y with nonnegative coefficients. Hence F (x) G(x) for all x 0. We call this phenomenon y-positivity
32 Y-Positivity Why are these results true? Y-Positivity ALL of the inequalities in this talk can be established by an argument of the following type: Assuming that F (x) and G(x) are symmetric polynomials, let F (y) and G(y) be obtained from F (x) and G(x) by making the substitution x i = y i + y i+1 + y n, i = 1,..., n. Then F (y) G(y) is a polynomial in y with nonnegative coefficients. Hence F (x) G(x) for all x 0. We call this phenomenon y-positivity or maybe it should be why-positivity....
33 Y-Positivity Example: AGM Inequality In[1]:= n 4; LHS Sum x i, i, n n ^n RHS Product x i, i, n Out[2]= Out[3]= In[4]:= Out[4]= In[5]:= Out[5]= 1 x 1 x 2 x 3 x x 1 x 2 x 3 x 4 LHS RHS. Table x i Sum y j, j, i, n, i, n y 4 y 3 y 4 y 2 y 3 y 4 y 1 y 2 y 3 y 4 1 y 1 2 y 2 3 y 3 4 y Expand y y 1 3 y y 1 2 y y 1 y 2 3 y y 1 3 y y 1 y 2 2 y y 2 3 y y 1 2 y y 1 y 2 y y 1 y y 2 y y y 1 3 y y 1 2 y 2 y 4 32 y 1 2 y 2 y 3 32 y 2 2 y y 1 y 2 2 y y 2 3 y y 1 2 y 3 y 4 5 y 1 y 2 y 3 y y 2 2 y 3 y y 1 y 3 2 y y 2 y 3 2 y y 3 3 y y 1 2 y y 1 y 2 y y 2 2 y y 1 y 3 y y 2 y 3 y y 3 2 y 4 2
34 Y-Positivity Y-Positivity Conjecture for Schur Functions If λ = µ and λ µ, then s λ (x) s λ (1) s µ(x) s µ (1) x i y i + y n is a polynomial in y with nonnegative coefficients.
35 Y-Positivity Y-Positivity Conjecture for Schur Functions If λ = µ and λ µ, then s λ (x) s λ (1) s µ(x) s µ (1) x i y i + y n is a polynomial in y with nonnegative coefficients. Proved for λ 9 and all n. (CG + Renggyi (Emily) Xu)
36 Symmetric Functions of Degree 3 Ultimate Problem: Classify all homogeneous symmetric function inequalities.
37 Symmetric Functions of Degree 3 More Modest Problem: Classify all homogeneous symmetric function inequalities of degree 3.
38 Symmetric Functions of Degree 3 This has long been recognized as an important question.
39 Symmetric Functions of Degree 3 Classifying all symmetric function inequalities of degree 3 We seek to characterize symmetric f (x) such that f (x) 0 for all x 0. Such f s will be called nonnegative. If f is homogeneous of degree 3 then f (x) = αm 3 (x) + βm 21 (x) + γm 111 (x), where the m s are monomial symmetric functions. Suppose that f (x) has n variables. Then the correspondence f (α, β, γ) parameterizes the set of nonnegative f s by a cone in R 3 with n extreme rays.
40 Symmetric Functions of Degree 3 Classifying all symmetric function inequalities of degree 3 We seek to characterize symmetric f (x) such that f (x) 0 for all x 0. Such f s will be called nonnegative. If f is homogeneous of degree 3 then f (x) = αm 3 (x) + βm 21 (x) + γm 111 (x), where the m s are monomial symmetric functions. Suppose that f (x) has n variables. Then the correspondence f (α, β, γ) parameterizes the set of nonnegative f s by a cone in R 3 with n extreme rays. This is not obvious.
41 Symmetric Functions of Degree 3 Classifying all symmetric function inequalities of degree 3 We seek to characterize symmetric f (x) such that f (x) 0 for all x 0. Such f s will be called nonnegative. If f is homogeneous of degree 3 then f (x) = αm 3 (x) + βm 21 (x) + γm 111 (x), where the m s are monomial symmetric functions. Suppose that f (x) has n variables. Then the correspondence f (α, β, γ) parameterizes the set of nonnegative f s by a cone in R 3 with n extreme rays. This is not obvious. We call it the positivity cone P n,3. (Structure depends on n.)
42 Symmetric Functions of Degree 3 Example: For example, if n = 3, there are three extreme rays, spanned by f 1 (x) = m 21 (x) 6m 111 (x) f 2 (x) = m 111 (x) f 3 (x) = m 3 (x) m 21 (x) + 3m 111 (x). If f is cubic, nonnegative, and symmetric in variables x = (x 1, x 2, x 3 ) then f may be expressed as a nonnegative linear combination of these three functions.
43 Symmetric Functions of Degree 3 Example: If n = 25, the cone looks like this: c 111 c 21 c 3
44 Symmetric Functions of Degree 3 Main Result: Theorem: If x = (x 1, x 2,..., x n ), and f (x) is a symmetric function of degree 3, then f (x) is nonnegative if and only if f (1 n k ) 0 for k = 1,..., n, where 1 n k = (1,..., 1, 0,..., 0), with k ones and (n k) zeros.
45 Symmetric Functions of Degree 3 Main Result: Theorem: If x = (x 1, x 2,..., x n ), and f (x) is a symmetric function of degree 3, then f (x) is nonnegative if and only if f (1 n k ) 0 for k = 1,..., n, where 1 n k = (1,..., 1, 0,..., 0), with k ones and (n k) zeros. Example: If x = (x 1, x 2, x 3 ) and f (x) = m 3 (x) m 21 (x) + 3m 111 (x), then f (1, 0, 0) = 1 f (1, 1, 0) = 2 2 = 0 f (1, 1, 1) = = 0
46 Symmetric Functions of Degree 3 Main Result: Theorem: If x = (x 1, x 2,..., x n ), and f (x) is a symmetric function of degree 3, then f (x) is nonnegative if and only if f (1 n k ) 0 for k = 1,..., n, where 1 n k = (1,..., 1, 0,..., 0), with k ones and (n k) zeros. Example: If x = (x 1, x 2, x 3 ) and f (x) = m 3 (x) m 21 (x) + 3m 111 (x), then NOTES: f (1, 0, 0) = 1 f (1, 1, 0) = 2 2 = 0 f (1, 1, 1) = = 0 The inequality f (x) 0 is known as Schur s Inequality (HLP). The statement analogous to the above theorem for degree d > 3 is false.
47 Symmetric Functions of Degree 3 Application: A positive function that is not y-positive Again take f (x) = m 3 (x) m 21 (x) + 3m 111 (x), but with n = 5 variables. Then f (1, 0, 0, 0, 0) = 1, f (1, 1, 0, 0, 0) = 0, f (1, 1, 1, 0, 0) = 0, f (1, 1, 1, 1, 0) = 4, f (1, 1, 1, 1, 1) = 15. Hence, by the Theorem, f (x) 0 for all x 0.
48 Symmetric Functions of Degree 3 Application: A positive function that is not y-positive Again take f (x) = m 3 (x) m 21 (x) + 3m 111 (x), but with n = 5 variables. Then f (1, 0, 0, 0, 0) = 1, f (1, 1, 0, 0, 0) = 0, f (1, 1, 1, 0, 0) = 0, f (1, 1, 1, 1, 0) = 4, f (1, 1, 1, 1, 1) = 15. Hence, by the Theorem, f (x) 0 for all x 0. However, y-substitution give f (y) = Out[12]= which has exactly one negative coefficient, y[1] 2 y[5].
49 Symmetric Functions of Degree 3 Reference: Inequalities for Symmetric Functions of Degree 3, with Jeffrey Kroll, Jonathan Lima, Mark Skandera, and Rengyi Xu (to appear). Available on request, or at
50 Symmetric Functions of Degree 3 Acknowledgments Students who helped build two Mathematica packages that were used extensively: symfun.m: Julien Colvin, Ben Fineman, Renggyi (Emily) Xu posets.m: Eugenie Hunsicker, John Dollhopf, Sam Hsiao, Erica Greene
Variations on the Majorization Order
Variations on the Majorization Order Curtis Greene, Haverford College Halifax, June 18, 2012 A. W. Marshall, I. Olkin, B. C. Arnold Inequalities: Theory of Majorization and its Applications, 2nd Edition
More informationINEQUALITIES FOR SYMMETRIC MEANS. 1. Introduction
INEQUALITIES FOR SYMMETRIC MEANS ALLISON CUTTLER, CURTIS GREENE, AND MARK SKANDERA Abstract. We study Muirhead-type generalizations of families of inequalities due to Newton, Maclaurin and others. Each
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 informationAlgebra 1. Standard 1: Operations With Real Numbers Students simplify and compare expressions. They use rational exponents and simplify square roots.
Standard 1: Operations With Real Numbers Students simplify and compare expressions. They use rational exponents and simplify square roots. A1.1.1 Compare real number expressions. A1.1.2 Simplify square
More informationSpherical varieties and arc spaces
Spherical varieties and arc spaces Victor Batyrev, ESI, Vienna 19, 20 January 2017 1 Lecture 1 This is a joint work with Anne Moreau. Let us begin with a few notations. We consider G a reductive connected
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 informationShifted symmetric functions II: expansions in multi-rectangular coordinates
Shifted symmetric functions II: expansions in multi-rectangular coordinates Valentin Féray Institut für Mathematik, Universität Zürich Séminaire Lotharingien de Combinatoire Bertinoro, Italy, Sept. 11th-12th-13th
More informationWitt vectors and total positivity
Witt vectors and total positivity James Borger Australian National University January 10, 2013 San Diego Semirings basic definitions 1. N = {0, 1, 2,... } 2. N-module = commutative monoid (written additively)
More informationTwitter: @Owen134866 www.mathsfreeresourcelibrary.com Prior Knowledge Check 1) Simplify: a) 3x 2 5x 5 b) 5x3 y 2 15x 7 2) Factorise: a) x 2 2x 24 b) 3x 2 17x + 20 15x 2 y 3 3) Use long division to calculate:
More informationBinomial Exercises A = 1 1 and 1
Lecture I. Toric ideals. Exhibit a point configuration A whose affine semigroup NA does not consist of the intersection of the lattice ZA spanned by the columns of A with the real cone generated by A.
More informationFourier Analysis. 1 Fourier basics. 1.1 Examples. 1.2 Characters form an orthonormal basis
Fourier Analysis Topics in Finite Fields (Fall 203) Rutgers University Swastik Kopparty Last modified: Friday 8 th October, 203 Fourier basics Let G be a finite abelian group. A character of G is simply
More informationHomogeneous Coordinate Ring
Students: Kaiserslautern University Algebraic Group June 14, 2013 Outline Quotients in Algebraic Geometry 1 Quotients in Algebraic Geometry 2 3 4 Outline Quotients in Algebraic Geometry 1 Quotients in
More informationSomething that can have different values at different times. A variable is usually represented by a letter in algebraic expressions.
Lesson Objectives: Students will be able to define, recognize and use the following terms in the context of polynomials: o Constant o Variable o Monomial o Binomial o Trinomial o Polynomial o Numerical
More informationEquations and Inequalities
Algebra I SOL Expanded Test Blueprint Summary Table Blue Hyperlinks link to Understanding the Standards and Essential Knowledge, Skills, and Processes Reporting Category Algebra I Standards of Learning
More informationDEPTH OF FACTORS OF SQUARE FREE MONOMIAL IDEALS
DEPTH OF FACTORS OF SQUARE FREE MONOMIAL IDEALS DORIN POPESCU Abstract. Let I be an ideal of a polynomial algebra over a field, generated by r-square free monomials of degree d. If r is bigger (or equal)
More informationIrredundant Generating Sets of Finite Nilpotent Groups. Liang Ze Wong May 2012 Advisor: Professor R. Keith Dennis
Irredundant Generating Sets of Finite Nilpotent Groups Liang Ze Wong May 2012 Advisor: Professor R. Keith Dennis May 22, 2012 Abstract It is a standard fact of linear algebra that all bases of a vector
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 information8. Limit Laws. lim(f g)(x) = lim f(x) lim g(x), (x) = lim x a f(x) g lim x a g(x)
8. Limit Laws 8.1. Basic Limit Laws. If f and g are two functions and we know the it of each of them at a given point a, then we can easily compute the it at a of their sum, difference, product, constant
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 informationPartially Ordered Sets and their Möbius Functions: Exercises Encuentro Colombiano de Combinatoria D n. = Cm1 C mk.
Partially Ordered Sets and their Möbius Functions: Exercises Encuentro Colombiano de Combinatoria 2014 Lecture I: The Möbius Inversion Theorem 1. (a) Prove that if S T in B n then [S, T ] = B T S. (b)
More informationLecture Notes Math 371: Algebra (Fall 2006) by Nathanael Leedom Ackerman
Lecture Notes Math 371: Algebra (Fall 2006) by Nathanael Leedom Ackerman October 17, 2006 TALK SLOWLY AND WRITE NEATLY!! 1 0.1 Integral Domains and Fraction Fields 0.1.1 Theorems Now what we are going
More informationChapter 7 Polynomial Functions. Factoring Review. We will talk about 3 Types: ALWAYS FACTOR OUT FIRST! Ex 2: Factor x x + 64
Chapter 7 Polynomial Functions Factoring Review We will talk about 3 Types: 1. 2. 3. ALWAYS FACTOR OUT FIRST! Ex 1: Factor x 2 + 5x + 6 Ex 2: Factor x 2 + 16x + 64 Ex 3: Factor 4x 2 + 6x 18 Ex 4: Factor
More informationCh 7 Summary - POLYNOMIAL FUNCTIONS
Ch 7 Summary - POLYNOMIAL FUNCTIONS 1. An open-top box is to be made by cutting congruent squares of side length x from the corners of a 8.5- by 11-inch sheet of cardboard and bending up the sides. a)
More informationTHE DIRECT SUM, UNION AND INTERSECTION OF POSET MATROIDS
SOOCHOW JOURNAL OF MATHEMATICS Volume 28, No. 4, pp. 347-355, October 2002 THE DIRECT SUM, UNION AND INTERSECTION OF POSET MATROIDS BY HUA MAO 1,2 AND SANYANG LIU 2 Abstract. This paper first shows how
More informationarxiv: v1 [math.ac] 27 Aug 2018
arxiv:1808.09065v1 [math.ac] 7 Aug 018 Symmetric not Complete Intersection Numerical Semigroups Generated by Six Elements Leonid G. Fel Department of Civil Engineering, Technion, Haifa 000, Israel e-mail:
More informationA Characterization of (3+1)-Free Posets
Journal of Combinatorial Theory, Series A 93, 231241 (2001) doi:10.1006jcta.2000.3075, available online at http:www.idealibrary.com on A Characterization of (3+1)-Free Posets Mark Skandera Department of
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 informationLinear, Quadratic, and Cubic Forms over the Binary Field
Linear, Quadratic, and Cubic Forms over the Binary Field Akihiro Munemasa 1 1 Graduate School of Information Sciences Tohoku University October 28, 2009 POSTECH Linear, Quadratic, and Cubic Forms over
More informationThe Perrin Conjugate and the Laguerre Orthogonal Polynomial
The Perrin Conjugate and the Laguerre Orthogonal Polynomial In a previous chapter I defined the conjugate of a cubic polynomial G(x) = x 3 - Bx Cx - D as G(x)c = x 3 + Bx Cx + D. By multiplying the polynomial
More informationRSI 2009 ABSTRACTS Anirudha Balasubramanian
RSI 2009 ABSTRACTS Anirudha Balasubramanian On the Lower Central Series Quotients of a Graded Associative Algebra Martina Balagović Let A be a noncommutative associative algebra, viewed as a Lie algebra
More informationare the q-versions of n, n! and . The falling factorial is (x) k = x(x 1)(x 2)... (x k + 1).
Lecture A jacques@ucsd.edu Notation: N, R, Z, F, C naturals, reals, integers, a field, complex numbers. p(n), S n,, b(n), s n, partition numbers, Stirling of the second ind, Bell numbers, Stirling of the
More informationDiagonal Invariants of the symmetric group and products of linear forms
Diagonal Invariants of the symmetric group and products of linear forms CRM, May 29, 2007 Emmanuel Briand. Universidad de Sevilla Products of linear forms= Decomposable forms K: algebraically closed field.
More informationINTERVAL PARTITIONS AND STANLEY DEPTH
INTERVAL PARTITIONS AND STANLEY DEPTH CSABA BIRÓ, DAVID M. HOWARD, MITCHEL T. KELLER, WILLIAM. T. TROTTER, AND STEPHEN J. YOUNG Abstract. In this paper, we answer a question posed by Herzog, Vladoiu, and
More informationLecture 3: Boolean variables and the strong Rayleigh property
Lecture 3: Boolean variables and the strong Rayleigh property Robin Pemantle University of Pennsylvania pemantle@math.upenn.edu Minerva Lectures at Columbia University 09 November, 2016 Negative dependence
More informationToric Varieties. Madeline Brandt. April 26, 2017
Toric Varieties Madeline Brandt April 26, 2017 Last week we saw that we can define normal toric varieties from the data of a fan in a lattice. Today I will review this idea, and also explain how they can
More informationNAME DATE PERIOD. Operations with Polynomials. Review Vocabulary Evaluate each expression. (Lesson 1-1) 3a 2 b 4, given a = 3, b = 2
5-1 Operations with Polynomials What You ll Learn Skim the lesson. Predict two things that you expect to learn based on the headings and the Key Concept box. 1. Active Vocabulary 2. Review Vocabulary Evaluate
More informationOutline 1. Background on Symmetric Polynomials 2. Algebraic definition of (modified) Macdonald polynomials 3. New combinatorial definition of Macdonal
Algebraic and Combinatorial Macdonald Polynomials Nick Loehr AIM Workshop on Generalized Kostka Polynomials July 2005 Reference: A Combinatorial Formula for Macdonald Polynomials" by Haglund, Haiman, and
More informationAlgebra 1 Seamless Curriculum Guide
QUALITY STANDARD #1: REAL NUMBERS AND THEIR PROPERTIES 1.1 The student will understand the properties of real numbers. o Identify the subsets of real numbers o Addition- commutative, associative, identity,
More informationTROPICAL SCHEME THEORY
TROPICAL SCHEME THEORY 5. Commutative algebra over idempotent semirings II Quotients of semirings When we work with rings, a quotient object is specified by an ideal. When dealing with semirings (and lattices),
More informationIntroduction to Number Fields David P. Roberts University of Minnesota, Morris
Introduction to Number Fields David P. Roberts University of Minnesota, Morris 1. The factpat problem 2. Polynomial discriminants 3. Global factorizations 4. Generic factorization statistics 5. Resolvents
More informationLecture 3: Tropicalizations of Cluster Algebras Examples David Speyer
Lecture 3: Tropicalizations of Cluster Algebras Examples David Speyer Let A be a cluster algebra with B-matrix B. Let X be Spec A with all of the cluster variables inverted, and embed X into a torus by
More informationOn a quasi-ordering on Boolean functions
Theoretical Computer Science 396 (2008) 71 87 www.elsevier.com/locate/tcs On a quasi-ordering on Boolean functions Miguel Couceiro a,b,, Maurice Pouzet c a Department of Mathematics and Statistics, University
More informationCore Mathematics 2 Algebra
Core Mathematics 2 Algebra Edited by: K V Kumaran Email: kvkumaran@gmail.com Core Mathematics 2 Algebra 1 Algebra and functions Simple algebraic division; use of the Factor Theorem and the Remainder Theorem.
More informationON SOME FACTORIZATION FORMULAS OF K-k-SCHUR FUNCTIONS
ON SOME FACTORIZATION FORMULAS OF K-k-SCHUR FUNCTIONS MOTOKI TAKIGIKU Abstract. We give some new formulas about factorizations of K-k-Schur functions, analogous to the k-rectangle factorization formula
More informationCombinatorics 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 informationTHE CONE OF BETTI TABLES OVER THREE NON-COLLINEAR POINTS IN THE PLANE
JOURNAL OF COMMUTATIVE ALGEBRA Volume 8, Number 4, Winter 2016 THE CONE OF BETTI TABLES OVER THREE NON-COLLINEAR POINTS IN THE PLANE IULIA GHEORGHITA AND STEVEN V SAM ABSTRACT. We describe the cone of
More informationAlbert W. Marshall. Ingram Olkin Barry. C. Arnold. Inequalities: Theory. of Majorization and Its Applications. Second Edition.
Albert W Marshall Ingram Olkin Barry C Arnold Inequalities: Theory of Majorization and Its Applications Second Edition f) Springer Contents I Theory of Majorization 1 Introduction 3 A Motivation and Basic
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 informationClimbing an Infinite Ladder
Section 5.1 Section Summary Mathematical Induction Examples of Proof by Mathematical Induction Mistaken Proofs by Mathematical Induction Guidelines for Proofs by Mathematical Induction Climbing an Infinite
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 informationThe Pythagoras numbers of projective varieties.
The Pythagoras numbers of projective varieties. Grigoriy Blekherman (Georgia Tech, USA) Rainer Sinn (FU Berlin, Germany) Gregory G. Smith (Queen s University, Canada) Mauricio Velasco (Universidad de los
More informationLesson 3 Algebraic expression: - the result obtained by applying operations (+, -,, ) to a collection of numbers and/or variables o
Lesson 3 Algebraic expression: - the result obtained by applying operations (+, -,, ) to a collection of numbers and/or variables o o ( 1)(9) 3 ( 1) 3 9 1 Evaluate the second expression at the left, if
More informationMATH 101B: ALGEBRA II PART A: HOMOLOGICAL ALGEBRA
MATH 101B: ALGEBRA II PART A: HOMOLOGICAL ALGEBRA These are notes for our first unit on the algebraic side of homological algebra. While this is the last topic (Chap XX) in the book, it makes sense to
More informationTropicalizations of Positive Parts of Cluster Algebras The conjectures of Fock and Goncharov David Speyer
Tropicalizations of Positive Parts of Cluster Algebras The conjectures of Fock and Goncharov David Speyer This talk is based on arxiv:math/0311245, section 4. We saw before that tropicalizations look like
More informationNotes on Creation Operators
Notes on Creation Operators Mike Zabrocki August 4, 2005 This set of notes will cover sort of a how to about creation operators. Because there were several references in later talks, the appendix will
More informationCHAPTER III THE PROOF OF INEQUALITIES
CHAPTER III THE PROOF OF INEQUALITIES In this Chapter, the main purpose is to prove four theorems about Hardy-Littlewood- Pólya Inequality and then gives some examples of their application. We will begin
More informationD-bounded Distance-Regular Graphs
D-bounded Distance-Regular Graphs CHIH-WEN WENG 53706 Abstract Let Γ = (X, R) denote a distance-regular graph with diameter D 3 and distance function δ. A (vertex) subgraph X is said to be weak-geodetically
More informationAlmost Cross-Intersecting and Almost Cross-Sperner Pairs offamilies of Sets
Almost Cross-Intersecting and Almost Cross-Sperner Pairs offamilies of Sets Dániel Gerbner a Nathan Lemons b Cory Palmer a Balázs Patkós a, Vajk Szécsi b a Hungarian Academy of Sciences, Alfréd Rényi Institute
More informationGALOIS GROUPS OF CUBICS AND QUARTICS (NOT IN CHARACTERISTIC 2)
GALOIS GROUPS OF CUBICS AND QUARTICS (NOT IN CHARACTERISTIC 2) KEITH CONRAD We will describe a procedure for figuring out the Galois groups of separable irreducible polynomials in degrees 3 and 4 over
More informationMATH 0960 ELEMENTARY ALGEBRA FOR COLLEGE STUDENTS (8 TH EDITION) BY ANGEL & RUNDE Course Outline
MATH 0960 ELEMENTARY ALGEBRA FOR COLLEGE STUDENTS (8 TH EDITION) BY ANGEL & RUNDE Course Outline 1. Real Numbers (33 topics) 1.3 Fractions (pg. 27: 1-75 odd) A. Simplify fractions. B. Change mixed numbers
More informationfor counting plane curves
for counting plane curves Hannah Markwig joint with Andreas Gathmann and Michael Kerber Georg-August-Universität Göttingen Barcelona, September 2008 General introduction to tropical geometry and curve-counting
More informationMath Placement Test Review Sheet Louisburg College _ Summer = c = d. 5
1. Preform indicated operations with fractions and decimals: a. 7 14 15 = b. 2 = c. 5 + 1 = d. 5 20 4 5 18 12 18 27 = 2. What is the least common denominator of fractions: 8 21 and 9 14. The fraction 9
More informationThe Rule of Three for commutation relations
The Rule of Three for commutation relations Jonah Blasiak Drexel University joint work with Sergey Fomin (University of Michigan) May 2016 Symmetric functions The ring of symmetric functions Λ(x) = Λ(x
More informationCombinatorics and geometry of E 7
Combinatorics and geometry of E 7 Steven Sam University of California, Berkeley September 19, 2012 1/24 Outline Macdonald representations Vinberg representations Root system Weyl group 7 points in P 2
More informationThe Weil bounds. 1 The Statement
The Weil bounds Topics in Finite Fields Fall 013) Rutgers University Swastik Kopparty Last modified: Thursday 16 th February, 017 1 The Statement As we suggested earlier, the original form of the Weil
More informationReview: complex numbers
October 5/6, 01.5 extra problems page 1 Review: complex numbers Number system The complex number system consists of a + bi where a and b are real numbers, with various arithmetic operations. The real numbers
More informationHandout #6 INTRODUCTION TO ALGEBRAIC STRUCTURES: Prof. Moseley AN ALGEBRAIC FIELD
Handout #6 INTRODUCTION TO ALGEBRAIC STRUCTURES: Prof. Moseley Chap. 2 AN ALGEBRAIC FIELD To introduce the notion of an abstract algebraic structure we consider (algebraic) fields. (These should not to
More informationSPECIAL POINTS AND LINES OF ALGEBRAIC SURFACES
SPECIAL POINTS AND LINES OF ALGEBRAIC SURFACES 1. Introduction As we have seen many times in this class we can encode combinatorial information about points and lines in terms of algebraic surfaces. Looking
More informationTropical Algebraic Geometry 3
Tropical Algebraic Geometry 3 1 Monomial Maps solutions of binomial systems an illustrative example 2 The Balancing Condition balancing a polyhedral fan the structure theorem 3 The Fundamental Theorem
More informationThe Goodwillie-Weiss Tower and Knot Theory - Past and Present
The Goodwillie-Weiss Tower and Knot Theory - Past and Present Dev P. Sinha University of Oregon June 24, 2014 Goodwillie Conference, Dubrovnik, Croatia New work joint with Budney, Conant and Koytcheff
More informationA short introduction to arrangements of hyperplanes
A short introduction to arrangements of hyperplanes survey Sergey Yuzvinsky University of Oregon Pisa, May 2010 Setup and notation By a hyperplane arrangement we understand the set A of several hyperplanes
More informationTransitional Algebra. Semester 1 & 2. Length of Unit. Standards: Functions
Semester 1 & 2 MP.1 MP.2 Make sense of problems and persevere in solving them. Reason abstractly and quantitatively. Length of Unit Progress Monitoring Short cycle Weekly or bi-weekly formative assessment
More informationIntroduction to Arithmetic Geometry
Introduction to Arithmetic Geometry 18.782 Andrew V. Sutherland September 5, 2013 What is arithmetic geometry? Arithmetic geometry applies the techniques of algebraic geometry to problems in number theory
More informationMULTI-ORDERED POSETS. Lisa Bishop Department of Mathematics, Occidental College, Los Angeles, CA 90041, United States.
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 7 (2007), #A06 MULTI-ORDERED POSETS Lisa Bishop Department of Mathematics, Occidental College, Los Angeles, CA 90041, United States lbishop@oxy.edu
More informationPACKING POLYNOMIALS ON SECTORS OF R 2. Caitlin Stanton Department of Mathematics, Stanford University, California
#A67 INTEGERS 14 (014) PACKING POLYNOMIALS ON SECTORS OF R Caitlin Stanton Department of Mathematics, Stanford University, California ckstanton@stanford.edu Received: 10/7/13, Revised: 6/5/14, Accepted:
More informationDefinition For a set F, a polynomial over F with variable x is of the form
*6. Polynomials Definition For a set F, a polynomial over F with variable x is of the form a n x n + a n 1 x n 1 + a n 2 x n 2 +... + a 1 x + a 0, where a n, a n 1,..., a 1, a 0 F. The a i, 0 i n are the
More informationEuler characteristic of the truncated order complex of generalized noncrossing partitions
Euler characteristic of the truncated order complex of generalized noncrossing partitions D. Armstrong and C. Krattenthaler Department of Mathematics, University of Miami, Coral Gables, Florida 33146,
More informationarxiv: v1 [math.co] 23 Sep 2014
Conjugacy and Iteration of Standard Interval Rank in Finite Ordered Sets Cliff Joslyn, Emilie Hogan, and Alex Pogel arxiv:1409.6684v1 [math.co] 23 Sep 2014 Abstract In order theory, a rank function measures
More informationArtin-Schelter regular algebras and the Steenrod algebra
Artin-Schelter regular algebras and the Steenrod algebra J. H. Palmieri and J. J. Zhang University of Washington Los Angeles, 10 October 2010 Exercise Let A(1) be the sub-hopf algebra of the mod 2 Steenrod
More informationK. Johnson Department of Mathematics, Dalhousie University, Halifax, Nova Scotia, Canada D. Patterson
#A21 INTEGERS 11 (2011) PROJECTIVE P -ORDERINGS AND HOMOGENEOUS INTEGER-VALUED POLYNOMIALS K. Johnson Department of Mathematics, Dalhousie University, Halifax, Nova Scotia, Canada johnson@mathstat.dal.ca
More information8 Appendix: Polynomial Rings
8 Appendix: Polynomial Rings Throughout we suppose, unless otherwise specified, that R is a commutative ring. 8.1 (Largely) a reminder about polynomials A polynomial in the indeterminate X with coefficients
More informationHOMOLOGY THEORIES INGRID STARKEY
HOMOLOGY THEORIES INGRID STARKEY Abstract. This paper will introduce the notion of homology for topological spaces and discuss its intuitive meaning. It will also describe a general method that is used
More informationSEQUENCES, MATHEMATICAL INDUCTION, AND RECURSION
CHAPTER 5 SEQUENCES, MATHEMATICAL INDUCTION, AND RECURSION Copyright Cengage Learning. All rights reserved. SECTION 5.4 Strong Mathematical Induction and the Well-Ordering Principle for the Integers Copyright
More informationTropical Geometry Homework 3
Tropical Geometry Homework 3 Melody Chan University of California, Berkeley mtchan@math.berkeley.edu February 9, 2009 The paper arxiv:07083847 by M. Vigeland answers this question. In Theorem 7., the author
More informationSymmetric polynomials and symmetric mean inequalities
Symmetric polynomials and symmetric mean inequalities Karl Mahlburg Department of Mathematics Louisiana State University Baton Rouge, LA 70803, U.S.A. mahlburg@math.lsu.edu Clifford Smyth Department of
More informationExercise Sheet 3 - Solutions
Algebraic Geometry D-MATH, FS 2016 Prof. Pandharipande Exercise Sheet 3 - Solutions 1. Prove the following basic facts about algebraic maps. a) For f : X Y and g : Y Z algebraic morphisms of quasi-projective
More informationA Short Overview of Orthogonal Arrays
A Short Overview of Orthogonal Arrays John Stufken Department of Statistics University of Georgia Isaac Newton Institute September 5, 2011 John Stufken (University of Georgia) Orthogonal Arrays September
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 informationVector fields and phase flows in the plane. Geometric and algebraic properties of linear systems. Existence, uniqueness, and continuity
Math Courses Approved for MSME (2015/16) Mth 511 - Introduction to Real Analysis I (3) elements of functional analysis. This is the first course in a sequence of three: Mth 511, Mth 512 and Mth 513 which
More information1. Group Theory Permutations.
1.1. Permutations. 1. Group Theory Problem 1.1. Let G be a subgroup of S n of index 2. Show that G = A n. Problem 1.2. Find two elements of S 7 that have the same order but are not conjugate. Let π S 7
More informationLecture 7: Polynomial rings
Lecture 7: Polynomial rings Rajat Mittal IIT Kanpur You have seen polynomials many a times till now. The purpose of this lecture is to give a formal treatment to constructing polynomials and the rules
More informationK3 Surfaces and Lattice Theory
K3 Surfaces and Lattice Theory Ichiro Shimada Hiroshima University 2014 Aug Singapore 1 / 26 Example Consider two surfaces S + and S in C 3 defined by w 2 (G(x, y) ± 5 H(x, y)) = 1, where G(x, y) := 9
More informationInteger Partitions. Student ID: Tutor: Roman Kotecky\Neil O Connell April 22, 2015
Integer Partitions Student ID: 35929 Tutor: Roman Kotecky\Neil O Connell April 22, 205 My study of Integer partitions came from a particular algebra assignment in which we were asked to find all the isomorphism
More informationCombinatorial Commutative Algebra, Graph Colorability, and Algorithms
I G,k = g 1,...,g n Combinatorial Commutative Algebra, Graph Colorability, and Algorithms Chris Hillar (University of California, Berkeley) Joint with Troels Windfeldt! (University of Copenhagen)! Outline
More informationZaslavsky s Theorem. As presented by Eric Samansky May 11, 2002
Zaslavsky s Theorem As presented by Eric Samansky May, 2002 Abstract This paper is a retelling of the proof of Zaslavsky s Theorem. For any arrangement of hyperplanes, there is a corresponding semi-lattice
More informationcorrelated to the Utah 2007 Secondary Math Core Curriculum Algebra 1
correlated to the Utah 2007 Secondary Math Core Curriculum Algebra 1 McDougal Littell Algebra 1 2007 correlated to the Utah 2007 Secondary Math Core Curriculum Algebra 1 The main goal of Algebra is to
More informationClassification of root systems
Classification of root systems September 8, 2017 1 Introduction These notes are an approximate outline of some of the material to be covered on Thursday, April 9; Tuesday, April 14; and Thursday, April
More informationMaximizing the descent statistic
Maximizing the descent statistic Richard EHRENBORG and Swapneel MAHAJAN Abstract For a subset S, let the descent statistic β(s) be the number of permutations that have descent set S. We study inequalities
More informationAlgebraic Number Theory
TIFR VSRP Programme Project Report Algebraic Number Theory Milind Hegde Under the guidance of Prof. Sandeep Varma July 4, 2015 A C K N O W L E D G M E N T S I would like to express my thanks to TIFR for
More informationAlgebraically defined graphs and generalized quadrangles
Department of Mathematics Kutztown University of Pennsylvania Combinatorics and Computer Algebra 2015 July 22, 2015 Cages and the Moore bound For given positive integers k and g, find the minimum number
More information