Low degree solutions to linear equations with \(K[x]\) coefficients (Q1332660)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Low degree solutions to linear equations with \(K[x]\) coefficients |
scientific article |
Statements
Low degree solutions to linear equations with \(K[x]\) coefficients (English)
0 references
26 February 1995
0 references
If \(f_ 1,\dots, f_ m\in K[x]\), \(K\) a field, are relatively prime then 1 can be expressed as \(1= \sum_{i=1}^ m a_ i f_ i\). In \textit{K. KakiƩ} [Proc. Am. Math. Soc. 54, 1-7 (1976; Zbl 0322.12102)] the bound \[ \deg(a_ i)< \max_{1\leq j\leq m} (\deg (f_ j))+ \min_{1\leq j\leq m} (\deg(f_ j))- \deg(f_ i) \] is given. This bound can also be found in \textit{B. Shiffman} [Mich. Math. J. 36, No. 2, 163-171 (1989; Zbl 0691.12010)]. In this paper we obtain the new bound, \(G_ i\), \[ G_ 1\leq \max_{1\leq j\leq m} (\deg(f_ j))- T+1 \quad \text{and} \quad G_ i\leq \min_{1\leq j\leq m} (\deg(f_ j))- T+1 \quad \text{for } i\in \{2,\dots, m\} \] on the degree of the \(a_ i\), where \(f_ 1\) is a polynomial of minimal degree among the \(f_ i\) and no subset of the \(f_ i\) of cardinality \(T\) is relatively prime. We give a class of polynomials for every \(m\) in which this bound is attained and prove sharper bounds in a special case.
0 references
polynomial equations
0 references
low degree solutions
0 references
linear equations
0 references
degree bounds
0 references