Monomial conjecture

Monomial conjecture

In commutative algebra, a subfield of mathematics, the monomial conjecture of Melvin Hochster says the following:[1]

Let A be a Noetherian local ring of Krull dimension d and let x1, ..., xd be a system of parameters for A (so that A/(x1, ..., xd) is an Artinian ring. Then for all positive integers t, we have

 x_1^t \cdots x_d^t \not\in (x_1^{t+1},\dots,x_d^{t+1}). \,

The statement can relatively easily be shown in characteristic zero.

References


Wikimedia Foundation. 2010.

Игры ⚽ Поможем написать курсовую

Look at other dictionaries:

  • N!-conjecture — In mathematics, the n! conjecture is the conjecture that the dimension of a certain bi graded module of diagonal harmonics is n!. It was made by A. M. Garsia and proved by M. Haiman. It implies Macdonald s positivity conjecture about his… …   Wikipedia

  • n! conjecture — In mathematics, the n! conjecture is the conjecture that the dimension of a certain bi graded module of diagonal harmonics is n!. It was made by A. M. Garsia and M. Haiman and later proved by M. Haiman. It implies Macdonald s positivity… …   Wikipedia

  • List of mathematics articles (M) — NOTOC M M estimator M group M matrix M separation M set M. C. Escher s legacy M. Riesz extension theorem M/M/1 model Maass wave form Mac Lane s planarity criterion Macaulay brackets Macbeath surface MacCormack method Macdonald polynomial Machin… …   Wikipedia

  • Combinatorial commutative algebra — is a relatively new, rapidly developing mathematical discipline. As the name implies, it lies at the intersection of two more established fields, commutative algebra and combinatorics, and frequently uses methods of one to address problems… …   Wikipedia

  • Macdonald polynomials — In mathematics, Macdonald polynomials Pλ(x; t,q) are a family of orthogonal polynomials in several variables, introduced by Macdonald (1987). Macdonald originally associated his polynomials with weights λ of finite root systems and used just …   Wikipedia

  • Macdonald polynomial — In mathematics, Macdonald polynomials P λ are a two parameter family of orthogonal polynomials indexed by a positive weight λ of a root system, introduced by Ian G. Macdonald (1987). They generalize several other families of orthogonal… …   Wikipedia

  • List of combinatorics topics — This is a list of combinatorics topics.A few decades ago it might have been said that combinatorics is little more than a way to classify poorly understood problems, and some standard remedies. Great progress has been made since 1960.This page is …   Wikipedia

  • Restricted sumset — In additive number theory and combinatorics, a restricted sumset has the form where are finite nonempty subsets of a field F and is a polynomial over F. When …   Wikipedia

  • Timeline of algebra and geometry — A timeline of algebra and geometryBefore 1000 BC* ca. 2000 BC Scotland, Carved Stone Balls exhibit a variety of symmetries including all of the symmetries of Platonic solids. * 1800 BC Moscow Mathematical Papyrus, findings volume of a frustum *… …   Wikipedia

  • Finite difference — A finite difference is a mathematical expression of the form f(x + b) − f(x + a). If a finite difference is divided by b − a, one gets a difference quotient. The approximation of derivatives by finite differences… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”