IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-319-65874-2_5.html
   My bibliography  Save this book chapter

Minimal Generating Sets for the D-Algebra Int(S, D)

In: Rings, Polynomials, and Modules

Author

Listed:
  • Jacques Boulanger

    (Université de Picardie, LAMFA/CNRS-UMR 7352)

  • Jean-Luc Chabert

    (Université de Picardie, LAMFA/CNRS-UMR 7352)

Abstract

We are looking for minimal generating sets for the D-algebra Int(S, D) of integer-valued polynomials on any infinite subset S of a Dedekind domain D. For instance, the binomial polynomials X p r , $$\binom{X}{p^{r}},$$ where p is a prime number and r is any nonnegative integer, form a minimal generating set for the classical ℤ $$\mathbb{Z}$$ -algebra Int ( ℤ ) = { f ∈ ℚ [ X ] ∣ f ( ℤ ) ⊆ ℤ } . $$(\mathbb{Z}) =\{ f \in \mathbb{Q}[X]\mid f(\mathbb{Z}) \subseteq \mathbb{Z}\}.$$ In the local case, when D is a valuation domain and S is a regular subset of D, we are able to construct minimal generating sets, but we are not always able to extract from a generating set a minimal one. In particular, we prove that, in local fields, the generating set of integer-valued polynomials obtained by de Shalit and Iceland by means of Lubin-Tate formal group laws is minimal. In our proofs we make an extensive use of Bhargava’s notion of p-ordering.

Suggested Citation

  • Jacques Boulanger & Jean-Luc Chabert, 2017. "Minimal Generating Sets for the D-Algebra Int(S, D)," Springer Books, in: Marco Fontana & Sophie Frisch & Sarah Glaz & Francesca Tartarone & Paolo Zanardo (ed.), Rings, Polynomials, and Modules, pages 79-101, Springer.
  • Handle: RePEc:spr:sprchp:978-3-319-65874-2_5
    DOI: 10.1007/978-3-319-65874-2_5
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-3-319-65874-2_5. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.