On the smallest number of terms of vanishing sums of units in number fields (Q1786703): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Created claim: Wikidata QID (P12): Q129802026, #quickstatements; #temporary_batch_1724714018853
 
(5 intermediate revisions by 5 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Magma / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963920014 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1806.00296 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Magma algebra system. I: The user language / rank
 
Normal rank
Property / cites work
 
Property / cites work: On trinominals of type $x^n+Ax^m+1$. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On conjectures and problems of Ruzsa concerning difference graphs of \(S\)-units / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3665191 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3338318 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unit Equations in Diophantine Number Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3807295 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Norms of factors of polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5663983 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3215331 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3903067 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4203438 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On certain arithmetic graphs and their applications to diophantine problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Irreducibility criteria of Schur-type and Pólya-type / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representation of finite graphs as difference graphs of \(S\)-units. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representation of finite graphs as difference graphs of \(S\)-units. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4141925 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for the solutions of S-unit equations and decomposable form equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5724382 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3597606 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3315578 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Inequality About Factors of Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sur un type particulier d'unités algébriques / rank
 
Normal rank
Property / cites work
 
Property / cites work: The difference graph of $S$-units / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4280700 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4488096 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the reduced length of a polynomial with real coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the reduced length of a polynomial with real coefficients. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diophantine approximations and diophantine equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3611737 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5580395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4210105 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cubic factors of certain trinominals. / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129802026 / rank
 
Normal rank

Latest revision as of 00:21, 27 August 2024

scientific article
Language Label Description Also known as
English
On the smallest number of terms of vanishing sums of units in number fields
scientific article

    Statements

    On the smallest number of terms of vanishing sums of units in number fields (English)
    0 references
    24 September 2018
    0 references
    Let \(\mathfrak O\) be an order of an algebraic number field \(K\). For any natural number \(k \geq 3\) one asks whether there exist units \(\varepsilon_1, \dots, \varepsilon_k\) of \(\mathfrak O\) with \[ \varepsilon_1+ \dots + \varepsilon_k =0 \] with no proper vanishing subsum. Let \(\ell(\mathfrak O)\) (\(\ell_o(\mathfrak O)\), \(\ell_e(\mathfrak O)\), resp.) denote the smallest (odd, even, resp.) number \(k\geq3\), for which such units exist. If \(\mathfrak O\) equals the ring of integers of \(K\), write \(\ell(K)\) (\(\ell_o(K)\), \(\ell_e(K)\), resp.). The authors prove the following results: For any \(K\) with infinitely many units, \(\ell_e(K)\) (and therefore also \(\ell(K)\)) is finite. For any \(k \geq 3\) there exists an order (in a quadratic number field) with \(\ell(\mathfrak O)=k\) and (up to the exceptions \(k=4t^4-4t+2\)) a (imaginary, cubic) number field with \(\ell(K)=k\), but on the other hand, there exist only finitely many number fields \(K\) with unit rank one, for which \(\ell(K) \leq k\). The different behaviour of odd and even \(k\) is shown by the following results: For any \(d \geq 2\) there exist infinitely many number fields \(K\) of degree \(d\) with \(\ell_o(K)=\infty\), whereas for any \(d \geq 3\) there exist infinitely many number fields \(K\) of degree \(d\) with \(\ell_e(K)=4\). The ideas for the proofs are from classical algebraic number theory. Finally, an application to certain arithmetic graphs is given.
    0 references
    0 references
    unit equation
    0 references
    length of a polynomial
    0 references
    regulator
    0 references
    arithmetic graph
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers