Quantum \((abc)\)-theorems (Q1976813): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
Property / DOI | |||
Property / DOI: 10.1006/jnth.1999.2485 / rank | |||
Property / DOI | |||
Property / DOI: 10.1006/JNTH.1999.2485 / rank | |||
Normal rank |
Latest revision as of 16:03, 16 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Quantum \((abc)\)-theorems |
scientific article |
Statements
Quantum \((abc)\)-theorems (English)
0 references
17 August 2002
0 references
We recall that, very loosely speaking, the \(abc\) theorem for relatively prime polynomials \(a\), \(b\), and \(c\) not all constant says that if \(a+b=c\), then not too many of the zeros of \(a\), \(b\), and \(c\) can have high multiplicity (one says a polynomial \(f\) is `constant' if \(f'=0\); note the subtlety in characteristic \(p\)). Here the author replaces `zeros of high multiplicity' by `sets of zeros in progression' -- that too in a fairly generalised sense: thus one may have a `multiset of zeros in progression', namely a divisor (in the sense used in algebraic geometry \(\alpha+f\alpha+\cdots+f^{m-1}\alpha\), where \(f\) is a map of the set of potential zeros into itself. Very familiar examples include `running powers' \((x)^h_n=x(x+h)\cdots(x+(n-1)h)\) and the `\(q\)-version' of \(x^n\), namely \((1-x;q)_n=(1-(1-x))(1-(1-x)q)\cdots(1-(1-x)q^{n-1})\). The author provides less familiar generalisations.
0 references
\(abc\) theorem
0 references
relatively prime polynomials
0 references
multiset of zeros in progression
0 references