Permanent vs. Determinant

Size: px
Start display at page:

Download "Permanent vs. Determinant"

Transcription

1 Permanent vs. Determinant Frank Ban Introuction A major problem in theoretical computer science is the Permanent vs. Determinant problem. It asks: given an n by n matrix of ineterminates A = (a i,j ) an an m by m matrix B with entries that are affine linear functions of the entries of A, what is the smallest m such that the eterminant of B equals the permanent of A? In other wors, what is the complexity of writing the permanent in terms of the eterminant? At first, one might believe that there shoul not be much ifference because the two functions et A = n sgn(σ) σ S n an perma = σ S n i= a i,σ(i) n a i,σ(i) appear to be very similar. However it is conjecture that m > poly(n) asymptotically. It is strongly believe that this conjecture is true because its falsity woul imply P = NP. [] The best lower boun for the eterminantal complexity of perm n was obtaine by stuying the Hessian matrices of perm n an et m. In this paper, we will let T p (2) (x i,j ) i,j n enote the n 2 by n 2 matrix with the entry in row i, j an column k, l equal to i= 2 x i,j x k,l perm n (x i,j ) an we will let T (2) (x i,j) i,j n enote the corresponing matrix for et n.

2 2 Lower Boun Although the conjecture is that the permanent woul have super polynomial eterminantal complexity, the best lower boun attaine so far is merely quaratic. This boun is ue to Mignon an Ressayre. [2] Theorem 2. The eterminantal complexity of perm n is at least n 2 /2. The proof of their result epens on the existence of an n by n matrix C with perm n (C) equal to 0 an T p (2) (C) having full rank. We will assume that n 3 since the case of n = 2 is trivial. Lemma 2.2 Let n 3. Let C be an n by n matrix with C, = n + an C i,j = for (i, j) (, ). Then perm n (C) = 0 an rank(t (2) p (C)) = n 2. Proof By oing a Laplace expansion along the first row of C we get perm n (C) = (n )P n + (n )P n = 0, where P k is the permanent of the k by k matrix with all entries equal to. Note that P k is equal to k!. We claim that 2 x i,j x k,l perm n (C) = { (n 2)! if {i, j, k, l} 2(n 3)! otherwise Inee, ifferentiating perm n with respect to x i,j an x k,l is equivalent to eleting rows i an k an columns j an l an taking the eterminant of the remaining sub matrix. If {i, j, k, l}, then the remaining sub matrix is P n 2. Otherwise, the remaining sub matrix is the n 2 by n 2 matrix with upper left entry equal to n an all other entries equal to. Therefore, we can say 0 B B B B 0 C C T p (2) (C) = (n 3)! B C C B C C 0 where B = (n 2)

3 an 0 n 2 n 2 n 2 n C = n n To show that T p (2) (C) has full rank, we show that it has a trivial kernel. Since B = (n 2)(J n I n ), then B only has eigenvalues 2 n an (n )(n 2) so it has full rank. Now let Cv = 0. By looking at the bottom two rows of C we have (n 2)v 2v 2 2v n 2 2v n = 0 an (n 2)v 2v 2 2v n = 0. This implies v n = v n. By a similar argument, v a = v b for all 2 a, b n. By consiering the first row of C, this implies that v 2 = v 3 = = v n = 0. It follows that v = 0an v = 0. Therefore, both B an C have full rank. x x 2 Now let x =. where each x i is a vector in R n. Arguing similarly x n as we i for the matrix C we can show that T p (2) (C) has full rank by first observing that C( x a x b ) = 0 for all 2 a, b n. Since C has full rank, then x a = x b for all 2 a, b n. Thus x 2 = x n. By consiering the first row of T p (2) (C) we see that x a = 0 for all 2 a n because B has full rank. It follows that x = 0 as well giving the esire result. We now present the proof of Mignon an Ressayre s lower boun using the matrix C from Lemma 2.2. Proof (of Theorem 2.) Let m be the eterminantal complexity of perm n. Then there exists a family of affine linear functions A k,l, for k, l m in the variables x i,j for i, j n, with perm n (x i,j ) = et m (A k,l (x i,j ) i,j n ). We can perform a translation on the coorinates x i,j. By this we mean, there exist homogeneous linear functions L k,l an a matrix of constants Y such that (A k,l (x i,j )) k,l = (L k,l (x i,j C i,j )) + Y. Thus perm n (x i,j ) = et m ((L k,l (x i,j C i,j )) + Y ) (2.) Wolog, we can [ apply ] a series of row an column operations to Y to put 0 0 it in the form. Since perm(c) is 0, then by equation (2.), Y has 0 I s 3

4 eterminant 0 an so oes not have full rank. Thus s < m. Encoe the row operations in a matrix P an the column operations in [ a matrix Q. Note ] etp 0 that if we left multiply the above eterminantal matrix by P [ ] 0 I m etq 0 an right multiply by Q then we o not change the value of 0 I m the eterminant. Since [ ] [ ] [ ] etp 0 etq P Y Q = 0 I m 0 I m 0 I s [ ] 0 0 then wolog we can just let Y = in equation (2.). 0 I s By the multivariate chain rule, there exists an m 2 by n 2 matrix L such that T (2) p (x i,j ) = L T (T (2) (L k,l(x i,j C i,j ) + Y ) k,l )L The matrix L has its (k, l, i, j) entry given by x i,j L k,l (x i,j C i,j ). Therefore T p (2) (C) = L T T (2) (Y )L Thus, rank(t p (2) (C)) rank(t (2) (2) (Y )). By Lemma 2.2, rank(t p (C)) = n 2. Therefore it suffices to show that rank(t (2) (Y )) 2m. To see this, first consier the case when s = m. Note that 2 x i,j x k,l et m Y is non-zero if an only if one of the following hols:. (i, j) = (, ) an (k, l) = (t, t) for some t > 2. (i, j) = (, t) an (k, l) = (t, ) for some t > 3. (i, j) = (t, ) an (k, l) = (, t) for some t > 4. (i, j) = (t, t) an (k, l) = (, ) for some t > The above four conitions tell us that T (2) (Y ) has 3m 2 nonzero rows ( row for conition an m rows each for conitions 2, 3, an 4). Each of the m rows satisfying conition 4 are all copies of the same row with a in column (, ) an zeroes in every other column. 4

5 The 2m 2 rows satisfying conitions 2 an 3 have only a single nonzero entry (of value ) an each row contains a in a ifferent column. The row satisfying conition contains m nonzero entries. These nonzero entries are in columns that are not in the support of the rows satisfying conitions 2, 3, or 4. Thus, there are exactly 2m linearly inepenent rows in T (2) (Y ). Now consier the case when s = m 2. Note that 2 x i,j x k,l et m Y is non-zero if an only if i, j, k, l {, 2}. Then the number of non-zero entries in T (2) (Y ) is at most 4 which is certainly less than 2m as n grows. If s < m 2, then every entry of T (2) (Y ) is 0 so we are one. 3 Upper Bouns There is a combinatorial interpretation for perm n. Let G be a igraph on n vertices labelle {, 2,..., n} an let (x i,j ) i,j n be the weighte ajacency matrix for G. Then perm(x i,j ) is equal to the number of weighte irecte cycle covers of G. This is because perm(x i,j ) = x i,σ(i) σ S n i= an each cycle cover of G can be encoe as a permutation σ S n with σ(i) ientifying the irecte ege (i, σ(i)) in G. The eterminant can be interprete similarly, but each cycle cover woul be weighte by the sign of the permutation that it correspons to. Thus, if every cycle cover of a graph correspone to a permutation with even sign, then the permanent an the eterminant woul share this combinatorial interpretation. Using this iea, Grenet was able to provie an upper boun for the eterminantal complexity of the permanent. [3] Theorem 3. There exists a 2 n by 2 n matrix M with all entries of the form -, 0,, or x i,j such that et M = perm n (x i,j ). Proof Let G be a graph where the vertices are in bijection with subsets of {, 2,..., n} but the vertices corresponing to an the whole set {, 2,..., n} are ientifie as the same vertex v 0. It follows that G has 2 n vertices. 5 n

6 Suppose vertices v, w correspon to S, T {, 2,..., n} respectively. We will put a irecte ege with weight x i,j (with i, j n) between vertices v an w if an only if S = i +, T = i + 2, an T \ S = {j}. The vertex v 0 will have outgoing eges labelle x n,j an incoming eges labelle x i,n. Now put loops with weight on every vertex except v 0 to complete the ege set of G. Note that every non-loop cycle in G has the form x,σ(), x 2,σ(2),..., x n,σ(n) since each cycle can be seen as the number of ways to a elements to the empty set until you have the set {, 2,..., n}. Since every vertex except v 0 contains a loop, then all cycle covers of G consist of non-loop cycles containing v 0 an loops. Thus, every cycle cover of G correspons to an n-cycle. Note that the sign of an n-cycle is ( ) n. Let M be the ajacency matrix of G. It follows that the eterminant of M equals ( ) n σ S n x,σ() x 2,σ(2) x n,σ(n) which is equal to ±perm n (x i,j ). If et M = perm(x i,j ), then multiply the first row of M by - to get et M = perm(x i,j ). Figure shows the graph obtaine from the proof of Theorem 3. in the case when n = 3. It is unerstoo that the noes labelle an [3] = {, 2, 3} are ientifie together an S refers to the complement of S in [3]. 4 Glynn s Formula We can consier alternative methos of rewriting the permanent besies expressing it as a eterminant. Ryser was able to use inclusion-exclusion to write perm n as a sum of 2 n terms rather than a sum of n! terms. Glynn was able to provie another exponential expression for perm n, but he was able to write the polynomial as a sum of 2 n terms. [4] Theorem 4. We can write 2 n perm n = δ ( n ) n n δ i δ i x i,j k= j= i= where the outer sum is over all 2 n vectors δ {, } n with δ =. 6

7 x 0, x0,2 x 0,3 {} {2} {3} x,3 x,3 x,2 x,2 x, x, {} {2} {3} x 2, x 2,2 x 2,3 [3] Figure : n = 3 Proof Consier a monomial m in the x i,j variables on the RHS of our propose equality. Let λ i be the egree of m in the variables x i,j for fixe i an varying j. Let the coefficient of m be c. We have c = δ n i= δ λ i+ i = n i=2 δ i {,} (δ i ) λ i+ Thus c = 0 unless λ i is o for all i. Note that m has total egree n. Thus n = n i= λ i. Since λ =, then n = n i=2 λ i an if λ i is o for all i, then we must have λ i = for all i. Thus, the only such monomials m with non-zero coefficient woul have coefficient 2 n. These monomials woul have the form n i= x i,σ(i) where 7

8 σ S n. It follows that the RHS of our propose equality is equal to which is exactly 2 n perm n. σ S n 2 n n i= x i,σ(i) 5 Fano Schemes The Fano scheme of a space X, enote F k (X), parameterizes k-imensional planes that lie on X. Let D n an P n enote the space in P n2 cut out by the n by n eterminant an permanent respectively. Work by Chan an Ilten specifically stuies the Fano schemes of the n by n eterminant, F k (D n ), an the n by n permanent, F k (P n ). [5] It turns out the geometry of these schemes gives us information about the algebra of permanents. Lemma 5. It is impossible to write perm 3 as l q + l 2 q 2 where l, l 2 are linear forms in the variables x i,j an q, q 2 are quaratic forms in x i,j. Proof Suppose that perm 3 = l q + l 2 q 2. Then the space Y cut out by l an l 2 lies in the space cut out by perm 3. Since Y P 8 is cut out by two linear forms then it has coimension 2 which makes it a 6-imensional space. However, accoring to Table 2 in [5] the Fano scheme F k (P 3 ) is non-empty if an only if k 5. The result follows by contraiction. 6 The case of n = 3 a b c For this section we will let perm 3 be the permanent of e f. g h i Grenet s work gives a 7 by 7 matrix whose eterminant equals the 3 by 3 permanent. 8

9 0 a g i f 0 a b c c i perm e f = et c 0 f g h i e h b In conjunction with Theorem 2. an Theorem 3., we see that the eterminantal complexity of perm 3 is 5, 6, or 7. It remains an open question to etermine exactly which of the three numbers is the true eterminantal complexity. Another way of expressing of the permanent vs. eterminant problem is by saying that we want to fin matrices C, A,, A,2,..., A 3,3 M(m) such that M = C + x, A, + x,2 A,2 + + x 3,3 A 3,3 an perm n = et(m) with m minimal. We can state a technical result that puts restrictions on the eterminantal representation of perm 3. Lemma 6. Let n = 3. If m = 6, then the rank of C is 5. If m = 5, then the rank of C is 4. Proof We will prove only the case when m = 6. The case when m = 5 is similar. Note that by applying certain elementary row an column operations to M we o not change the value of its eterminant. Row operations can be encoe as left multiplication by a matrix an column operations can be encoe as right multiplication by a matrix. Suppose C has rank less than 3. Note that we can left multiply M by P an right multiply M by Q such that P CQ = Diag(,, 0, 0, 0, 0). Then et M = et P MQ. Since P MQ is a matrix with two entries of the form + l (where l is a linear form in the variables (x i,j )) an every other entry is a linear form in (x i,j ), then every term in the polynomial et P MQ has egree at least 4. Thus we cannot have perm 3 = et M. If C has rank exactly 3, then let P an Q be such that P CQ = Diag(,,, 0, 0, 0). It follows that the egree 3 part of et M = et P MQ is equal to et M where M is the lower-right 3x3 sub matrix of P MQ. This implies that 9

10 perm 3 can be written as the eterminant of a 3 by 3 matrix which is false because c(3) 5. Now suppose that C has rank equal to 4. Let P an Q be such that P CQ = Diag(,,,, 0, 0). The egree 2 part of et P MQ is equal to et M where M is the lower 2x2 sub matrix of P MQ. Thus et M = 0. [ We can ] apply further row operations to M to transform it into the form α β where α an β are linear forms in the variables a, b, c,, e, f, g, h, i. 0 0 We can exten these row operations to P MQ so that wolog + c c 2 c 3 e f c c 5 c 6 e 2 f 2 P MQ = c 7 c c 9 e 3 f 3 c 0 c c e 4 f 4 g g 2 g 3 g 4 α β h h 2 h 3 h where the inexe variables are linear forms in a, b, c,, e, f, g, h, i. The egree 3 part of et P MQ must be equal to perm 3. This gives us perm 3 = α(f h + f 2 h 2 + f 3 h 3 + f 4 h 4 ) + β(e h + e 2 h 2 + e 3 h 3 + e 4 h 4 ) which contraicts Lemma 5.. Finally suppose that C has full rank. Let P an Q be such that P CQ = I. Then et M = et P MQ woul contain a constant term so we coul not have et M = perm 3. The result follows. Glynn s formula (Theorem 4.) allows us to write perm 3 as (a + + g)(b + e + h)(c + f + i) (a + g)(b e + h)(c f + i) (a + g)(b + e h)(c + f i) + (a g)(b e h)(c f i) Another approach to etermining the eterminantal complexity of perm 3 might involve stuying Glynn s formula, since he is able to express the permanent as a sum of 4 proucts of 3 linear terms rather than a sum of 6 proucts of 3 linear terms. References [] M. Agrawal: Determinant versus permanent (2006) 0

11 [2] T. Mignon, N. Ressayre: A Quaratic Boun for the Determinant an Permanent Problem (2004) [3] B. Grenet: An Upper Boun for the Permanent versus Determinant Problem (202) [4] D. Glynn: The permanent of a square matrix (2009) [5] M. Chan, N. Ilten: Fano Schemes of Determinants an Permanents (203)

u!i = a T u = 0. Then S satisfies

u!i = a T u = 0. Then S satisfies Deterministic Conitions for Subspace Ientifiability from Incomplete Sampling Daniel L Pimentel-Alarcón, Nigel Boston, Robert D Nowak University of Wisconsin-Maison Abstract Consier an r-imensional subspace

More information

Euler equations for multiple integrals

Euler equations for multiple integrals Euler equations for multiple integrals January 22, 2013 Contents 1 Reminer of multivariable calculus 2 1.1 Vector ifferentiation......................... 2 1.2 Matrix ifferentiation........................

More information

Math Notes on differentials, the Chain Rule, gradients, directional derivative, and normal vectors

Math Notes on differentials, the Chain Rule, gradients, directional derivative, and normal vectors Math 18.02 Notes on ifferentials, the Chain Rule, graients, irectional erivative, an normal vectors Tangent plane an linear approximation We efine the partial erivatives of f( xy, ) as follows: f f( x+

More information

Unit #6 - Families of Functions, Taylor Polynomials, l Hopital s Rule

Unit #6 - Families of Functions, Taylor Polynomials, l Hopital s Rule Unit # - Families of Functions, Taylor Polynomials, l Hopital s Rule Some problems an solutions selecte or aapte from Hughes-Hallett Calculus. Critical Points. Consier the function f) = 54 +. b) a) Fin

More information

Diagonalization of Matrices Dr. E. Jacobs

Diagonalization of Matrices Dr. E. Jacobs Diagonalization of Matrices Dr. E. Jacobs One of the very interesting lessons in this course is how certain algebraic techniques can be use to solve ifferential equations. The purpose of these notes is

More information

Computing Exact Confidence Coefficients of Simultaneous Confidence Intervals for Multinomial Proportions and their Functions

Computing Exact Confidence Coefficients of Simultaneous Confidence Intervals for Multinomial Proportions and their Functions Working Paper 2013:5 Department of Statistics Computing Exact Confience Coefficients of Simultaneous Confience Intervals for Multinomial Proportions an their Functions Shaobo Jin Working Paper 2013:5

More information

Combinatorica 9(1)(1989) A New Lower Bound for Snake-in-the-Box Codes. Jerzy Wojciechowski. AMS subject classification 1980: 05 C 35, 94 B 25

Combinatorica 9(1)(1989) A New Lower Bound for Snake-in-the-Box Codes. Jerzy Wojciechowski. AMS subject classification 1980: 05 C 35, 94 B 25 Combinatorica 9(1)(1989)91 99 A New Lower Boun for Snake-in-the-Box Coes Jerzy Wojciechowski Department of Pure Mathematics an Mathematical Statistics, University of Cambrige, 16 Mill Lane, Cambrige, CB2

More information

Lecture 5. Symmetric Shearer s Lemma

Lecture 5. Symmetric Shearer s Lemma Stanfor University Spring 208 Math 233: Non-constructive methos in combinatorics Instructor: Jan Vonrák Lecture ate: January 23, 208 Original scribe: Erik Bates Lecture 5 Symmetric Shearer s Lemma Here

More information

Approximate Constraint Satisfaction Requires Large LP Relaxations

Approximate Constraint Satisfaction Requires Large LP Relaxations Approximate Constraint Satisfaction Requires Large LP Relaxations oah Fleming April 19, 2018 Linear programming is a very powerful tool for attacking optimization problems. Techniques such as the ellipsoi

More information

19 Eigenvalues, Eigenvectors, Ordinary Differential Equations, and Control

19 Eigenvalues, Eigenvectors, Ordinary Differential Equations, and Control 19 Eigenvalues, Eigenvectors, Orinary Differential Equations, an Control This section introuces eigenvalues an eigenvectors of a matrix, an iscusses the role of the eigenvalues in etermining the behavior

More information

Linear and quadratic approximation

Linear and quadratic approximation Linear an quaratic approximation November 11, 2013 Definition: Suppose f is a function that is ifferentiable on an interval I containing the point a. The linear approximation to f at a is the linear function

More information

On colour-blind distinguishing colour pallets in regular graphs

On colour-blind distinguishing colour pallets in regular graphs J Comb Optim (2014 28:348 357 DOI 10.1007/s10878-012-9556-x On colour-blin istinguishing colour pallets in regular graphs Jakub Przybyło Publishe online: 25 October 2012 The Author(s 2012. This article

More information

Acute sets in Euclidean spaces

Acute sets in Euclidean spaces Acute sets in Eucliean spaces Viktor Harangi April, 011 Abstract A finite set H in R is calle an acute set if any angle etermine by three points of H is acute. We examine the maximal carinality α() of

More information

Lectures - Week 10 Introduction to Ordinary Differential Equations (ODES) First Order Linear ODEs

Lectures - Week 10 Introduction to Ordinary Differential Equations (ODES) First Order Linear ODEs Lectures - Week 10 Introuction to Orinary Differential Equations (ODES) First Orer Linear ODEs When stuying ODEs we are consiering functions of one inepenent variable, e.g., f(x), where x is the inepenent

More information

Lower Bounds for the Smoothed Number of Pareto optimal Solutions

Lower Bounds for the Smoothed Number of Pareto optimal Solutions Lower Bouns for the Smoothe Number of Pareto optimal Solutions Tobias Brunsch an Heiko Röglin Department of Computer Science, University of Bonn, Germany brunsch@cs.uni-bonn.e, heiko@roeglin.org Abstract.

More information

Discrete Mathematics

Discrete Mathematics Discrete Mathematics 309 (009) 86 869 Contents lists available at ScienceDirect Discrete Mathematics journal homepage: wwwelseviercom/locate/isc Profile vectors in the lattice of subspaces Dániel Gerbner

More information

3.7 Implicit Differentiation -- A Brief Introduction -- Student Notes

3.7 Implicit Differentiation -- A Brief Introduction -- Student Notes Fin these erivatives of these functions: y.7 Implicit Differentiation -- A Brief Introuction -- Stuent Notes tan y sin tan = sin y e = e = Write the inverses of these functions: y tan y sin How woul we

More information

Ramsey numbers of some bipartite graphs versus complete graphs

Ramsey numbers of some bipartite graphs versus complete graphs Ramsey numbers of some bipartite graphs versus complete graphs Tao Jiang, Michael Salerno Miami University, Oxfor, OH 45056, USA Abstract. The Ramsey number r(h, K n ) is the smallest positive integer

More information

The derivative of a function f(x) is another function, defined in terms of a limiting expression: f(x + δx) f(x)

The derivative of a function f(x) is another function, defined in terms of a limiting expression: f(x + δx) f(x) Y. D. Chong (2016) MH2801: Complex Methos for the Sciences 1. Derivatives The erivative of a function f(x) is another function, efine in terms of a limiting expression: f (x) f (x) lim x δx 0 f(x + δx)

More information

Lecture 22. Lecturer: Michel X. Goemans Scribe: Alantha Newman (2004), Ankur Moitra (2009)

Lecture 22. Lecturer: Michel X. Goemans Scribe: Alantha Newman (2004), Ankur Moitra (2009) 8.438 Avance Combinatorial Optimization Lecture Lecturer: Michel X. Goemans Scribe: Alantha Newman (004), Ankur Moitra (009) MultiFlows an Disjoint Paths Here we will survey a number of variants of isjoint

More information

Applications of the Wronskian to ordinary linear differential equations

Applications of the Wronskian to ordinary linear differential equations Physics 116C Fall 2011 Applications of the Wronskian to orinary linear ifferential equations Consier a of n continuous functions y i (x) [i = 1,2,3,...,n], each of which is ifferentiable at least n times.

More information

Linear First-Order Equations

Linear First-Order Equations 5 Linear First-Orer Equations Linear first-orer ifferential equations make up another important class of ifferential equations that commonly arise in applications an are relatively easy to solve (in theory)

More information

Mathematical Review Problems

Mathematical Review Problems Fall 6 Louis Scuiero Mathematical Review Problems I. Polynomial Equations an Graphs (Barrante--Chap. ). First egree equation an graph y f() x mx b where m is the slope of the line an b is the line's intercept

More information

Witt#5: Around the integrality criterion 9.93 [version 1.1 (21 April 2013), not completed, not proofread]

Witt#5: Around the integrality criterion 9.93 [version 1.1 (21 April 2013), not completed, not proofread] Witt vectors. Part 1 Michiel Hazewinkel Sienotes by Darij Grinberg Witt#5: Aroun the integrality criterion 9.93 [version 1.1 21 April 2013, not complete, not proofrea In [1, section 9.93, Hazewinkel states

More information

Robustness and Perturbations of Minimal Bases

Robustness and Perturbations of Minimal Bases Robustness an Perturbations of Minimal Bases Paul Van Dooren an Froilán M Dopico December 9, 2016 Abstract Polynomial minimal bases of rational vector subspaces are a classical concept that plays an important

More information

Math 1271 Solutions for Fall 2005 Final Exam

Math 1271 Solutions for Fall 2005 Final Exam Math 7 Solutions for Fall 5 Final Eam ) Since the equation + y = e y cannot be rearrange algebraically in orer to write y as an eplicit function of, we must instea ifferentiate this relation implicitly

More information

TOEPLITZ AND POSITIVE SEMIDEFINITE COMPLETION PROBLEM FOR CYCLE GRAPH

TOEPLITZ AND POSITIVE SEMIDEFINITE COMPLETION PROBLEM FOR CYCLE GRAPH English NUMERICAL MATHEMATICS Vol14, No1 Series A Journal of Chinese Universities Feb 2005 TOEPLITZ AND POSITIVE SEMIDEFINITE COMPLETION PROBLEM FOR CYCLE GRAPH He Ming( Λ) Michael K Ng(Ξ ) Abstract We

More information

Final Exam Study Guide and Practice Problems Solutions

Final Exam Study Guide and Practice Problems Solutions Final Exam Stuy Guie an Practice Problems Solutions Note: These problems are just some of the types of problems that might appear on the exam. However, to fully prepare for the exam, in aition to making

More information

Rank, Trace, Determinant, Transpose an Inverse of a Matrix Let A be an n n square matrix: A = a11 a1 a1n a1 a an a n1 a n a nn nn where is the jth col

Rank, Trace, Determinant, Transpose an Inverse of a Matrix Let A be an n n square matrix: A = a11 a1 a1n a1 a an a n1 a n a nn nn where is the jth col Review of Linear Algebra { E18 Hanout Vectors an Their Inner Proucts Let X an Y be two vectors: an Their inner prouct is ene as X =[x1; ;x n ] T Y =[y1; ;y n ] T (X; Y ) = X T Y = x k y k k=1 where T an

More information

Math 342 Partial Differential Equations «Viktor Grigoryan

Math 342 Partial Differential Equations «Viktor Grigoryan Math 342 Partial Differential Equations «Viktor Grigoryan 6 Wave equation: solution In this lecture we will solve the wave equation on the entire real line x R. This correspons to a string of infinite

More information

CHAPTER 1 : DIFFERENTIABLE MANIFOLDS. 1.1 The definition of a differentiable manifold

CHAPTER 1 : DIFFERENTIABLE MANIFOLDS. 1.1 The definition of a differentiable manifold CHAPTER 1 : DIFFERENTIABLE MANIFOLDS 1.1 The efinition of a ifferentiable manifol Let M be a topological space. This means that we have a family Ω of open sets efine on M. These satisfy (1), M Ω (2) the

More information

Unit vectors with non-negative inner products

Unit vectors with non-negative inner products Unit vectors with non-negative inner proucts Bos, A.; Seiel, J.J. Publishe: 01/01/1980 Document Version Publisher s PDF, also known as Version of Recor (inclues final page, issue an volume numbers) Please

More information

Calculus and optimization

Calculus and optimization Calculus an optimization These notes essentially correspon to mathematical appenix 2 in the text. 1 Functions of a single variable Now that we have e ne functions we turn our attention to calculus. A function

More information

Witten s Proof of Morse Inequalities

Witten s Proof of Morse Inequalities Witten s Proof of Morse Inequalities by Igor Prokhorenkov Let M be a smooth, compact, oriente manifol with imension n. A Morse function is a smooth function f : M R such that all of its critical points

More information

Make graph of g by adding c to the y-values. on the graph of f by c. multiplying the y-values. even-degree polynomial. graph goes up on both sides

Make graph of g by adding c to the y-values. on the graph of f by c. multiplying the y-values. even-degree polynomial. graph goes up on both sides Reference 1: Transformations of Graphs an En Behavior of Polynomial Graphs Transformations of graphs aitive constant constant on the outsie g(x) = + c Make graph of g by aing c to the y-values on the graph

More information

ALGEBRAIC AND ANALYTIC PROPERTIES OF ARITHMETIC FUNCTIONS

ALGEBRAIC AND ANALYTIC PROPERTIES OF ARITHMETIC FUNCTIONS ALGEBRAIC AND ANALYTIC PROPERTIES OF ARITHMETIC FUNCTIONS MARK SCHACHNER Abstract. When consiere as an algebraic space, the set of arithmetic functions equippe with the operations of pointwise aition an

More information

SYSTEMS OF DIFFERENTIAL EQUATIONS, EULER S FORMULA. where L is some constant, usually called the Lipschitz constant. An example is

SYSTEMS OF DIFFERENTIAL EQUATIONS, EULER S FORMULA. where L is some constant, usually called the Lipschitz constant. An example is SYSTEMS OF DIFFERENTIAL EQUATIONS, EULER S FORMULA. Uniqueness for solutions of ifferential equations. We consier the system of ifferential equations given by x = v( x), () t with a given initial conition

More information

θ x = f ( x,t) could be written as

θ x = f ( x,t) could be written as 9. Higher orer PDEs as systems of first-orer PDEs. Hyperbolic systems. For PDEs, as for ODEs, we may reuce the orer by efining new epenent variables. For example, in the case of the wave equation, (1)

More information

Robust Forward Algorithms via PAC-Bayes and Laplace Distributions. ω Q. Pr (y(ω x) < 0) = Pr A k

Robust Forward Algorithms via PAC-Bayes and Laplace Distributions. ω Q. Pr (y(ω x) < 0) = Pr A k A Proof of Lemma 2 B Proof of Lemma 3 Proof: Since the support of LL istributions is R, two such istributions are equivalent absolutely continuous with respect to each other an the ivergence is well-efine

More information

7. Localization. (d 1, m 1 ) (d 2, m 2 ) d 3 D : d 3 d 1 m 2 = d 3 d 2 m 1. (ii) If (d 1, m 1 ) (d 1, m 1 ) and (d 2, m 2 ) (d 2, m 2 ) then

7. Localization. (d 1, m 1 ) (d 2, m 2 ) d 3 D : d 3 d 1 m 2 = d 3 d 2 m 1. (ii) If (d 1, m 1 ) (d 1, m 1 ) and (d 2, m 2 ) (d 2, m 2 ) then 7. Localization To prove Theorem 6.1 it becomes necessary to be able to a enominators to rings (an to moules), even when the rings have zero-ivisors. It is a tool use all the time in commutative algebra,

More information

Integration Review. May 11, 2013

Integration Review. May 11, 2013 Integration Review May 11, 2013 Goals: Review the funamental theorem of calculus. Review u-substitution. Review integration by parts. Do lots of integration eamples. 1 Funamental Theorem of Calculus In

More information

Lecture 6: Calculus. In Song Kim. September 7, 2011

Lecture 6: Calculus. In Song Kim. September 7, 2011 Lecture 6: Calculus In Song Kim September 7, 20 Introuction to Differential Calculus In our previous lecture we came up with several ways to analyze functions. We saw previously that the slope of a linear

More information

LATTICE-BASED D-OPTIMUM DESIGN FOR FOURIER REGRESSION

LATTICE-BASED D-OPTIMUM DESIGN FOR FOURIER REGRESSION The Annals of Statistics 1997, Vol. 25, No. 6, 2313 2327 LATTICE-BASED D-OPTIMUM DESIGN FOR FOURIER REGRESSION By Eva Riccomagno, 1 Rainer Schwabe 2 an Henry P. Wynn 1 University of Warwick, Technische

More information

INTERSECTION HOMOLOGY OF LINKAGE SPACES IN ODD DIMENSIONAL EUCLIDEAN SPACE

INTERSECTION HOMOLOGY OF LINKAGE SPACES IN ODD DIMENSIONAL EUCLIDEAN SPACE INTERSECTION HOMOLOGY OF LINKAGE SPACES IN ODD DIMENSIONAL EUCLIDEAN SPACE DIRK SCHÜTZ Abstract. We consier the mouli spaces M (l) of a close linkage with n links an prescribe lengths l R n in -imensional

More information

A FURTHER REFINEMENT OF MORDELL S BOUND ON EXPONENTIAL SUMS

A FURTHER REFINEMENT OF MORDELL S BOUND ON EXPONENTIAL SUMS A FURTHER REFINEMENT OF MORDELL S BOUND ON EXPONENTIAL SUMS TODD COCHRANE, JEREMY COFFELT, AND CHRISTOPHER PINNER 1. Introuction For a prime p, integer Laurent polynomial (1.1) f(x) = a 1 x k 1 + + a r

More information

Characterizing Real-Valued Multivariate Complex Polynomials and Their Symmetric Tensor Representations

Characterizing Real-Valued Multivariate Complex Polynomials and Their Symmetric Tensor Representations Characterizing Real-Value Multivariate Complex Polynomials an Their Symmetric Tensor Representations Bo JIANG Zhening LI Shuzhong ZHANG December 31, 2014 Abstract In this paper we stuy multivariate polynomial

More information

23 Implicit differentiation

23 Implicit differentiation 23 Implicit ifferentiation 23.1 Statement The equation y = x 2 + 3x + 1 expresses a relationship between the quantities x an y. If a value of x is given, then a corresponing value of y is etermine. For

More information

Designing Information Devices and Systems II Fall 2017 Note Theorem: Existence and Uniqueness of Solutions to Differential Equations

Designing Information Devices and Systems II Fall 2017 Note Theorem: Existence and Uniqueness of Solutions to Differential Equations EECS 6B Designing Information Devices an Systems II Fall 07 Note 3 Secon Orer Differential Equations Secon orer ifferential equations appear everywhere in the real worl. In this note, we will walk through

More information

FIRST YEAR PHD REPORT

FIRST YEAR PHD REPORT FIRST YEAR PHD REPORT VANDITA PATEL Abstract. We look at some potential links between totally real number fiels an some theta expansions (these being moular forms). The literature relate to moular forms

More information

Least-Squares Regression on Sparse Spaces

Least-Squares Regression on Sparse Spaces Least-Squares Regression on Sparse Spaces Yuri Grinberg, Mahi Milani Far, Joelle Pineau School of Computer Science McGill University Montreal, Canaa {ygrinb,mmilan1,jpineau}@cs.mcgill.ca 1 Introuction

More information

2Algebraic ONLINE PAGE PROOFS. foundations

2Algebraic ONLINE PAGE PROOFS. foundations Algebraic founations. Kick off with CAS. Algebraic skills.3 Pascal s triangle an binomial expansions.4 The binomial theorem.5 Sets of real numbers.6 Surs.7 Review . Kick off with CAS Playing lotto Using

More information

THE GENUINE OMEGA-REGULAR UNITARY DUAL OF THE METAPLECTIC GROUP

THE GENUINE OMEGA-REGULAR UNITARY DUAL OF THE METAPLECTIC GROUP THE GENUINE OMEGA-REGULAR UNITARY DUAL OF THE METAPLECTIC GROUP ALESSANDRA PANTANO, ANNEGRET PAUL, AND SUSANA A. SALAMANCA-RIBA Abstract. We classify all genuine unitary representations of the metaplectic

More information

Notes on the Matrix-Tree theorem and Cayley s tree enumerator

Notes 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 information

(Uniform) determinantal representations

(Uniform) determinantal representations 1 (Uniform) determinantal representations Jan Draisma Universität Bern October 216, Kolloquium Bern Determinantal representations 2 R := C[x 1,..., x n ] and R d := {p R deg p d} Definition A determinantal

More information

Large Triangles in the d-dimensional Unit-Cube (Extended Abstract)

Large Triangles in the d-dimensional Unit-Cube (Extended Abstract) Large Triangles in the -Dimensional Unit-Cube Extene Abstract) Hanno Lefmann Fakultät für Informatik, TU Chemnitz, D-0907 Chemnitz, Germany lefmann@informatik.tu-chemnitz.e Abstract. We consier a variant

More information

Implicit Differentiation

Implicit Differentiation Implicit Differentiation Thus far, the functions we have been concerne with have been efine explicitly. A function is efine explicitly if the output is given irectly in terms of the input. For instance,

More information

arxiv: v2 [math.cv] 2 Mar 2018

arxiv: v2 [math.cv] 2 Mar 2018 The quaternionic Gauss-Lucas Theorem Riccaro Ghiloni Alessanro Perotti Department of Mathematics, University of Trento Via Sommarive 14, I-38123 Povo Trento, Italy riccaro.ghiloni@unitn.it, alessanro.perotti@unitn.it

More information

Summary: Differentiation

Summary: Differentiation Techniques of Differentiation. Inverse Trigonometric functions The basic formulas (available in MF5 are: Summary: Differentiation ( sin ( cos The basic formula can be generalize as follows: Note: ( sin

More information

Iterated Point-Line Configurations Grow Doubly-Exponentially

Iterated Point-Line Configurations Grow Doubly-Exponentially Iterate Point-Line Configurations Grow Doubly-Exponentially Joshua Cooper an Mark Walters July 9, 008 Abstract Begin with a set of four points in the real plane in general position. A to this collection

More information

Lecture XII. where Φ is called the potential function. Let us introduce spherical coordinates defined through the relations

Lecture XII. where Φ is called the potential function. Let us introduce spherical coordinates defined through the relations Lecture XII Abstract We introuce the Laplace equation in spherical coorinates an apply the metho of separation of variables to solve it. This will generate three linear orinary secon orer ifferential equations:

More information

The total derivative. Chapter Lagrangian and Eulerian approaches

The total derivative. Chapter Lagrangian and Eulerian approaches Chapter 5 The total erivative 51 Lagrangian an Eulerian approaches The representation of a flui through scalar or vector fiels means that each physical quantity uner consieration is escribe as a function

More information

On the minimum distance of elliptic curve codes

On the minimum distance of elliptic curve codes On the minimum istance of elliptic curve coes Jiyou Li Department of Mathematics Shanghai Jiao Tong University Shanghai PRChina Email: lijiyou@sjtueucn Daqing Wan Department of Mathematics University of

More information

12.11 Laplace s Equation in Cylindrical and

12.11 Laplace s Equation in Cylindrical and SEC. 2. Laplace s Equation in Cylinrical an Spherical Coorinates. Potential 593 2. Laplace s Equation in Cylinrical an Spherical Coorinates. Potential One of the most important PDEs in physics an engineering

More information

Proof by Mathematical Induction.

Proof by Mathematical Induction. Proof by Mathematical Inuction. Mathematicians have very peculiar characteristics. They like proving things or mathematical statements. Two of the most important techniques of mathematical proof are proof

More information

Systems & Control Letters

Systems & Control Letters Systems & ontrol Letters ( ) ontents lists available at ScienceDirect Systems & ontrol Letters journal homepage: www.elsevier.com/locate/sysconle A converse to the eterministic separation principle Jochen

More information

Mathematics 116 HWK 25a Solutions 8.6 p610

Mathematics 116 HWK 25a Solutions 8.6 p610 Mathematics 6 HWK 5a Solutions 8.6 p6 Problem, 8.6, p6 Fin a power series representation for the function f() = etermine the interval of convergence. an Solution. Begin with the geometric series = + +

More information

Computing Derivatives

Computing Derivatives Chapter 2 Computing Derivatives 2.1 Elementary erivative rules Motivating Questions In this section, we strive to unerstan the ieas generate by the following important questions: What are alternate notations

More information

Agmon Kolmogorov Inequalities on l 2 (Z d )

Agmon Kolmogorov Inequalities on l 2 (Z d ) Journal of Mathematics Research; Vol. 6, No. ; 04 ISSN 96-9795 E-ISSN 96-9809 Publishe by Canaian Center of Science an Eucation Agmon Kolmogorov Inequalities on l (Z ) Arman Sahovic Mathematics Department,

More information

On the Expansion of Group based Lifts

On the Expansion of Group based Lifts On the Expansion of Group base Lifts Naman Agarwal, Karthekeyan Chanrasekaran, Alexanra Kolla, Vivek Maan July 7, 015 Abstract A k-lift of an n-vertex base graph G is a graph H on n k vertices, where each

More information

THE 2-SECANT VARIETIES OF THE VERONESE EMBEDDING

THE 2-SECANT VARIETIES OF THE VERONESE EMBEDDING THE 2-SECANT VARIETIES OF THE VERONESE EMBEDDING ALEX MASSARENTI Cortona - July 4, 2012 1 Abstract. We prove that a general polynomial F k[x 0,..., x n] amits a ecomposition as sum of h = 2 powers of linear

More information

Sharp Thresholds. Zachary Hamaker. March 15, 2010

Sharp Thresholds. Zachary Hamaker. March 15, 2010 Sharp Threshols Zachary Hamaker March 15, 2010 Abstract The Kolmogorov Zero-One law states that for tail events on infinite-imensional probability spaces, the probability must be either zero or one. Behavior

More information

Table of Common Derivatives By David Abraham

Table of Common Derivatives By David Abraham Prouct an Quotient Rules: Table of Common Derivatives By Davi Abraham [ f ( g( ] = [ f ( ] g( + f ( [ g( ] f ( = g( [ f ( ] g( g( f ( [ g( ] Trigonometric Functions: sin( = cos( cos( = sin( tan( = sec

More information

Counting Lattice Points in Polytopes: The Ehrhart Theory

Counting Lattice Points in Polytopes: The Ehrhart Theory 3 Counting Lattice Points in Polytopes: The Ehrhart Theory Ubi materia, ibi geometria. Johannes Kepler (1571 1630) Given the profusion of examples that gave rise to the polynomial behavior of the integer-point

More information

Tractability results for weighted Banach spaces of smooth functions

Tractability results for weighted Banach spaces of smooth functions Tractability results for weighte Banach spaces of smooth functions Markus Weimar Mathematisches Institut, Universität Jena Ernst-Abbe-Platz 2, 07740 Jena, Germany email: markus.weimar@uni-jena.e March

More information

A Sketch of Menshikov s Theorem

A Sketch of Menshikov s Theorem A Sketch of Menshikov s Theorem Thomas Bao March 14, 2010 Abstract Let Λ be an infinite, locally finite oriente multi-graph with C Λ finite an strongly connecte, an let p

More information

Equal Sums of Three Powers

Equal Sums of Three Powers Equal Sums of Three Powers T.D. Browning an D.R. Heath-Brown Mathematical Institute, Oxfor 1 Introuction In this paper we shall be concerne with the number N (B) of positive integer solutions to the equation

More information

6 General properties of an autonomous system of two first order ODE

6 General properties of an autonomous system of two first order ODE 6 General properties of an autonomous system of two first orer ODE Here we embark on stuying the autonomous system of two first orer ifferential equations of the form ẋ 1 = f 1 (, x 2 ), ẋ 2 = f 2 (, x

More information

FLUCTUATIONS IN THE NUMBER OF POINTS ON SMOOTH PLANE CURVES OVER FINITE FIELDS. 1. Introduction

FLUCTUATIONS IN THE NUMBER OF POINTS ON SMOOTH PLANE CURVES OVER FINITE FIELDS. 1. Introduction FLUCTUATIONS IN THE NUMBER OF POINTS ON SMOOTH PLANE CURVES OVER FINITE FIELDS ALINA BUCUR, CHANTAL DAVID, BROOKE FEIGON, MATILDE LALÍN 1 Introuction In this note, we stuy the fluctuations in the number

More information

Perfect Matchings in Õ(n1.5 ) Time in Regular Bipartite Graphs

Perfect Matchings in Õ(n1.5 ) Time in Regular Bipartite Graphs Perfect Matchings in Õ(n1.5 ) Time in Regular Bipartite Graphs Ashish Goel Michael Kapralov Sanjeev Khanna Abstract We consier the well-stuie problem of fining a perfect matching in -regular bipartite

More information

A Novel Decoupled Iterative Method for Deep-Submicron MOSFET RF Circuit Simulation

A Novel Decoupled Iterative Method for Deep-Submicron MOSFET RF Circuit Simulation A Novel ecouple Iterative Metho for eep-submicron MOSFET RF Circuit Simulation CHUAN-SHENG WANG an YIMING LI epartment of Mathematics, National Tsing Hua University, National Nano evice Laboratories, an

More information

arxiv: v1 [math.co] 29 May 2009

arxiv: v1 [math.co] 29 May 2009 arxiv:0905.4913v1 [math.co] 29 May 2009 simple Havel-Hakimi type algorithm to realize graphical egree sequences of irecte graphs Péter L. Erős an István Miklós. Rényi Institute of Mathematics, Hungarian

More information

McMaster University. Advanced Optimization Laboratory. Title: The Central Path Visits all the Vertices of the Klee-Minty Cube.

McMaster University. Advanced Optimization Laboratory. Title: The Central Path Visits all the Vertices of the Klee-Minty Cube. McMaster University Avance Optimization Laboratory Title: The Central Path Visits all the Vertices of the Klee-Minty Cube Authors: Antoine Deza, Eissa Nematollahi, Reza Peyghami an Tamás Terlaky AvOl-Report

More information

LINEAR DIFFERENTIAL EQUATIONS OF ORDER 1. where a(x) and b(x) are functions. Observe that this class of equations includes equations of the form

LINEAR DIFFERENTIAL EQUATIONS OF ORDER 1. where a(x) and b(x) are functions. Observe that this class of equations includes equations of the form LINEAR DIFFERENTIAL EQUATIONS OF ORDER 1 We consier ifferential equations of the form y + a()y = b(), (1) y( 0 ) = y 0, where a() an b() are functions. Observe that this class of equations inclues equations

More information

arxiv: v4 [math.pr] 27 Jul 2016

arxiv: v4 [math.pr] 27 Jul 2016 The Asymptotic Distribution of the Determinant of a Ranom Correlation Matrix arxiv:309768v4 mathpr] 7 Jul 06 AM Hanea a, & GF Nane b a Centre of xcellence for Biosecurity Risk Analysis, University of Melbourne,

More information

Lecture Introduction. 2 Examples of Measure Concentration. 3 The Johnson-Lindenstrauss Lemma. CS-621 Theory Gems November 28, 2012

Lecture Introduction. 2 Examples of Measure Concentration. 3 The Johnson-Lindenstrauss Lemma. CS-621 Theory Gems November 28, 2012 CS-6 Theory Gems November 8, 0 Lecture Lecturer: Alesaner Mąry Scribes: Alhussein Fawzi, Dorina Thanou Introuction Toay, we will briefly iscuss an important technique in probability theory measure concentration

More information

Convergence of Random Walks

Convergence of Random Walks Chapter 16 Convergence of Ranom Walks This lecture examines the convergence of ranom walks to the Wiener process. This is very important both physically an statistically, an illustrates the utility of

More information

The Non-abelian Hodge Correspondence for Non-Compact Curves

The Non-abelian Hodge Correspondence for Non-Compact Curves 1 Section 1 Setup The Non-abelian Hoge Corresponence for Non-Compact Curves Chris Elliott May 8, 2011 1 Setup In this talk I will escribe the non-abelian Hoge theory of a non-compact curve. This was worke

More information

arxiv: v1 [math.co] 15 Sep 2015

arxiv: v1 [math.co] 15 Sep 2015 Circular coloring of signe graphs Yingli Kang, Eckhar Steffen arxiv:1509.04488v1 [math.co] 15 Sep 015 Abstract Let k, ( k) be two positive integers. We generalize the well stuie notions of (k, )-colorings

More information

Math 115 Section 018 Course Note

Math 115 Section 018 Course Note Course Note 1 General Functions Definition 1.1. A function is a rule that takes certain numbers as inputs an assigns to each a efinite output number. The set of all input numbers is calle the omain of

More information

Descriptive Complexity of Linear Equation Systems and Applications to Propositional Proof Complexity

Descriptive Complexity of Linear Equation Systems and Applications to Propositional Proof Complexity Descriptive Complexity of Linear Equation Systems an Applications to Propositional Proof Complexity Martin Grohe RWTH Aachen University grohe@informatik.rwth-aachen.e Wie Pakusa University of Oxfor wie.pakusa@cs.ox.ac.uk

More information

Lower bounds on Locality Sensitive Hashing

Lower bounds on Locality Sensitive Hashing Lower bouns on Locality Sensitive Hashing Rajeev Motwani Assaf Naor Rina Panigrahy Abstract Given a metric space (X, X ), c 1, r > 0, an p, q [0, 1], a istribution over mappings H : X N is calle a (r,

More information

On combinatorial approaches to compressed sensing

On combinatorial approaches to compressed sensing On combinatorial approaches to compresse sensing Abolreza Abolhosseini Moghaam an Hayer Raha Department of Electrical an Computer Engineering, Michigan State University, East Lansing, MI, U.S. Emails:{abolhos,raha}@msu.eu

More information

Resistant Polynomials and Stronger Lower Bounds for Depth-Three Arithmetical Formulas

Resistant Polynomials and Stronger Lower Bounds for Depth-Three Arithmetical Formulas Resistant Polynomials an Stronger Lower Bouns for Depth-Three Arithmetical Formulas Maurice J. Jansen University at Buffalo Kenneth W.Regan University at Buffalo Abstract We erive quaratic lower bouns

More information

A Weak First Digit Law for a Class of Sequences

A Weak First Digit Law for a Class of Sequences International Mathematical Forum, Vol. 11, 2016, no. 15, 67-702 HIKARI Lt, www.m-hikari.com http://x.oi.org/10.1288/imf.2016.6562 A Weak First Digit Law for a Class of Sequences M. A. Nyblom School of

More information

LIAISON OF MONOMIAL IDEALS

LIAISON OF MONOMIAL IDEALS LIAISON OF MONOMIAL IDEALS CRAIG HUNEKE AND BERND ULRICH Abstract. We give a simple algorithm to ecie whether a monomial ieal of nite colength in a polynomial ring is licci, i.e., in the linkage class

More information

c i r i i=1 r 1 = [1, 2] r 2 = [0, 1] r 3 = [3, 4].

c i r i i=1 r 1 = [1, 2] r 2 = [0, 1] r 3 = [3, 4]. Lecture Notes: Rank of a Matrix Yufei Tao Department of Computer Science and Engineering Chinese University of Hong Kong taoyf@cse.cuhk.edu.hk 1 Linear Independence Definition 1. Let r 1, r 2,..., r m

More information

Quantum Mechanics in Three Dimensions

Quantum Mechanics in Three Dimensions Physics 342 Lecture 20 Quantum Mechanics in Three Dimensions Lecture 20 Physics 342 Quantum Mechanics I Monay, March 24th, 2008 We begin our spherical solutions with the simplest possible case zero potential.

More information

Chromatic number for a generalization of Cartesian product graphs

Chromatic number for a generalization of Cartesian product graphs Chromatic number for a generalization of Cartesian prouct graphs Daniel Král Douglas B. West Abstract Let G be a class of graphs. The -fol gri over G, enote G, is the family of graphs obtaine from -imensional

More information

18.312: Algebraic Combinatorics Lionel Levine. Lecture 19

18.312: Algebraic Combinatorics Lionel Levine. Lecture 19 832: Algebraic Combinatorics Lionel Levine Lecture date: April 2, 20 Lecture 9 Notes by: David Witmer Matrix-Tree Theorem Undirected Graphs Let G = (V, E) be a connected, undirected graph with n vertices,

More information

Problem Sheet 2: Eigenvalues and eigenvectors and their use in solving linear ODEs

Problem Sheet 2: Eigenvalues and eigenvectors and their use in solving linear ODEs Problem Sheet 2: Eigenvalues an eigenvectors an their use in solving linear ODEs If you fin any typos/errors in this problem sheet please email jk28@icacuk The material in this problem sheet is not examinable

More information